| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 105858 |
2019-04-15T11:00:53 Z |
Alexa2001 |
Lamps (JOI19_lamps) |
C++17 |
|
1000 ms |
18132 KB |
#include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e6 + 5;
int a[Nmax], b[Nmax], a0[Nmax], b0[Nmax];
int i, n;
int main()
{
// freopen("input", "r", stdin);
cin.sync_with_stdio(false);
cin >> n;
string A, B;
cin >> A >> B;
for(i=1; i<=n; ++i)
a0[i] = A[i-1] - '0', b0[i] = B[i-1] - '0';
for(i=1; i<=n+1; ++i)
a[i] = a0[i-1] ^ a0[i], b[i] = b0[i-1] ^ b0[i];
int cnt = 0, j;
for(i=1; i<=n; ++i)
if(a[i] ^ b[i])
{
int k = -1;
for(j=i+1; k == -1 && j<=n; ++j)
if(a[j] & b[j]) k = j;
if(k == -1) k = n;
for(j=k; j>=i && !(a[j] ^ b[j]); --j);
if(j == i) continue;
cnt ++;
a[j] ^= 1; a[i] ^= 1;
for(--j; j>i; --j) a[j] = 0;
i = j;
}
int cnt2 = 0;
for(j=1; j<=n+1; ++j)
if(a[j] ^ b[j]) cnt2 ++;
cnt += (cnt2+1) / 2;
cout << cnt << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
2 ms |
356 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
3 ms |
384 KB |
Output is correct |
| 7 |
Correct |
2 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
3 ms |
384 KB |
Output is correct |
| 10 |
Correct |
2 ms |
384 KB |
Output is correct |
| 11 |
Correct |
2 ms |
384 KB |
Output is correct |
| 12 |
Correct |
3 ms |
384 KB |
Output is correct |
| 13 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
2 ms |
356 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
3 ms |
384 KB |
Output is correct |
| 7 |
Correct |
2 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
3 ms |
384 KB |
Output is correct |
| 10 |
Correct |
2 ms |
384 KB |
Output is correct |
| 11 |
Correct |
2 ms |
384 KB |
Output is correct |
| 12 |
Correct |
3 ms |
384 KB |
Output is correct |
| 13 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
3 ms |
384 KB |
Output is correct |
| 3 |
Correct |
3 ms |
384 KB |
Output is correct |
| 4 |
Correct |
3 ms |
384 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
2 ms |
384 KB |
Output is correct |
| 7 |
Correct |
26 ms |
18124 KB |
Output is correct |
| 8 |
Execution timed out |
1058 ms |
18132 KB |
Time limit exceeded |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
384 KB |
Output is correct |
| 4 |
Correct |
2 ms |
356 KB |
Output is correct |
| 5 |
Correct |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
3 ms |
384 KB |
Output is correct |
| 7 |
Correct |
2 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
3 ms |
384 KB |
Output is correct |
| 10 |
Correct |
2 ms |
384 KB |
Output is correct |
| 11 |
Correct |
2 ms |
384 KB |
Output is correct |
| 12 |
Correct |
3 ms |
384 KB |
Output is correct |
| 13 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
