답안 #376190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
376190	2021-03-11T03:45:46 Z	Kevin_Zhang_TW	Lamps (JOI19_lamps)	C++17	100 / 100	43 ms	27904 KB

lamp

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 1000010, inf = 1e9;

int n;
char a[MAX_N], b[MAX_N];
int va[MAX_N], vb[MAX_N], pfa[MAX_N], pfb[MAX_N], dp[MAX_N], dif[MAX_N];

int bst[2], good;

int32_t main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n >> a+1 >> b+1;
	for (int i = 1;i <= n;++i) a[i] -= '0', b[i] -= '0';
	++n;
	for (int i = n;i >= 1;--i) {
		va[i] = a[i] ^ a[i-1];
		vb[i] = b[i] ^ b[i-1];
	}

	for (int i = 1;i <= n;++i) {
		pfa[i] = pfa[i-1] + va[i];
		pfb[i] = pfb[i-1] + vb[i];
		dif[i] = dif[i-1] + (va[i] != vb[i]);
	}

	if (accumulate(va, va+n+1, 0) == 0)
		return cout << accumulate(vb, vb + n + 1, 0) / 2 << '\n', 0;

	bst[0] = bst[1] = good = inf;

	for (int i = 0;i <= n;++i) {

		if (i == 0) {
			chmin(good, dp[i] - dif[i]);

			chmin(bst[ a[i+1] ],
					dp[i] + 2 + (va[i+1]==vb[i+1]) - pfb[i+1]);
			continue;
		}

		dp[i] = dif[i] + 1;

		chmin(dp[i], (va[i]==vb[i]) + pfb[i-1] 
				+ bst[ a[i-1] ]);

//		for (int j = 0;j < i;++j) {
//			if ( a[i-1] == a[j+1] ) {
//				// dp[j] + 2 + (va[j+1] == vb[j+1])  - pfb[j+1] + (va[i]==vb[i]) + pfb[i-1]
//				chmin(dp[i], 
//				 dp[j] + 2 + (va[j+1] == vb[j+1])  - pfb[j+1] + 
//				 (va[i]==vb[i]) + pfb[i-1]);
////				chmin(dp[i], dp[j] + 2 +
////						(va[i]==vb[i]) + (va[j+1]==vb[j+1]) + (pfb[i-1] - pfb[j+1]));
//			}
//		}

		chmin(dp[i], dif[i] + good);

		chmin(good, dp[i] - dif[i]);

		chmin(bst[ a[i+1] ],
				dp[i] + 2 + (va[i+1]==vb[i+1]) - pfb[i+1]);

	}

	cout << dp[n] / 2 << '\n';
}

Compilation message

lamp.cpp: In function 'int32_t main()':
lamp.cpp:27:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |  cin >> n >> a+1 >> b+1;
      |              ~^~
lamp.cpp:27:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   27 |  cin >> n >> a+1 >> b+1;
      |                     ~^~
lamp.cpp:51:20: warning: array subscript has type 'char' [-Wchar-subscripts]
   51 |    chmin(bst[ a[i+1] ],
      |               ~~~~~^
lamp.cpp:59:17: warning: array subscript has type 'char' [-Wchar-subscripts]
   59 |     + bst[ a[i-1] ]);
      |            ~~~~~^
lamp.cpp:76:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   76 |   chmin(bst[ a[i+1] ],
      |              ~~~~~^

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	22 ms	21868 KB	Output is correct
8	Correct	23 ms	21868 KB	Output is correct
9	Correct	22 ms	21868 KB	Output is correct
10	Correct	23 ms	21868 KB	Output is correct
11	Correct	21 ms	21996 KB	Output is correct
12	Correct	22 ms	21868 KB	Output is correct
13	Correct	23 ms	21868 KB	Output is correct
14	Correct	22 ms	21868 KB	Output is correct

Subtask #4
49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	368 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	512 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	492 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	1 ms	492 KB	Output is correct
39	Correct	1 ms	492 KB	Output is correct
40	Correct	1 ms	492 KB	Output is correct
41	Correct	1 ms	492 KB	Output is correct
42	Correct	1 ms	640 KB	Output is correct
43	Correct	1 ms	492 KB	Output is correct
44	Correct	1 ms	492 KB	Output is correct
45	Correct	1 ms	492 KB	Output is correct
46	Correct	1 ms	492 KB	Output is correct
47	Correct	1 ms	620 KB	Output is correct
48	Correct	1 ms	492 KB	Output is correct
49	Correct	1 ms	492 KB	Output is correct
50	Correct	1 ms	492 KB	Output is correct
51	Correct	1 ms	492 KB	Output is correct
52	Correct	1 ms	492 KB	Output is correct
53	Correct	1 ms	492 KB	Output is correct
54	Correct	1 ms	492 KB	Output is correct
55	Correct	1 ms	492 KB	Output is correct
56	Correct	1 ms	492 KB	Output is correct
57	Correct	1 ms	492 KB	Output is correct
58	Correct	1 ms	492 KB	Output is correct
59	Correct	1 ms	364 KB	Output is correct
60	Correct	1 ms	364 KB	Output is correct
61	Correct	1 ms	364 KB	Output is correct
62	Correct	1 ms	364 KB	Output is correct
63	Correct	1 ms	364 KB	Output is correct
64	Correct	1 ms	364 KB	Output is correct
65	Correct	22 ms	21868 KB	Output is correct
66	Correct	23 ms	21868 KB	Output is correct
67	Correct	22 ms	21868 KB	Output is correct
68	Correct	23 ms	21868 KB	Output is correct
69	Correct	21 ms	21996 KB	Output is correct
70	Correct	22 ms	21868 KB	Output is correct
71	Correct	23 ms	21868 KB	Output is correct
72	Correct	22 ms	21868 KB	Output is correct
73	Correct	28 ms	25836 KB	Output is correct
74	Correct	29 ms	27756 KB	Output is correct
75	Correct	32 ms	27756 KB	Output is correct
76	Correct	29 ms	27756 KB	Output is correct
77	Correct	28 ms	27756 KB	Output is correct
78	Correct	28 ms	27756 KB	Output is correct
79	Correct	29 ms	27756 KB	Output is correct
80	Correct	29 ms	27756 KB	Output is correct
81	Correct	28 ms	27756 KB	Output is correct
82	Correct	34 ms	27756 KB	Output is correct
83	Correct	43 ms	27756 KB	Output is correct
84	Correct	36 ms	27904 KB	Output is correct
85	Correct	35 ms	27756 KB	Output is correct
86	Correct	34 ms	27756 KB	Output is correct
87	Correct	42 ms	27756 KB	Output is correct
88	Correct	36 ms	27756 KB	Output is correct
89	Correct	35 ms	27756 KB	Output is correct
90	Correct	34 ms	27756 KB	Output is correct
91	Correct	35 ms	27756 KB	Output is correct
92	Correct	35 ms	27804 KB	Output is correct
93	Correct	36 ms	27756 KB	Output is correct
94	Correct	35 ms	27756 KB	Output is correct
95	Correct	37 ms	27756 KB	Output is correct
96	Correct	36 ms	27756 KB	Output is correct
97	Correct	36 ms	27756 KB	Output is correct
98	Correct	35 ms	27756 KB	Output is correct
99	Correct	35 ms	27756 KB	Output is correct
100	Correct	37 ms	27756 KB	Output is correct
101	Correct	35 ms	27756 KB	Output is correct
102	Correct	35 ms	27756 KB	Output is correct

답안 #376190

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