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;
int dp[1000005][3];
int apply(char x, int y)
{
return (y==0?'0':(y==1?'1':x));
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
string s, t;
cin >> n >> s >> t;
dp[0][0]=dp[0][1]=1e9;
for (int i=1; i<=n; i++)
{
for (int j=0; j<3; j++)
{
dp[i][j]=1e9;
for (int k=0; k<3; k++)
{
int x=0;
if (j!=k && j!=2)
x++;
if ((i==1 || apply(s[i-2], k)==t[i-2]) && apply(s[i-1], j)!=t[i-1])
x++;
dp[i][j]=min(dp[i][j], dp[i-1][k]+x);
}
}
}
cout << min(min(dp[n][0], dp[n][1]), dp[n][2]);
}
# | 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... |