# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114300 | tincamatei | Lamps (JOI19_lamps) | C++14 | 144 ms | 27896 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;
char getChar(FILE *fin) {
char ch = fgetc(fin);
while(!isdigit(ch))
ch = fgetc(fin);
return ch;
}
const int MAX_N = 1000000;
char str1[1+MAX_N];
char str2[1+MAX_N];
int dp[1+MAX_N][3][2];
// dp[N][0/1/2][0/1] = numarul minim de operatii daca la sfarsit n-am/am set 0/am set 1 si daca n-am/am operatie de xor
int main() {
int N, rez = MAX_N;
scanf("%d", &N);
for(int i = 1; i <= N; ++i)
str1[i] = getChar(stdin);
for(int i = 1; i <= N; ++i)
str2[i] = getChar(stdin);
for(int i = 0; i <= N; ++i)
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... |