답안 #869575

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
869575	2023-11-04T20:14:54 Z	NK_	Lamps (JOI19_lamps)	C++17	100 / 100	115 ms	75176 KB

lamp

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
#define pb push_back
#define pf push_front
 
#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using pi = pair<int, int>;
using vi = V<int>;
using vpi = V<pi>;
 
using ll = long long;
using pl = pair<ll, ll>;
using vpl = V<pl>;
using vl = V<ll>;
 
using db = long double;
using str = string;
 
template<class T> using pq = priority_queue<T, V<T>, greater<T>>;
 
const int MOD = 1e9 + 7;
const ll INFL = ll(1e17);
const int LG = 19;

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int N; cin >> N;
	str S; cin >> S;
	str T; cin >> T;

	V<vi> dp(N+1, vi(8, MOD)); // [flip][set 0][set 1]

	dp[0][0] = 0;
	for(int i = 0; i < N; i++) for(int x = 0; x < 8; x++) if (dp[i][x] != MOD) {
		if (x & (x >> 1) & 1) continue;
		// cout << i << " " << x << " " << dp[i][x] << endl;

		for(int y = 0; y < 8; y++) {
			if (y & (y >> 1) & 1) continue;
			int cost = __builtin_popcount(x ^ y);

			char c = S[i];
			if ((y >> 0) & 1) c = '1';
			if ((y >> 1) & 1) c = '0';
			if ((y >> 2) & 1) c = '0' + '1' - c;

			// cout << y << " " << c << endl;

			if (c == T[i]) dp[i+1][y] = min(dp[i][x] + cost, dp[i+1][y]);
		}
	}

	int ans = MOD;
	for(int i = 0; i < 8; i++) ans = min(ans, dp.back()[i] + __builtin_popcount(i));

	cout << ans / 2 << nl;

	exit(0-0);
}

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	456 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	456 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct

Subtask #2
41.0 / 41.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	456 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	456 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	0 ms	604 KB	Output is correct
37	Correct	0 ms	460 KB	Output is correct
38	Correct	1 ms	600 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	1 ms	604 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	0 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	1 ms	452 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	348 KB	Output is correct
50	Correct	1 ms	604 KB	Output is correct
51	Correct	1 ms	344 KB	Output is correct
52	Correct	1 ms	856 KB	Output is correct
53	Correct	0 ms	604 KB	Output is correct
54	Correct	0 ms	604 KB	Output is correct
55	Correct	1 ms	604 KB	Output is correct
56	Correct	1 ms	456 KB	Output is correct
57	Correct	1 ms	604 KB	Output is correct
58	Correct	0 ms	604 KB	Output is correct

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	92 ms	74656 KB	Output is correct
8	Correct	94 ms	74816 KB	Output is correct
9	Correct	102 ms	74876 KB	Output is correct
10	Correct	92 ms	74812 KB	Output is correct
11	Correct	91 ms	74812 KB	Output is correct
12	Correct	91 ms	74824 KB	Output is correct
13	Correct	115 ms	74684 KB	Output is correct
14	Correct	92 ms	74660 KB	Output is correct

Subtask #4
49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	456 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	456 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	0 ms	604 KB	Output is correct
37	Correct	0 ms	460 KB	Output is correct
38	Correct	1 ms	600 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	604 KB	Output is correct
41	Correct	1 ms	604 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	1 ms	604 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	0 ms	604 KB	Output is correct
46	Correct	1 ms	604 KB	Output is correct
47	Correct	1 ms	452 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	348 KB	Output is correct
50	Correct	1 ms	604 KB	Output is correct
51	Correct	1 ms	344 KB	Output is correct
52	Correct	1 ms	856 KB	Output is correct
53	Correct	0 ms	604 KB	Output is correct
54	Correct	0 ms	604 KB	Output is correct
55	Correct	1 ms	604 KB	Output is correct
56	Correct	1 ms	456 KB	Output is correct
57	Correct	1 ms	604 KB	Output is correct
58	Correct	0 ms	604 KB	Output is correct
59	Correct	0 ms	344 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	1 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	92 ms	74656 KB	Output is correct
66	Correct	94 ms	74816 KB	Output is correct
67	Correct	102 ms	74876 KB	Output is correct
68	Correct	92 ms	74812 KB	Output is correct
69	Correct	91 ms	74812 KB	Output is correct
70	Correct	91 ms	74824 KB	Output is correct
71	Correct	115 ms	74684 KB	Output is correct
72	Correct	92 ms	74660 KB	Output is correct
73	Correct	98 ms	74764 KB	Output is correct
74	Correct	91 ms	74652 KB	Output is correct
75	Correct	97 ms	74908 KB	Output is correct
76	Correct	90 ms	74620 KB	Output is correct
77	Correct	91 ms	74656 KB	Output is correct
78	Correct	97 ms	74656 KB	Output is correct
79	Correct	97 ms	75176 KB	Output is correct
80	Correct	91 ms	74824 KB	Output is correct
81	Correct	92 ms	74656 KB	Output is correct
82	Correct	94 ms	74572 KB	Output is correct
83	Correct	97 ms	74636 KB	Output is correct
84	Correct	98 ms	74812 KB	Output is correct
85	Correct	97 ms	74620 KB	Output is correct
86	Correct	97 ms	74816 KB	Output is correct
87	Correct	98 ms	74816 KB	Output is correct
88	Correct	101 ms	75036 KB	Output is correct
89	Correct	98 ms	74824 KB	Output is correct
90	Correct	98 ms	74656 KB	Output is correct
91	Correct	100 ms	74824 KB	Output is correct
92	Correct	103 ms	74652 KB	Output is correct
93	Correct	107 ms	74656 KB	Output is correct
94	Correct	104 ms	74652 KB	Output is correct
95	Correct	106 ms	74656 KB	Output is correct
96	Correct	103 ms	74980 KB	Output is correct
97	Correct	102 ms	74656 KB	Output is correct
98	Correct	106 ms	74588 KB	Output is correct
99	Correct	104 ms	74636 KB	Output is correct
100	Correct	106 ms	74912 KB	Output is correct
101	Correct	102 ms	74660 KB	Output is correct
102	Correct	104 ms	74732 KB	Output is correct

답안 #869575

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 41.0 / 41.0

Subtask #3 4.0 / 4.0

Subtask #4 49.0 / 49.0

Subtask #1
6.0 / 6.0

Subtask #2
41.0 / 41.0

Subtask #3
4.0 / 4.0

Subtask #4
49.0 / 49.0