Submission #4030425
Source Code Expand
#include <bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<b;i++) #define per(i,b,a) for(int i=b;i>=a;i--) #define For(i,a,b) for(int i=a;i<=b;i++) #define Forenska(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++) #define pb push_back #define mp make_pair #define mt make_tuple #define fi first #define se second #define all(x) x.begin(),x.end() #define sqr(x) ((x)*(x)) #define lowbit(x) ((x)&(-x)) #define GREATER(x) x,vector<x>,greater<x> #define randIn(L,R) (((LL)rand()*rand())%(R-L)+L) using namespace std; typedef long long LL; typedef pair<int,int> pii; typedef pair<LL,LL> pLL; typedef vector<int> vec; typedef vector<LL> vecL; typedef vector<pii> vecP; typedef vector<pLL> vecPL; typedef vector<string> vecS; typedef vector<vec> mat; typedef complex<double> point; const long double PI=3.14159265358979323846264338327950; const LL INFLL=0x3f3f3f3f3f3f3f3f; const int INF=0x3f3f3f3f; const long double EPS=1e-10; int read() { int x=0; char ch=' '; bool flag=false; while(ch<'0' || ch>'9') { if(ch=='-')flag=true; ch=getchar(); } while(ch>='0' && ch<='9') { x=(x<<3)+(x<<1)+ch-'0'; ch=getchar(); } return flag?-x:x; } int lcm(int a,int b) { return a/__gcd(a,b)*b; } int main() { string s; cin>>s; int k=(s.size()+1)/2; while(s[k]==s[k-1] && s[k]==s[s.size()-k-1])k++; cout<<k<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Wide Flip |
User | We_R_Young |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1465 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
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 | AC | 4 ms | 512 KB |
02.txt | AC | 5 ms | 512 KB |
03.txt | AC | 4 ms | 512 KB |
04.txt | AC | 4 ms | 512 KB |
05.txt | AC | 4 ms | 512 KB |
06.txt | AC | 4 ms | 512 KB |
07.txt | AC | 4 ms | 512 KB |
08.txt | AC | 4 ms | 512 KB |
09.txt | AC | 4 ms | 512 KB |
10.txt | AC | 4 ms | 512 KB |
11.txt | AC | 4 ms | 512 KB |
12.txt | AC | 4 ms | 512 KB |
13.txt | AC | 4 ms | 512 KB |
14.txt | AC | 4 ms | 512 KB |
15.txt | AC | 4 ms | 512 KB |
16.txt | AC | 4 ms | 512 KB |
17.txt | AC | 5 ms | 512 KB |
18.txt | AC | 4 ms | 512 KB |
19.txt | AC | 5 ms | 512 KB |
20.txt | AC | 5 ms | 512 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | AC | 1 ms | 256 KB |
24.txt | AC | 1 ms | 256 KB |
25.txt | AC | 1 ms | 256 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |