답안 #377126

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
377126	2021-03-13T03:18:34 Z	8e7	Lamps (JOI19_lamps)	C++14	0 / 100	1000 ms	22332 KB

lamp

//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#define ll long long
#define maxn 1000005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
string sa, sb;

int a[maxn], b[maxn], pref[maxn], diff[maxn], pdif[maxn];
int dp[maxn];

inline int seg(int l, int r) {
	if (l > r) return 0;
	return pref[r] - (l ? pref[l - 1] : 0);
}
int main() {
	io
	int n;
	cin >> n;
	cin >> sa >> sb;
	sa += '0', sb += '0';
	reverse(sa.begin(), sa.end());
	reverse(sb.begin(), sb.end());
	sa += '0', sb += '0';
	n += 2;
	for (int i = 0;i < n;i++) {
		a[i] = (sa[i] == '1') ^ (i ? (sa[i - 1] == '1') : 0);
		b[i] = (sb[i] == '1') ^ (i ? (sb[i - 1] == '1') : 0);
		diff[i] = a[i] ^ b[i];
		pref[i] = (b[i] == 1 ? 1 : 0) + (i ? pref[i - 1] : 0);
		pdif[i] = diff[i] + (i ? pdif[i - 1] : 0);
		//cout << pref[i] << " " << pdif[i] << endl;
	}
	for (int i = 0;i < n;i++) {
		dp[i] = pdif[i];
		for (int j = 0;j < i;j++) {
			if (j < i - 1) {
				int ch = (a[i] == 1 ? 1 - diff[i] : diff[i]) + a[j + 1] == 1 ? 1 - diff[j + 1] : diff[j + 1];
				dp[i] = min(dp[i], dp[j] + 2 + ch + seg(j + 2, i - 1));
			}
			dp[i] = min(dp[i], dp[j] + pdif[i] - pdif[j]);
		}
		//cout << dp[i] << " ";
	}
	//cout << endl;
	cout << (dp[n - 1] + 1) / 2 << "\n";
}

Subtask #1

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	496 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	0 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	512 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Incorrect	1 ms	364 KB	Output isn't correct
34	Halted	0 ms	0 KB	-

Subtask #2

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	496 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	0 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	512 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Incorrect	1 ms	364 KB	Output isn't correct
34	Halted	0 ms	0 KB	-

Subtask #3

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	Execution timed out	1084 ms	22332 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #4

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	496 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	0 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	512 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Incorrect	1 ms	364 KB	Output isn't correct
34	Halted	0 ms	0 KB	-