# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105055 | antimirage | Lamps (JOI19_lamps) | C++14 | 106 ms | 67064 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 N = 1e6 + 5;
int n, dp[N][4][4];
char a[N], b[N];
main(){
memset( dp, 0x3f3f3f3f, sizeof(dp) );
cin >> n;
scanf("\n%s", a + 1);
scanf("\n%s", b + 1);
dp[0][2][0] = 0;
for (int i = 1; i <= n; i++){
for (int j = 0; j < 3; j++){
if (b[i] - 48 == j){
dp[i][j][0] = min(dp[i - 1][j][1], dp[i - 1][j][0]);
for (int l = 0; l < 3; l++){
dp[i][j][0] = min( dp[i][j][0], dp[i - 1][l][0] + 1);
dp[i][j][0] = min( dp[i][j][0], dp[i - 1][l][1] + 1);
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... |