Submission #1910868
Source Code Expand
#pragma region include #include <iostream> #include <iomanip> #include <stdio.h> #include <sstream> #include <algorithm> #include <iterator> #include <cmath> #include <complex> #include <string> #include <cstring> #include <vector> #include <tuple> #include <bitset> #include <queue> #include <set> #include <map> #include <stack> #include <list> #include <fstream> #include <random> //#include <time.h> #include <ctime> #pragma endregion //#include ///////// #define REP(i, x, n) for(int i = x; i < n; ++i) #define rep(i,n) REP(i,0,n) #define ALL(X) X.begin(), X.end() ///////// #pragma region typedef typedef long long LL; typedef long double LD; typedef unsigned long long ULL; typedef std::pair<LL,LL> PLL;// typedef std::pair<int,int> PII;// #pragma endregion //typedef ////定数 const int INF = (int)1e9; const LL MOD = (LL)1e9+7; const LL LINF = (LL)4e18+20; const LD PI = acos(-1.0); const double EPS = 1e-9; ///////// using namespace::std; void solve(){ string str; cin >> str; int size = str.size(); int ans,L,R; if( size&1 ){ ans = size/2; L = size/2; R = L; }else{ ans = size/2; L = size/2-1; R = size/2; } while(true){ if( str[L] == str[R] ){ if( L!=R ){ if( str[L]!=str[L+1] ){ break; } } }else{ break; } --L; ++R; ++ans; if( L < 0 ){ break; } } cout << ans << endl; } #pragma region main signed main(void){ std::cin.tie(0); std::ios::sync_with_stdio(false); std::cout << std::fixed;//小数を10進数表示 cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別 solve(); } #pragma endregion //main()
Submission Info
Submission Time | |
---|---|
Task | D - Wide Flip |
User | akarin55 |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1713 Byte |
Status | AC |
Exec Time | 2 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 | 1 ms | 512 KB |
02.txt | AC | 1 ms | 512 KB |
03.txt | AC | 1 ms | 512 KB |
04.txt | AC | 1 ms | 512 KB |
05.txt | AC | 1 ms | 512 KB |
06.txt | AC | 2 ms | 512 KB |
07.txt | AC | 2 ms | 512 KB |
08.txt | AC | 1 ms | 512 KB |
09.txt | AC | 1 ms | 512 KB |
10.txt | AC | 1 ms | 512 KB |
11.txt | AC | 1 ms | 512 KB |
12.txt | AC | 1 ms | 512 KB |
13.txt | AC | 1 ms | 512 KB |
14.txt | AC | 1 ms | 512 KB |
15.txt | AC | 1 ms | 512 KB |
16.txt | AC | 1 ms | 512 KB |
17.txt | AC | 2 ms | 512 KB |
18.txt | AC | 2 ms | 512 KB |
19.txt | AC | 2 ms | 512 KB |
20.txt | AC | 2 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 |