oj.uz

Submission #430618

# Submission time Handle Problem Language Result Execution time Memory
430618 2021-06-16T17:22:45 Z Return_0 Lamps (JOI19_lamps) C++17
100 / 100
 67 ms 27936 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 1e6 + 7;

ll dp [N][3][2], n, ans = N;
string s, t;

#define smin(x, y) x = min(x, y)

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	cin>> n >> s >> t;
	
	memset(dp, 63, sizeof dp);
	dp[0][0][0] = 0;

	for (ll i = 0; i < n; i++) for (ll j = 0; j < 3; j++) {
		smin(dp[i][j][0], dp[i][j][1]); // end
		smin(dp[i][j][1], dp[i][j][0] + 1); // start xor ing

		for (ll k = 0; k < 2; k++) {
			ll a = s[i] - '0', b = (t[i] - '0') ^ k;

			if (a == b) smin(dp[i + 1][0][k], dp[i][j][k]); // end

			smin(dp[i + 1][b + 1][k], dp[i][j][k] + 1); // start

			if (j == b + 1 || (!j && a == b)) smin(dp[i + 1][j][k], dp[i][j][k]); // continue
		}
	}

	for (ll i = 0; i < 3; i++) for (ll j = 0; j < 2; j++) ans = min(ans, dp[n][i][j]);

	kill(ans);

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
8
11011100
01101001

13
1010010010100
0000111001011

18
001100010010000110
110110001000100101

