# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102080 | ainta | Lamps (JOI19_lamps) | C++17 | 72 ms | 25848 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<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int n, w[1010000][2], D[1010000][2][2];
char p[1010000], q[1010000];
int cnt;
int res, cc = 0;
vector<int>V;
int main() {
int i, j, k;
scanf("%d", &n);
scanf("%s", p + 1);
scanf("%s", q + 1);
p[0] = p[n + 1] = '0';
q[0] = q[n + 1] = '0';
for (i = 1; i <= n+1; i++) {
w[i][0] = p[i] - '0';
w[i][1] = q[i] - '0';
}
for(int ii=0;ii<=n;ii++)for (i = 0; i < 2; i++)for (j = 0; j < 2; j++)D[ii][i][j] = 1e9;
D[0][0][0] = 0;
for (i = 1; i <= n; i++) {
D[i - 1][0][0] = min(D[i - 1][0][0], D[i - 1][1][0]);
D[i - 1][0][1] = min(D[i - 1][0][1], D[i - 1][1][1]);
for (j = 0; j < 2; j++) {
for (k = 0; k < 2; k++) {
if (D[i - 1][j][k] > 1e8)continue;
int d = D[i - 1][j][k];
if (j == 0 && k == 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... |