Submission #1792342
Source Code Expand
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
using namespace std;
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define p(p) cout<<(p)<<" ";
#define pb push_back
#define mp make_pair
#define INF 1<<25
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pi;
typedef long long ll;
int dy[8]={1,1,1,0,0,-1,-1,-1};
int dx[8]={-1,0,1,-1,1,-1,0,1};
struct S{
int a,b,c;
};
bool asc(const S& left,const S& right){
return left.c > right.c;
}
int n,m,l,r;
string S;
void input(){
cin>>S;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
input();
rep(i,S.size()){
if(i<=S.size()-2){
if(S[i]==S[i+1]){
p(i+1)P(i+2);
return 0;
}
}
if(i<=S.size()-2){
if(S[i]==S[i+2]){
p(i+1)P(i+3);
return 0;
}
}
}
p("-1")P("-1")
return 0;
}
Submission Info
Submission Time |
|
Task |
D - Unbalanced |
User |
ke_to |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1306 Byte |
Status |
AC |
Exec Time |
2 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 |
1 ms |
512 KB |
2_16 |
AC |
1 ms |
512 KB |
2_17 |
AC |
1 ms |
512 KB |
2_18 |
AC |
1 ms |
512 KB |
2_19 |
AC |
1 ms |
512 KB |
2_20 |
AC |
1 ms |
512 KB |
2_21 |
AC |
1 ms |
512 KB |
2_22 |
AC |
2 ms |
512 KB |
2_23 |
AC |
2 ms |
512 KB |
2_24 |
AC |
2 ms |
512 KB |