*/

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23796 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 11 ms 23756 KB Output is correct
4 Correct 11 ms 23740 KB Output is correct
5 Correct 12 ms 23796 KB Output is correct
6 Correct 13 ms 23756 KB Output is correct
7 Correct 11 ms 23756 KB Output is correct
8 Correct 11 ms 23752 KB Output is correct
9 Correct 13 ms 23756 KB Output is correct
10 Correct 14 ms 23784 KB Output is correct
11 Correct 11 ms 23756 KB Output is correct
12 Correct 14 ms 23756 KB Output is correct
13 Correct 11 ms 23756 KB Output is correct
14 Correct 11 ms 23756 KB Output is correct
15 Correct 11 ms 23756 KB Output is correct
16 Correct 11 ms 23756 KB Output is correct
17 Correct 11 ms 23756 KB Output is correct
18 Correct 11 ms 23756 KB Output is correct
19 Correct 12 ms 23756 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 11 ms 23756 KB Output is correct
22 Correct 11 ms 23756 KB Output is correct
23 Correct 11 ms 23712 KB Output is correct
24 Correct 11 ms 23756 KB Output is correct
25 Correct 11 ms 23744 KB Output is correct
26 Correct 11 ms 23756 KB Output is correct
27 Correct 13 ms 23736 KB Output is correct
28 Correct 13 ms 23756 KB Output is correct
29 Correct 11 ms 23756 KB Output is correct
30 Correct 13 ms 23756 KB Output is correct
31 Correct 11 ms 23700 KB Output is correct
32 Correct 11 ms 23772 KB Output is correct
33 Correct 12 ms 23756 KB Output is correct
34 Correct 11 ms 23756 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23796 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 11 ms 23756 KB Output is correct
4 Correct 11 ms 23740 KB Output is correct
5 Correct 12 ms 23796 KB Output is correct
6 Correct 13 ms 23756 KB Output is correct
7 Correct 11 ms 23756 KB Output is correct
8 Correct 11 ms 23752 KB Output is correct
9 Correct 13 ms 23756 KB Output is correct
10 Correct 14 ms 23784 KB Output is correct
11 Correct 11 ms 23756 KB Output is correct
12 Correct 14 ms 23756 KB Output is correct
13 Correct 11 ms 23756 KB Output is correct
14 Correct 11 ms 23756 KB Output is correct
15 Correct 11 ms 23756 KB Output is correct
16 Correct 11 ms 23756 KB Output is correct
17 Correct 11 ms 23756 KB Output is correct
18 Correct 11 ms 23756 KB Output is correct
19 Correct 12 ms 23756 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 11 ms 23756 KB Output is correct
22 Correct 11 ms 23756 KB Output is correct
23 Correct 11 ms 23712 KB Output is correct
24 Correct 11 ms 23756 KB Output is correct
25 Correct 11 ms 23744 KB Output is correct
26 Correct 11 ms 23756 KB Output is correct
27 Correct 13 ms 23736 KB Output is correct
28 Correct 13 ms 23756 KB Output is correct
29 Correct 11 ms 23756 KB Output is correct
30 Correct 13 ms 23756 KB Output is correct
31 Correct 11 ms 23700 KB Output is correct
32 Correct 11 ms 23772 KB Output is correct
33 Correct 12 ms 23756 KB Output is correct
34 Correct 11 ms 23756 KB Output is correct
35 Correct 11 ms 23756 KB Output is correct
36 Correct 11 ms 23700 KB Output is correct
37 Correct 11 ms 23760 KB Output is correct
38 Correct 12 ms 23736 KB Output is correct
39 Correct 11 ms 23756 KB Output is correct
40 Correct 12 ms 23756 KB Output is correct
41 Correct 12 ms 23808 KB Output is correct
42 Correct 12 ms 23772 KB Output is correct
43 Correct 12 ms 23748 KB Output is correct
44 Correct 12 ms 23784 KB Output is correct
45 Correct 12 ms 23696 KB Output is correct
46 Correct 11 ms 23756 KB Output is correct
47 Correct 12 ms 23756 KB Output is correct
48 Correct 11 ms 23772 KB Output is correct
49 Correct 11 ms 23768 KB Output is correct
50 Correct 11 ms 23756 KB Output is correct
51 Correct 11 ms 23756 KB Output is correct
52 Correct 11 ms 23816 KB Output is correct
53 Correct 11 ms 23756 KB Output is correct
54 Correct 12 ms 23752 KB Output is correct
55 Correct 11 ms 23756 KB Output is correct
56 Correct 12 ms 23776 KB Output is correct
57 Correct 12 ms 23756 KB Output is correct
58 Correct 11 ms 23756 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23772 KB Output is correct
2 Correct 11 ms 23756 KB Output is correct
3 Correct 13 ms 23756 KB Output is correct
4 Correct 12 ms 23756 KB Output is correct
5 Correct 12 ms 23720 KB Output is correct
6 Correct 11 ms 23748 KB Output is correct
7 Correct 56 ms 27848 KB Output is correct
8 Correct 56 ms 27740 KB Output is correct
9 Correct 50 ms 27736 KB Output is correct
10 Correct 53 ms 27844 KB Output is correct
11 Correct 51 ms 27848 KB Output is correct
12 Correct 51 ms 27808 KB Output is correct
13 Correct 58 ms 27836 KB Output is correct
14 Correct 54 ms 27848 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23796 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 11 ms 23756 KB Output is correct
4 Correct 11 ms 23740 KB Output is correct
5 Correct 12 ms 23796 KB Output is correct
6 Correct 13 ms 23756 KB Output is correct
7 Correct 11 ms 23756 KB Output is correct
8 Correct 11 ms 23752 KB Output is correct
9 Correct 13 ms 23756 KB Output is correct
10 Correct 14 ms 23784 KB Output is correct
11 Correct 11 ms 23756 KB Output is correct
12 Correct 14 ms 23756 KB Output is correct
13 Correct 11 ms 23756 KB Output is correct
14 Correct 11 ms 23756 KB Output is correct
15 Correct 11 ms 23756 KB Output is correct
16 Correct 11 ms 23756 KB Output is correct
17 Correct 11 ms 23756 KB Output is correct
18 Correct 11 ms 23756 KB Output is correct
19 Correct 12 ms 23756 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 11 ms 23756 KB Output is correct
22 Correct 11 ms 23756 KB Output is correct
23 Correct 11 ms 23712 KB Output is correct
24 Correct 11 ms 23756 KB Output is correct
25 Correct 11 ms 23744 KB Output is correct
26 Correct 11 ms 23756 KB Output is correct
27 Correct 13 ms 23736 KB Output is correct
28 Correct 13 ms 23756 KB Output is correct
29 Correct 11 ms 23756 KB Output is correct
30 Correct 13 ms 23756 KB Output is correct
31 Correct 11 ms 23700 KB Output is correct
32 Correct 11 ms 23772 KB Output is correct
33 Correct 12 ms 23756 KB Output is correct
34 Correct 11 ms 23756 KB Output is correct
35 Correct 11 ms 23756 KB Output is correct
36 Correct 11 ms 23700 KB Output is correct
37 Correct 11 ms 23760 KB Output is correct
38 Correct 12 ms 23736 KB Output is correct
39 Correct 11 ms 23756 KB Output is correct
40 Correct 12 ms 23756 KB Output is correct
41 Correct 12 ms 23808 KB Output is correct
42 Correct 12 ms 23772 KB Output is correct
43 Correct 12 ms 23748 KB Output is correct
44 Correct 12 ms 23784 KB Output is correct
45 Correct 12 ms 23696 KB Output is correct
46 Correct 11 ms 23756 KB Output is correct
47 Correct 12 ms 23756 KB Output is correct
48 Correct 11 ms 23772 KB Output is correct
49 Correct 11 ms 23768 KB Output is correct
50 Correct 11 ms 23756 KB Output is correct
51 Correct 11 ms 23756 KB Output is correct
52 Correct 11 ms 23816 KB Output is correct
53 Correct 11 ms 23756 KB Output is correct
54 Correct 12 ms 23752 KB Output is correct
55 Correct 11 ms 23756 KB Output is correct
56 Correct 12 ms 23776 KB Output is correct
57 Correct 12 ms 23756 KB Output is correct
58 Correct 11 ms 23756 KB Output is correct
59 Correct 11 ms 23772 KB Output is correct
60 Correct 11 ms 23756 KB Output is correct
61 Correct 13 ms 23756 KB Output is correct
62 Correct 12 ms 23756 KB Output is correct
63 Correct 12 ms 23720 KB Output is correct
64 Correct 11 ms 23748 KB Output is correct
65 Correct 56 ms 27848 KB Output is correct
66 Correct 56 ms 27740 KB Output is correct
67 Correct 50 ms 27736 KB Output is correct
68 Correct 53 ms 27844 KB Output is correct
69 Correct 51 ms 27848 KB Output is correct
70 Correct 51 ms 27808 KB Output is correct
71 Correct 58 ms 27836 KB Output is correct
72 Correct 54 ms 27848 KB Output is correct
73 Correct 52 ms 27804 KB Output is correct
74 Correct 53 ms 27860 KB Output is correct
75 Correct 56 ms 27852 KB Output is correct
76 Correct 60 ms 27796 KB Output is correct
77 Correct 51 ms 27804 KB Output is correct
78 Correct 55 ms 27748 KB Output is correct
79 Correct 52 ms 27860 KB Output is correct
80 Correct 56 ms 27848 KB Output is correct
81 Correct 50 ms 27776 KB Output is correct
82 Correct 51 ms 27848 KB Output is correct
83 Correct 60 ms 27856 KB Output is correct
84 Correct 54 ms 27800 KB Output is correct
85 Correct 53 ms 27932 KB Output is correct
86 Correct 62 ms 27784 KB Output is correct
87 Correct 66 ms 27852 KB Output is correct
88 Correct 56 ms 27848 KB Output is correct
89 Correct 53 ms 27844 KB Output is correct
90 Correct 56 ms 27844 KB Output is correct
91 Correct 59 ms 27856 KB Output is correct
92 Correct 58 ms 27844 KB Output is correct
93 Correct 57 ms 27744 KB Output is correct
94 Correct 67 ms 27808 KB Output is correct
95 Correct 57 ms 27820 KB Output is correct
96 Correct 58 ms 27804 KB Output is correct
97 Correct 56 ms 27828 KB Output is correct
98 Correct 57 ms 27760 KB Output is correct
99 Correct 56 ms 27808 KB Output is correct
100 Correct 64 ms 27824 KB Output is correct
101 Correct 63 ms 27936 KB Output is correct
102 Correct 60 ms 27844 KB Output is correct