Submission #1779580
Source Code Expand
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<cstring>
#include<complex>
#include<cmath>
#include<algorithm>
#include<list>
#include<functional>
#define _USE_MATH_DEFINES
#define X first
#define Y second
#define INF 1987654321
#define PI 3.14159265358979323846264
#define MOD 1000000007
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset(a,0,sizeof(a));
#define MEM_1(a) memset(a,-1,sizeof(a));
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef complex<double> base;
char s[100001];
int main() {
scanf("%s", s);
int n = strlen(s);
fup(i,1,n-1,1)
if (s[i] == s[i - 1])
{
printf("%d %d", i, i + 1);
return 0;
}
fup(i, 2, n - 1, 1)
if (s[i] == s[i - 2])
{
printf("%d %d", i-1, i + 1);
return 0;
}
printf("-1 -1");
}
Submission Info
Submission Time
2017-11-17 19:45:09+0900
Task
D - Unbalanced
User
cheetose
Language
C++14 (GCC 5.4.1)
Score
400
Code Size
1286 Byte
Status
AC
Exec Time
2 ms
Memory
384 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:42:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", s);
^
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
2 ms
384 KB
2_16
AC
2 ms
384 KB
2_17
AC
2 ms
384 KB
2_18
AC
2 ms
384 KB
2_19
AC
2 ms
384 KB
2_20
AC
2 ms
384 KB
2_21
AC
2 ms
384 KB
2_22
AC
2 ms
384 KB
2_23
AC
2 ms
384 KB
2_24
AC
2 ms
384 KB