# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373130 | luciocf | Lamps (JOI19_lamps) | C++14 | 2 ms | 364 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 = 2e3+10;
char a[maxn], b[maxn];
int solve[maxn][maxn][3];
int dp[maxn];
int main(void)
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf(" %c", &a[i]);
for (int i = 1; i <= n; i++)
scanf(" %c", &b[i]);
for (int l = 1; l <= n; l++)
{
solve[l][l][0] = (b[l] == '0' ? 0 : 1);
for (int r = l+1; r <= n; r++)
{
if (b[r] == '0' || b[r-1] == '1') solve[l][r][0] = solve[l][r-1][0];
else solve[l][r][0] = solve[l][r-1][0]+1;
}
solve[l][l][1] = (b[l] == '1' ? 0 : 1);
for (int r = l+1; r <= n; r++)
{
if (b[r] == '1' || b[r-1] == '0') solve[l][r][1] = solve[l][r-1][1];
else solve[l][r][1] = solve[l][r-1][1]+1;
}
solve[l][l][2] = (a[l] != b[l] ? 0 : 1);
for (int r = l+1; r <= n; r++)
{
if (a[r] != b[r] || a[r-1] == b[r-1]) solve[l][r][2] = solve[l][r-1][2];
else solve[l][r][2] = solve[l][r-1][2]+1;
}
}
for (int i = 1; i <= n; i++)
{
dp[i] = n+1;
if (a[i] == b[i]) dp[i] = min(dp[i], dp[i-1]);
for (int j = i-1; j >= 0 && a[j+1] != b[j+1]; j--)
dp[i] = min(dp[i], 1 + dp[j]);
bool zero = 0, um = 0;
for (int j = i-1; j >= 0; j--)
{
zero |= (a[j+1] == '0');
um |= (a[j+1] == '1');
dp[i] = min(dp[i], (um ? 1 : 0) + solve[j+1][i][0] + dp[j]);
dp[i] = min(dp[i], (zero ? 1 : 0) + solve[j+1][i][1] + dp[j]);
dp[i] = min(dp[i], 1 + solve[j+1][i][2] + dp[j]);
}
}
printf("%d\n", dp[n]);
}
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... |