# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104755 | mzhao | Lamps (JOI19_lamps) | C++11 | 22 ms | 10324 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define D(x...) printf(x)
#else
#define D(x...)
#endif
#define MN 1000009
int N, A[MN], B[MN], ans, dp[MN][2]; // finish with opposite
string AA, BB;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> N >> AA >> BB;
bool SUB3 = 1;
for (int i = 1; i <= N; i++) {
A[i] = AA[i-1] == '1';
B[i] = BB[i-1] == '1';
if (A[i]) SUB3 = 0;
}
if (SUB3) {
for (int i = 1, C; i <= N; i++) {
if ((!i || B[i] != B[i-1]) && B[i]) ans++;
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |