# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376138 | daniel920712 | Lamps (JOI19_lamps) | C++14 | 1103 ms | 81644 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 <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
char a[1000005];
char b[1000005];
bool have[1000005]={0};
int DP[1000005],N;
int F(int here)
{
int i,tt;
if(here==N) return 0;
if(have[here]) return DP[here];
have[here]=1;
if(a[here]==b[here]) DP[here]=F(here+1);
else DP[here]=F(here+1)+1;
tt=0;
for(i=here;i<N;i++)
{
if(b[i]=='1'&&(i==here||b[i-1]=='0')) tt++;
DP[here]=min(DP[here],F(i+1)+tt+1);
}
tt=0;
for(i=here;i<N;i++)
{
if(b[i]=='0'&&(i==here||b[i-1]=='1')) tt++;
DP[here]=min(DP[here],F(i+1)+tt+1);
}
for(i=here;i<N;i++)
{
if(a[i]!=b[i]) DP[here]=min(DP[here],F(i+1)+1);
else break;
}
return DP[here];
}
int main()
{
int M,ans=0,i;
scanf("%d",&N);
scanf("%s %s",a,b);
printf("%d\n",F(0));
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... |