Submission #1307260
Source Code Expand
#include <bits/stdc++.h>
// #include "ane.cpp"
const int INF = 1e9;
const long long INFLL = 1e18;
const int NMAX = 100005;
const int MMAX = 100005;
const int KMAX = 1005;
const int MOD = 1e9 + 7;
using namespace std;
// comment to disable debug functions
#define DEBUG
// frequently used macros
#if __cplusplus >= 201103L
#define ALL(v) begin(v),end(v)
#define SORT(v) sort(begin(v), end(v))
#define FIND(v,x) find(begin(v), end(v), (x))
#else
#define ALL(v) (v).begin(),(v).end()
#define SORT(v) sort(v.begin(), v.end())
#define FIND(v,x) find(v.begin(), v.end(), (x))
#endif
#define MEMNEXT(from, to) do{ memmove((to), (from), sizeof(from)); \
memset((from), 0, sizeof(from)); } while(0)
#ifdef DEBUG
#define DUMP(x) do{ std::cerr << (#x) << ": " << x << std::endl; }while(0)
#else
#define DUMP(x) do{}while(0)
#endif
// frequent used aliases
typedef long long ll;
typedef pair<int, int> p;
typedef pair<ll, int> pl;
typedef pair<ll, ll> pll;
typedef vector<int> vec;
typedef vector<ll> vecll;
typedef vector<vec> mat;
typedef vector<vecll> matll;
// frequently used constants
static const int di[] = {-1, 0, 1, -1, 1, -1, 0, 1};
static const int dj[] = {-1, -1, -1, 0, 0, 1, 1, 1};
// frequently used structs
struct edge{
int to,cost;
};
// printf for debug
#ifndef DEBUG
void debug(const char* format, ...){}
#else
void debug(const char* format, ...){
va_list arg;
va_start(arg, format);
vprintf(format, arg);
va_end(arg);
}
#endif
// dump vector
#ifdef DEBUG
#define DUMPV(v, c) do{ \
printf("%s: ", #v); \
for (int i = 0; i < (c); ++i) \
{ \
cout << (v)[i] << " "; \
} \
cout << endl; \
} while(0)
#else
#define DUMPV(v,c)
#endif
// std::fill of multi dimensions
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
// binary search
ll BSearch(ll _begin, ll _end, bool (*f)(int)){
ll mid;
while(_end - _begin > 1LL) {
mid = (_begin + _end) / 2LL;
if(f(mid)) {
debug("BSearch: f(%d) == true\n", mid);
_end = mid;
}
else
{
debug("BSearch: f(%d) == false\n", mid);
_begin = mid;
}
}
return _end;
}
ll N,M,K,A,B,C,D,E;
int dp[NMAX] = {};
string S;
vec v;
ll ans = 0;
void solve(){
// main algorithm
for (int i = 1; i < S.size(); ++i)
{
if (S[i] == S[i-1])
{
cout << i << " " << i + 1 << endl;
return;
}else if(i > 1 && S[i] == S[i-2]){
cout << i - 1 << " " << i + 1 << endl;
return;
}
}
cout << "-1 -1\n";
}
void debug(){
// output debug information
}
void answer(){
// output answer
// printf("%lld\n", ans);
}
int main(int argc, char const *argv[])
{
// operate inputs
// Fill(dp, -1);
cin >> S;
solve();
#ifdef DEBUG
debug();
#endif
answer();
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Unbalanced |
User |
anekawa |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
3024 Byte |
Status |
AC |
Exec Time |
5 ms |
Memory |
512 KB |
Judge Result
Set Name |
Sample |
Sub1 |
Sub2 |
Score / Max Score |
0 / 0 |
200 / 200 |
200 / 200 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
0_01, 0_02 |
Sub1 |
0_01, 0_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14 |
Sub2 |
0_01, 0_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 2_15, 2_16, 2_17, 2_18, 2_19, 2_20, 2_21, 2_22, 2_23, 2_24 |
Case Name |
Status |
Exec Time |
Memory |
0_01 |
AC |
1 ms |
256 KB |
0_02 |
AC |
1 ms |
256 KB |
1_03 |
AC |
1 ms |
256 KB |
1_04 |
AC |
1 ms |
256 KB |
1_05 |
AC |
1 ms |
256 KB |
1_06 |
AC |
1 ms |
256 KB |
1_07 |
AC |
1 ms |
256 KB |
1_08 |
AC |
1 ms |
256 KB |
1_09 |
AC |
1 ms |
256 KB |
1_10 |
AC |
1 ms |
256 KB |
1_11 |
AC |
1 ms |
256 KB |
1_12 |
AC |
1 ms |
256 KB |
1_13 |
AC |
1 ms |
256 KB |
1_14 |
AC |
1 ms |
256 KB |
2_15 |
AC |
4 ms |
512 KB |
2_16 |
AC |
4 ms |
512 KB |
2_17 |
AC |
4 ms |
512 KB |
2_18 |
AC |
4 ms |
512 KB |
2_19 |
AC |
4 ms |
512 KB |
2_20 |
AC |
4 ms |
512 KB |
2_21 |
AC |
4 ms |
512 KB |
2_22 |
AC |
5 ms |
512 KB |
2_23 |
AC |
5 ms |
512 KB |
2_24 |
AC |
5 ms |
512 KB |