| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 129125 | mohammedehab2002 | Lamps (JOI19_lamps) | C++11 | 0 ms | 0 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>
using namespace std;
int dp[4][4][1000005];
int main()
{
int n;
string a,b;
cin >> n >> a >> b;
for (int j=0;j<4;j++)
{
for (int k=0;k<4;k++)
dp[j][k][0]=1e9;
}
dp[3][3][0]=0;
for (int i=0;i<=n;i++)
{
int mn=1e9,md[]={1e9,1e9,1e9,1e9};
for (int j=0;j<4;j++)
{
for (int k=0;k<4;k++)
{
dp[j][k][i+1]=1e9;
mn=min(mn,dp[j][k][i]);
md[j]=min(md[j],dp[j][k][i]);
md[k]=min(md[k],dp[j][k][i]);
}
}
if (i==n)
{
printf("%d",mn);
return 0;
}
if (a[i]==b[i])
dp[3][3][i+1]=mn;
else
dp[2][3][i+1]=min(min(mn+1,md[2]),dp[2][3][i]);
bool cur=b[i]-'0';
dp[cur^1][2][i+1]=min(min(md[cur^1]+1,md[2]+1),min(dp[cur^1][2][i],mn+2));
dp[2][cur][i+1]=min(min(md[2]+1,md[cur]+1),min(dp[2][cur][i],mn+2));
dp[cur][3][i+1]=min(min(md[cur]+1,md[3]+1),min(dp[cur][3][i],mn+2));
}
}