oj.uz

Submission #941921

# Submission time Handle Problem Language Result Execution time Memory
941921 2024-03-09T17:01:04 Z maxFedorchuk Lamps (JOI19_lamps) C++17
4 / 100
 53 ms 14140 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define MIN(a, b) a = min(a, b)
 
int n, dp[1000005][3]; string A, B;
 
int main()
{
    cin >> n >> A >> B; 
    A = " " + A; B = " " + B;

    memset(dp, 0x3f, sizeof(dp)); 

    dp[0][0] = 0;
    for (int i = 1; i <= n; i++) 
        for (int j : {0, 1, 2})
        {
            bool eq = (!j and A[i] == B[i]) or (j - 1 == B[i] - '0');
            int &DP = dp[i][j];

            MIN(DP, dp[i - 1][0] + min(1,(A[i - 1] == B[i - 1]) * !eq + (j == 1 or j == 2)));
            MIN(DP, dp[i - 1][1] + (i == 1 or B[i - 1] == '0') * !eq + (j == 2));
            MIN(DP, dp[i - 1][2] + (i == 1 or B[i - 1] == '1') * !eq + (j == 1));
        }
        
    cout<<min({dp[n][0], dp[n][1], dp[n][2]})<<endl;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12120 KB Output is correct
2 Correct 2 ms 12120 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 2 ms 12120 KB Output is correct
5 Correct 2 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 2 ms 12376 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 2 ms 12124 KB Output is correct
10 Correct 2 ms 12124 KB Output is correct
11 Correct 2 ms 12140 KB Output is correct
12 Incorrect 2 ms 12124 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12120 KB Output is correct
2 Correct 2 ms 12120 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 2 ms 12120 KB Output is correct
5 Correct 2 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 2 ms 12376 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 2 ms 12124 KB Output is correct
10 Correct 2 ms 12124 KB Output is correct
11 Correct 2 ms 12140 KB Output is correct
12 Incorrect 2 ms 12124 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12124 KB Output is correct
2 Correct 2 ms 12124 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 2 ms 12124 KB Output is correct
5 Correct 2 ms 12124 KB Output is correct
6 Correct 2 ms 12376 KB Output is correct
7 Correct 45 ms 14140 KB Output is correct
8 Correct 44 ms 13980 KB Output is correct
9 Correct 45 ms 13980 KB Output is correct
10 Correct 53 ms 14048 KB Output is correct
11 Correct 45 ms 14120 KB Output is correct
12 Correct 45 ms 13984 KB Output is correct
13 Correct 45 ms 13984 KB Output is correct
14 Correct 48 ms 13992 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12120 KB Output is correct
2 Correct 2 ms 12120 KB Output is correct
3 Correct 2 ms 12124 KB Output is correct
4 Correct 2 ms 12120 KB Output is correct
5 Correct 2 ms 12124 KB Output is correct
6 Correct 3 ms 12124 KB Output is correct
7 Correct 2 ms 12376 KB Output is correct
8 Correct 3 ms 12124 KB Output is correct
9 Correct 2 ms 12124 KB Output is correct
10 Correct 2 ms 12124 KB Output is correct
11 Correct 2 ms 12140 KB Output is correct
12 Incorrect 2 ms 12124 KB Output isn't correct
13 Halted 0 ms 0 KB -