답안 #367723

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
367723	2021-02-18T06:16:35 Z	sinamhdv	Lamps (JOI19_lamps)	C++11	100 / 100	65 ms	35920 KB

lamp

// oj.uz JOI19_lamps
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1000 * 1000 * 1000;
const ll LINF = (ll)INF * INF;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define msub(a, b) ((mod + ((ll)(a) - (b)) % mod) % mod)
#define mdiv(a, b) ((ll)(a) * poww((b), mod - 2) % mod)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define endl '\n'

#define MAXN 1000100

int n;
int a[MAXN], b[MAXN];
int dp[MAXN][2][3];

int32_t main(void)
{
	fast_io;
	string sa, sb;
	cin >> n >> sa >> sb;
	
	FOR(i, 0, MAXN)
		fill(dp[i][0], dp[i][0] + 3, INF), fill(dp[i][1], dp[i][1] + 3, INF);
	FOR(i, 0, n)
	{
		a[i] = sa[i] - '0';
		b[i] = sb[i] - '0';
	}

	// dp base
	dp[0][(a[0] != b[0])][0] = (a[0] != b[0]);
	dp[0][(b[0] == 1)][1] = (int)(b[0] == 1) + 1;
	dp[0][(b[0] == 0)][2] = (int)(b[0] == 0) + 1;

	FOR(i, 1, n)
	{
		if (a[i] == b[i])
			dp[i][0][0] = min({dp[i - 1][0][0], dp[i - 1][0][1], dp[i - 1][0][2], dp[i - 1][1][0], dp[i - 1][1][1], dp[i - 1][1][2]});
		else
			dp[i][1][0] = min({dp[i - 1][1][0], dp[i - 1][1][1], dp[i - 1][1][2], dp[i - 1][0][0] + 1, dp[i - 1][0][1] + 1, dp[i - 1][0][2] + 1});
		
		if (b[i] == 0)
		{
			dp[i][0][1] = min({dp[i - 1][0][1], dp[i - 1][1][1], dp[i - 1][0][0] + 1, dp[i - 1][1][0] + 1});
			dp[i][1][2] = min({dp[i - 1][0][0] + 2, dp[i - 1][0][2] + 1, dp[i - 1][1][0] + 1, dp[i - 1][1][2]});
		}
		else
		{
			dp[i][1][1] = min({dp[i - 1][0][0] + 2, dp[i - 1][0][1] + 1, dp[i - 1][1][0] + 1, dp[i - 1][1][1]});
			dp[i][0][2] = min({dp[i - 1][0][0] + 1, dp[i - 1][1][0] + 1, dp[i - 1][0][2], dp[i - 1][1][2]});
		}
	}

	int ans = INF;
	FOR(i, 0, 2)
		FOR(j, 0, 3)
			ans = min(ans, dp[n - 1][i][j]);

	cout << ans << endl;
	return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	15 ms	23788 KB	Output is correct
2	Correct	16 ms	23916 KB	Output is correct
3	Correct	16 ms	23788 KB	Output is correct
4	Correct	18 ms	23788 KB	Output is correct
5	Correct	16 ms	23788 KB	Output is correct
6	Correct	17 ms	23788 KB	Output is correct
7	Correct	44 ms	35772 KB	Output is correct
8	Correct	43 ms	35772 KB	Output is correct
9	Correct	43 ms	35772 KB	Output is correct
10	Correct	49 ms	35772 KB	Output is correct
11	Correct	56 ms	35772 KB	Output is correct
12	Correct	46 ms	35772 KB	Output is correct
13	Correct	43 ms	35772 KB	Output is correct
14	Correct	44 ms	35772 KB	Output is correct

Subtask #4
49.0 / 49.0

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

답안 #367723

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