# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384437 | ogibogi2004 | Lamps (JOI19_lamps) | C++14 | 504 ms | 72952 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;
const int MAXN=1e6+6;
int dp[MAXN][4][4];
/*
* 0 - nothing
* 1 - flip
* 2 - 0
* 3 - 1
*/
int a[MAXN],b[MAXN];
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
char c;
cin>>c;
a[i]=c-'0';
}
for(int i=1;i<=n;i++)
{
char c;
cin>>c;
b[i]=c-'0';
}
for(int i=0;i<MAXN;i++)
{
for(int i1=0;i1<4;i1++)
# | 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... |