Submission #1898734
Source Code Expand
#include <bits/stdc++.h> #include <unordered_map> #include <unordered_set> #include <stack> #include <queue> #include <deque> #include <string> #include <fstream> #define case(t) printf("Case #%d: ", (t)) #define pii pair<int, int> #define vii vector<pii> #define vi vector<int> #define pb push_back #define mp make_pair #define f first #define s second typedef long long ll; const double pi = acos(-1); const int MOD = 1e9 + 7; const int INF = 1e9 + 7; const int MAXN = 3e5 + 5; const double eps = 1e-9; using namespace std; char tmp[MAXN]; int sum[MAXN]; int main() { scanf("%s", tmp); int n = strlen(tmp); int lo = 0, hi = n; while (lo <= hi) { int mid = (lo + hi) >> 1; int cur = 0, flag = 1; memset(sum, 0, sizeof sum); for (int i = 0; i < n; i++) { cur += sum[i]; if (tmp[i] == '1' && cur % 2 == 0) { if (i + mid > n && i < mid ) { flag = 0; hi = mid - 1; break; } sum[i]++, cur++; sum[i + mid]--; } else if (tmp[i] == '1' && cur % 2 == 1) {} else if (tmp[i] == '0' && cur % 2 == 0) {} else if (tmp[i] == '0' && cur % 2 == 1) { if (i + mid > n && i < mid) { flag = 0; hi = mid - 1; break; } sum[i]++, cur++; sum[i + mid]--; } } if (flag) lo = mid + 1; } printf("%d\n", lo - 1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Wide Flip |
User | eshoru |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1742 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 1536 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:29:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", tmp); ^
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 | 9 ms | 1536 KB |
02.txt | AC | 7 ms | 1536 KB |
03.txt | AC | 9 ms | 1536 KB |
04.txt | AC | 7 ms | 1536 KB |
05.txt | AC | 8 ms | 1536 KB |
06.txt | AC | 7 ms | 1536 KB |
07.txt | AC | 5 ms | 1536 KB |
08.txt | AC | 7 ms | 1536 KB |
09.txt | AC | 8 ms | 1536 KB |
10.txt | AC | 8 ms | 1536 KB |
11.txt | AC | 9 ms | 1536 KB |
12.txt | AC | 6 ms | 1536 KB |
13.txt | AC | 7 ms | 1536 KB |
14.txt | AC | 7 ms | 1536 KB |
15.txt | AC | 8 ms | 1536 KB |
16.txt | AC | 9 ms | 1536 KB |
17.txt | AC | 5 ms | 1536 KB |
18.txt | AC | 5 ms | 1536 KB |
19.txt | AC | 4 ms | 1536 KB |
20.txt | AC | 4 ms | 1536 KB |
21.txt | AC | 2 ms | 1408 KB |
22.txt | AC | 2 ms | 1408 KB |
23.txt | AC | 2 ms | 1408 KB |
24.txt | AC | 2 ms | 1408 KB |
25.txt | AC | 2 ms | 1408 KB |
26.txt | AC | 2 ms | 1408 KB |
27.txt | AC | 2 ms | 1408 KB |
s1.txt | AC | 2 ms | 1408 KB |
s2.txt | AC | 2 ms | 1408 KB |
s3.txt | AC | 2 ms | 1408 KB |