oj.uz

Submission #210119

# Submission time Handle Problem Language Result Execution time Memory
210119 2020-03-16T15:05:06 Z DrumpfTheGodEmperor Lamps (JOI19_lamps) C++14
100 / 100
 123 ms 35644 KB 
#include <bits/stdc++.h>
#define bp __builtin_popcountll
#define pb push_back
#define in(s) freopen(s, "r", stdin);
#define out(s) freopen(s, "w", stdout);
#define inout(s, end1, end2) freopen((string(s) + "." + end1).c_str(), "r", stdin),\
		freopen((string(s) + "." + end2).c_str(), "w", stdout);
#define fi first
#define se second
#define bw(i, r, l) for (int i = r - 1; i >= l; i--)
#define fw(i, l, r) for (int i = l; i < r; i++)
#define fa(i, x) for (auto i: x)
using namespace std;
const int mod = 1e9 + 7, inf = 1061109567;
const long long infll = 4557430888798830399;
const int N = 1e6 + 5;
int n, dp[N][2][2][2];
string a, b;
signed main() {
	#ifdef BLU
	in("blu.inp");
	#endif
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> a >> b;
//	Strategy: Use the first 2 operations to turn the sequence into alternating 0s and 1s segments, then
//	in each segment use operation 3 to make 'em gud.
//	dp[i][2][2][2]: Lamp i, currently wot's the color, dood we pay for it, wot's the flip status.
	a = " " + a;
	b = " " + b;
	memset(dp, 63, sizeof dp);
	dp[0][0][0][0] = 0;
	dp[0][1][0][0] = 0;
	
	fw (i, 0, n) fw (j, 0, 2) fw (paid, 0, 2) fw (k, 0, 2) if (dp[i][j][paid][k] != inf) {
		int final = j ^ k;
		if (i && final != b[i] - '0') continue;
//		cout << "dp[" << i << "][" << j << "][" << paid << "][" << k << "] = " << dp[i][j][paid][k] << "\n";
		
		fw (nxtj, 0, 2) fw (nxtk, 0, 2) {
			int cost = 0, nxtPaid = 0;
			if (nxtj != j) {
				if (nxtj == a[i + 1] - '0') nxtPaid = 0, cost = 0;
				else nxtPaid = 1, cost = 1;
			} else {
				if (paid) cost = 0, nxtPaid = 1;
				else {
					if (a[i + 1] - '0' == nxtj) cost = 0, nxtPaid = 0;
					else cost = 1, nxtPaid = 1;
				}
			}
			int costk = 0;
			if (k == 0 && nxtk == 1) costk = 1;
			dp[i + 1][nxtj][nxtPaid][nxtk] = min(dp[i + 1][nxtj][nxtPaid][nxtk], dp[i][j][paid][k] + cost + costk);
		}
	}
	int ans = inf;
	fw (j, 0, 2) fw (paid, 0, 2) fw (k, 0, 2) {
		int final = j ^ k;
		if (final != b[n] - '0') continue;
//		cout << "dp[" << n << "][" << j << "][" << paid << "][" << k << "] = " << dp[n][j][paid][k] << "\n";
		ans = min(ans, dp[n][j][paid][k]);
	}
	cout << ans;
	return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 31608 KB Output is correct
2 Correct 22 ms 31608 KB Output is correct
3 Correct 23 ms 31608 KB Output is correct
4 Correct 21 ms 31608 KB Output is correct
5 Correct 22 ms 31608 KB Output is correct
6 Correct 22 ms 31608 KB Output is correct
7 Correct 84 ms 35612 KB Output is correct
8 Correct 94 ms 35616 KB Output is correct
9 Correct 85 ms 35608 KB Output is correct
10 Correct 86 ms 35584 KB Output is correct
11 Correct 85 ms 35616 KB Output is correct
12 Correct 87 ms 35616 KB Output is correct
13 Correct 85 ms 35572 KB Output is correct
14 Correct 85 ms 35608 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 31608 KB Output is correct
2 Correct 22 ms 31608 KB Output is correct
3 Correct 22 ms 31608 KB Output is correct
4 Correct 25 ms 31608 KB Output is correct
5 Correct 22 ms 31608 KB Output is correct
6 Correct 22 ms 31608 KB Output is correct
7 Correct 22 ms 31608 KB Output is correct
8 Correct 22 ms 31608 KB Output is correct
9 Correct 21 ms 31608 KB Output is correct
10 Correct 21 ms 31608 KB Output is correct
11 Correct 21 ms 31608 KB Output is correct
12 Correct 23 ms 31608 KB Output is correct
13 Correct 22 ms 31608 KB Output is correct
14 Correct 21 ms 31608 KB Output is correct
15 Correct 21 ms 31608 KB Output is correct
16 Correct 21 ms 31608 KB Output is correct
17 Correct 21 ms 31608 KB Output is correct
18 Correct 21 ms 31608 KB Output is correct
19 Correct 23 ms 31608 KB Output is correct
20 Correct 22 ms 31608 KB Output is correct
21 Correct 22 ms 31608 KB Output is correct
22 Correct 21 ms 31608 KB Output is correct
23 Correct 22 ms 31608 KB Output is correct
24 Correct 21 ms 31608 KB Output is correct
25 Correct 22 ms 31608 KB Output is correct
26 Correct 21 ms 31612 KB Output is correct
27 Correct 23 ms 31608 KB Output is correct
28 Correct 22 ms 31608 KB Output is correct
29 Correct 22 ms 31608 KB Output is correct
30 Correct 21 ms 31608 KB Output is correct
31 Correct 22 ms 31608 KB Output is correct
32 Correct 23 ms 31608 KB Output is correct
33 Correct 21 ms 31608 KB Output is correct
34 Correct 22 ms 31608 KB Output is correct
35 Correct 22 ms 31608 KB Output is correct
36 Correct 21 ms 31608 KB Output is correct
37 Correct 22 ms 31584 KB Output is correct
38 Correct 21 ms 31608 KB Output is correct
39 Correct 22 ms 31608 KB Output is correct
40 Correct 23 ms 31608 KB Output is correct
41 Correct 25 ms 31608 KB Output is correct
42 Correct 22 ms 31608 KB Output is correct
43 Correct 22 ms 31736 KB Output is correct
44 Correct 21 ms 31608 KB Output is correct
45 Correct 21 ms 31608 KB Output is correct
46 Correct 23 ms 31608 KB Output is correct
47 Correct 21 ms 31608 KB Output is correct
48 Correct 23 ms 31608 KB Output is correct
49 Correct 22 ms 31608 KB Output is correct
50 Correct 22 ms 31608 KB Output is correct
51 Correct 23 ms 31608 KB Output is correct
52 Correct 22 ms 31608 KB Output is correct
53 Correct 22 ms 31608 KB Output is correct
54 Correct 22 ms 31608 KB Output is correct
55 Correct 22 ms 31608 KB Output is correct
56 Correct 23 ms 31608 KB Output is correct
57 Correct 22 ms 31608 KB Output is correct
58 Correct 21 ms 31608 KB Output is correct
59 Correct 22 ms 31608 KB Output is correct
60 Correct 22 ms 31608 KB Output is correct
61 Correct 23 ms 31608 KB Output is correct
62 Correct 21 ms 31608 KB Output is correct
63 Correct 22 ms 31608 KB Output is correct
64 Correct 22 ms 31608 KB Output is correct
65 Correct 84 ms 35612 KB Output is correct
66 Correct 94 ms 35616 KB Output is correct
67 Correct 85 ms 35608 KB Output is correct
68 Correct 86 ms 35584 KB Output is correct
69 Correct 85 ms 35616 KB Output is correct
70 Correct 87 ms 35616 KB Output is correct
71 Correct 85 ms 35572 KB Output is correct
72 Correct 85 ms 35608 KB Output is correct
73 Correct 106 ms 35612 KB Output is correct
74 Correct 108 ms 35612 KB Output is correct
75 Correct 106 ms 35616 KB Output is correct
76 Correct 107 ms 35616 KB Output is correct
77 Correct 86 ms 35488 KB Output is correct
78 Correct 88 ms 35616 KB Output is correct
79 Correct 108 ms 35612 KB Output is correct
80 Correct 108 ms 35608 KB Output is correct
81 Correct 84 ms 35616 KB Output is correct
82 Correct 84 ms 35612 KB Output is correct
83 Correct 116 ms 35616 KB Output is correct
84 Correct 116 ms 35576 KB Output is correct
85 Correct 117 ms 35616 KB Output is correct
86 Correct 117 ms 35568 KB Output is correct
87 Correct 116 ms 35616 KB Output is correct
88 Correct 113 ms 35612 KB Output is correct
89 Correct 114 ms 35612 KB Output is correct
90 Correct 116 ms 35616 KB Output is correct
91 Correct 117 ms 35616 KB Output is correct
92 Correct 119 ms 35616 KB Output is correct
93 Correct 123 ms 35616 KB Output is correct
94 Correct 119 ms 35512 KB Output is correct
95 Correct 122 ms 35612 KB Output is correct
96 Correct 121 ms 35616 KB Output is correct
97 Correct 121 ms 35620 KB Output is correct
98 Correct 123 ms 35592 KB Output is correct
99 Correct 122 ms 35608 KB Output is correct
100 Correct 122 ms 35616 KB Output is correct
101 Correct 123 ms 35644 KB Output is correct
102 Correct 120 ms 35608 KB Output is correct