oj.uz

Submission #797843

# Submission time Handle Problem Language Result Execution time Memory
797843 2023-07-30T01:37:49 Z PurpleCrayon Lamps (JOI19_lamps) C++17
100 / 100
 102 ms 4416 KB 
#include <bits/stdc++.h>
using namespace std;

#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 6e1+10, MOD = 1e9+7;
const ll INF = 1e18+10;

// 0 = empty
// 1 = {0}
// 2 = {1}
// 3 = {0, 1}
// 4 = {1, 0}

pair<int, int> trans(int prv, int nxt, int state) {
    if (prv == nxt) {
        if (nxt == 0) {
            if (state == 0) return {0, state};
            else if (state == 1) return {0, state};
            else if (state == 2) return {0, 0};
            else if (state == 3) return {0, 1};
            else if (state == 4) return {0, state};
        } else {
            if (state == 0) return {0, state};
            else if (state == 1) return {0, 0};
            else if (state == 2) return {0, state};
            else if (state == 3) return {0, state};
            else if (state == 4) return {0, 2};
        }
    }

    if (nxt == 1) { 
        if (state == 0) return {1, 2};
        else if (state == 1) return {1, 3};
        else if (state == 2) return {0, state};
        else if (state == 3) return {0, state};
        else if (state == 4) return {0, 2};
    } else {
        if (state == 0) return {1, 1};
        else if (state == 1) return {0, state};
        else if (state == 2) return {1, 4};
        else if (state == 3) return {0, 1};
        else if (state == 4) return {0, state};
    }

    assert(false);
}

int prv[5][2], cur[5][2];
void solve() {
    int n; cin >> n;
    string s, t; cin >> s >> t;

    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 2; j++) {
            prv[i][j] = cur[i][j] = MOD;
        }
    }

    prv[0][0] = 0;
    for (int i = 0; i < n; i++) {
        int x = s[i] - '0', y = t[i] - '0';
        for (int prv_state = 0; prv_state < 5; prv_state++) {
            for (int prv_flip = 0; prv_flip < 2; prv_flip++) {
                for (int me = 0; me < 2; me++) {
                    int flip = me ^ y;
                    auto [cost, nxt_state] = trans(x, me, prv_state);
                    cost += flip && !prv_flip;

                    cur[nxt_state][flip] = min(cur[nxt_state][flip], prv[prv_state][prv_flip] + cost);
                }
            }
        }

        for (int j = 0; j < 5; j++) {
            for (int k = 0; k < 2; k++) {
                prv[j][k] = cur[j][k], cur[j][k] = MOD;
            }
        }
    }

    int ans = MOD;
    for (int i = 0; i < 5; i++)
        for (int j = 0; j < 2; j++)
            ans = min(ans, prv[i][j]);

    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) solve();
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 0 ms 316 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 316 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 0 ms 316 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 316 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 320 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 84 ms 4392 KB Output is correct
8 Correct 87 ms 4380 KB Output is correct
9 Correct 88 ms 4392 KB Output is correct
10 Correct 90 ms 4388 KB Output is correct
11 Correct 89 ms 4372 KB Output is correct
12 Correct 91 ms 4364 KB Output is correct
13 Correct 89 ms 4336 KB Output is correct
14 Correct 91 ms 4364 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 0 ms 316 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 316 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 320 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 84 ms 4392 KB Output is correct
66 Correct 87 ms 4380 KB Output is correct
67 Correct 88 ms 4392 KB Output is correct
68 Correct 90 ms 4388 KB Output is correct
69 Correct 89 ms 4372 KB Output is correct
70 Correct 91 ms 4364 KB Output is correct
71 Correct 89 ms 4336 KB Output is correct
72 Correct 91 ms 4364 KB Output is correct
73 Correct 94 ms 4388 KB Output is correct
74 Correct 88 ms 4388 KB Output is correct
75 Correct 92 ms 4388 KB Output is correct
76 Correct 93 ms 4388 KB Output is correct
77 Correct 76 ms 4388 KB Output is correct
78 Correct 81 ms 4388 KB Output is correct
79 Correct 89 ms 4336 KB Output is correct
80 Correct 95 ms 4396 KB Output is correct
81 Correct 74 ms 4364 KB Output is correct
82 Correct 77 ms 4332 KB Output is correct
83 Correct 92 ms 4392 KB Output is correct
84 Correct 95 ms 4336 KB Output is correct
85 Correct 93 ms 4384 KB Output is correct
86 Correct 95 ms 4392 KB Output is correct
87 Correct 92 ms 4364 KB Output is correct
88 Correct 95 ms 4388 KB Output is correct
89 Correct 93 ms 4380 KB Output is correct
90 Correct 93 ms 4384 KB Output is correct
91 Correct 102 ms 4400 KB Output is correct
92 Correct 102 ms 4396 KB Output is correct
93 Correct 98 ms 4400 KB Output is correct
94 Correct 98 ms 4388 KB Output is correct
95 Correct 98 ms 4360 KB Output is correct
96 Correct 96 ms 4384 KB Output is correct
97 Correct 94 ms 4388 KB Output is correct
98 Correct 96 ms 4384 KB Output is correct
99 Correct 92 ms 4372 KB Output is correct
100 Correct 96 ms 4392 KB Output is correct
101 Correct 95 ms 4408 KB Output is correct
102 Correct 94 ms 4416 KB Output is correct