Submission #1985903


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define EPS (1e-7)

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;

int vx[]={0,1,0,-1};
int vy[]={1,0,-1,0};

int dx[]={1,0,-1,1,-1,1,0,-1};
int dy[]={1,1,1,0,0,-1,-1,-1};

const ll mod=1e9+7;
const int INF=INT_MAX/2;
const int MAX=1e9;

const int MAX_N=100001;

int main(){
	string s;
	cin>>s;
	int n=s.size();
	int k=INF;
	for(int i=0;i<n-1;i++){
		if(s[i]!=s[i+1]){
			k=min(k,max(i,n-i));
		}
	}
	cout<<k-1<<endl;
	return 0;
}

Submission Info

Submission Time
Task D - Wide Flip
User kwkm0429
Language C++14 (GCC 5.4.1)
Score 0
Code Size 695 Byte
Status WA
Exec Time 5 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
WA × 1
AC × 10
WA × 20
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt WA 5 ms 512 KB
02.txt AC 5 ms 512 KB
03.txt WA 5 ms 512 KB
04.txt AC 5 ms 512 KB
05.txt WA 5 ms 512 KB
06.txt AC 5 ms 512 KB
07.txt AC 4 ms 512 KB
08.txt AC 5 ms 512 KB
09.txt WA 5 ms 512 KB
10.txt WA 5 ms 512 KB
11.txt AC 5 ms 512 KB
12.txt WA 5 ms 512 KB
13.txt WA 5 ms 512 KB
14.txt WA 5 ms 512 KB
15.txt WA 5 ms 512 KB
16.txt AC 5 ms 512 KB
17.txt WA 4 ms 512 KB
18.txt WA 4 ms 512 KB
19.txt WA 4 ms 512 KB
20.txt WA 4 ms 512 KB
21.txt WA 1 ms 256 KB
22.txt WA 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt WA 1 ms 256 KB
25.txt WA 1 ms 256 KB
26.txt WA 1 ms 256 KB
27.txt WA 1 ms 256 KB
s1.txt WA 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB