oj.uz

Submission #708827

# Submission time Handle Problem Language Result Execution time Memory
708827 2023-03-12T12:05:23 Z LittleCube Lamps (JOI19_lamps) C++14
100 / 100
 290 ms 57184 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

// dp[i][bit][ono][toggle]
// let every character works like A --on/off/none-> A' --toggle-> B
// for on and off, none spilts them and each connected size S needs (S + 1) / 2 (where every neighbor is different)
// for toggle, each connected size S also needs (S + 1) / 2 (where every neighbor is different)
// bit: last one (off: 0, on: 1, none: 2)
// ono: current on/off is odd
// toggle: current toggle is odd
int N, dp[1000006][3][2][2], A[1000006], B[1000006];

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> N;
    for (int i = 1; i <= N; i++)
    {
        char c;
        cin >> c;
        A[i] = c - '0';
    }
    for (int i = 1; i <= N; i++)
    {
        char c;
        cin >> c;
        B[i] = c - '0';
    }
    for (int i = 0; i <= N; i++)
        for (int bit = 0; bit <= 2; bit++)
            for (int ono = 0; ono <= 1; ono++)
                for (int toggle = 0; toggle <= 1; toggle++)
                    dp[i][bit][ono][toggle] = 10 * N;
    dp[0][2][1][0] = 0;
    for (int i = 0; i < N; i++)
        for (int bit = 0; bit <= 2; bit++)
            for (int ono = 0; ono <= 1; ono++)
                for (int toggle = 0; toggle <= 1; toggle++)
                {
                    for (int nb = 0; nb <= 2; nb++)
                    {
                        bool sw = (bit != nb),
                             to = (((bit == 2 ? A[i] : bit) ^ B[i]) != ((nb == 2 ? A[i + 1] : nb) ^ B[i + 1]));
                        if (nb == 2)
                        {
                            dp[i + 1][nb][1][toggle ^ to] = min(dp[i + 1][nb][1][toggle ^ to],
                                                                 dp[i][bit][ono][toggle] + (ono & sw) + (toggle & to));
                        }
                        else
                        {
                            dp[i + 1][nb][ono ^ sw][toggle ^ to] = min(dp[i + 1][nb][ono ^ sw][toggle ^ to],
                                                                       dp[i][bit][ono][toggle] + (ono & sw) + (toggle & to));
                        }
                    }
                }
    // for (int i = 1; i <= N; i++)
    //     for (int bit = 0; bit <= 2; bit++)
    //         for (int ono = 0; ono <= 1; ono++)
    //             for (int toggle = 0; toggle <= 1; toggle++)
    //                 cout << i << ' ' << bit << ' ' << ono << ' ' << toggle << "  " << dp[i][bit][ono][toggle] << '\n';

    int ans = 10 * N;
    for (int bit = 0; bit <= 2; bit++)
        for (int ono = 0; ono <= 1; ono++)
            for (int toggle = 0; toggle <= 1; toggle++)
                ans = min(ans, dp[N][bit][ono][toggle] + (ono & (bit <= 1)) + toggle);
    cout << ans << '\n';
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 275 ms 57056 KB Output is correct
8 Correct 276 ms 57164 KB Output is correct
9 Correct 276 ms 57116 KB Output is correct
10 Correct 271 ms 57144 KB Output is correct
11 Correct 279 ms 57056 KB Output is correct
12 Correct 279 ms 57056 KB Output is correct
13 Correct 279 ms 57036 KB Output is correct
14 Correct 273 ms 57052 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 220 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 328 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 328 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 452 KB Output is correct
38 Correct 1 ms 456 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 456 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 460 KB Output is correct
47 Correct 1 ms 452 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 452 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 448 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 324 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 328 KB Output is correct
65 Correct 275 ms 57056 KB Output is correct
66 Correct 276 ms 57164 KB Output is correct
67 Correct 276 ms 57116 KB Output is correct
68 Correct 271 ms 57144 KB Output is correct
69 Correct 279 ms 57056 KB Output is correct
70 Correct 279 ms 57056 KB Output is correct
71 Correct 279 ms 57036 KB Output is correct
72 Correct 273 ms 57052 KB Output is correct
73 Correct 278 ms 57036 KB Output is correct
74 Correct 285 ms 57036 KB Output is correct
75 Correct 272 ms 56972 KB Output is correct
76 Correct 276 ms 57052 KB Output is correct
77 Correct 274 ms 57184 KB Output is correct
78 Correct 277 ms 57036 KB Output is correct
79 Correct 275 ms 56996 KB Output is correct
80 Correct 282 ms 57052 KB Output is correct
81 Correct 283 ms 57056 KB Output is correct
82 Correct 279 ms 57064 KB Output is correct
83 Correct 277 ms 57144 KB Output is correct
84 Correct 270 ms 57036 KB Output is correct
85 Correct 280 ms 57060 KB Output is correct
86 Correct 274 ms 57016 KB Output is correct
87 Correct 290 ms 57048 KB Output is correct
88 Correct 277 ms 57036 KB Output is correct
89 Correct 279 ms 57140 KB Output is correct
90 Correct 276 ms 57148 KB Output is correct
91 Correct 272 ms 57052 KB Output is correct
92 Correct 279 ms 57060 KB Output is correct
93 Correct 275 ms 57056 KB Output is correct
94 Correct 279 ms 57164 KB Output is correct
95 Correct 274 ms 57128 KB Output is correct
96 Correct 273 ms 57056 KB Output is correct
97 Correct 272 ms 57056 KB Output is correct
98 Correct 278 ms 57036 KB Output is correct
99 Correct 275 ms 57052 KB Output is correct
100 Correct 273 ms 57164 KB Output is correct
101 Correct 277 ms 57032 KB Output is correct
102 Correct 281 ms 57060 KB Output is correct