oj.uz

Submission #376189

# Submission time Handle Problem Language Result Execution time Memory
376189 2021-03-11T03:45:27 Z Kevin_Zhang_TW Lamps (JOI19_lamps) C++17
51 / 100
 25 ms 21996 KB 
#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;

	if (n > 3000) return -1;

	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:53:20: warning: array subscript has type 'char' [-Wchar-subscripts]
   53 |    chmin(bst[ a[i+1] ],
      |               ~~~~~^
lamp.cpp:61:17: warning: array subscript has type 'char' [-Wchar-subscripts]
   61 |     + bst[ a[i-1] ]);
      |            ~~~~~^
lamp.cpp:78:19: warning: array subscript has type 'char' [-Wchar-subscripts]
   78 |   chmin(bst[ a[i+1] ],
      |              ~~~~~^

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory 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 384 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 364 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 364 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

# Verdict Execution time Memory 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 384 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 364 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 364 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 492 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 492 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

# Verdict Execution time Memory 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 21 ms 21868 KB Output is correct
8 Correct 21 ms 21868 KB Output is correct
9 Correct 21 ms 21868 KB Output is correct
10 Correct 21 ms 21868 KB Output is correct
11 Correct 24 ms 21868 KB Output is correct
12 Correct 25 ms 21868 KB Output is correct
13 Correct 21 ms 21868 KB Output is correct
14 Correct 20 ms 21868 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory 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 384 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 364 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 364 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 492 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 492 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 21 ms 21868 KB Output is correct
66 Correct 21 ms 21868 KB Output is correct
67 Correct 21 ms 21868 KB Output is correct
68 Correct 21 ms 21868 KB Output is correct
69 Correct 24 ms 21868 KB Output is correct
70 Correct 25 ms 21868 KB Output is correct
71 Correct 21 ms 21868 KB Output is correct
72 Correct 20 ms 21868 KB Output is correct
73 Runtime error 21 ms 21996 KB Execution failed because the return code was nonzero
74 Halted 0 ms 0 KB -