답안 #294180

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
294180	2020-09-08T16:38:34 Z	pit4h	Monochrome Points (JOI20_monochrome)	C++14	100 / 100	465 ms	3724 KB

monochrome

#include<bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#ifndef LOCAL
#define cerr if(0)cerr
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using vi = vector<int>;
int n;
void inc(int& x) {
	x =  (x+1)%(2*n);	
}
string s;
ll solve(int i) {
	ll ans = 0;
	vector<bool> intersect(2*n, 1);
	int cnt = 1;
	vector<int> matched(2*n, -1);
	matched[0] = matched[i] = 0;
	int b = 1, w = i;			
	inc(w);	
	int iter = 1;
	while(iter<n) {
		while(s[b]!=s[0]) {
			if(matched[b] != -1) {
				intersect[matched[b]] = !intersect[matched[b]];
				if(intersect[matched[b]]) {
					cnt++;
				}
				else {
					cnt--;
				}
			}
			inc(b);
		}

		while(s[w]==s[0]) {
			if(matched[w] != -1) {
				intersect[w] = !intersect[w];
				if(intersect[w]) {
					cnt++;
				}
				else {
					cnt--;
				}
			}
			inc(w);
		}
		matched[b] = matched[w] = b;
		ans += cnt;
		cnt++;
		iter++;
		inc(b); inc(w);
	}
	return ans;
}
int main() {
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n;
	cin>>s;
	ll best = 0;
	vector<int> pos;
	for(int i=1; i<2*n; ++i) {
		if(s[i] != s[0]) pos.push_back(i);
	}
	int lo = 0, hi = pos.size()-1;
	while(lo<=hi) {
		int range = (hi-lo)/3;
		ll f1 = solve(pos[lo + range]);
		ll f2 = solve(pos[hi - range]);
		best = max({best, f1, f2});
		if(f1 <= f2) {
			lo = lo + range + 1;
		}
		else {
			hi = hi - range - 1;
		}
	}
	cout<<best;
}

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	392 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
65.0 / 65.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	392 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	1 ms	512 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	384 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	3 ms	384 KB	Output is correct
35	Correct	3 ms	512 KB	Output is correct
36	Correct	3 ms	384 KB	Output is correct
37	Correct	3 ms	384 KB	Output is correct
38	Correct	2 ms	384 KB	Output is correct
39	Correct	2 ms	384 KB	Output is correct
40	Correct	2 ms	384 KB	Output is correct
41	Correct	2 ms	384 KB	Output is correct
42	Correct	3 ms	384 KB	Output is correct
43	Correct	2 ms	384 KB	Output is correct
44	Correct	2 ms	384 KB	Output is correct
45	Correct	2 ms	384 KB	Output is correct
46	Correct	2 ms	384 KB	Output is correct
47	Correct	2 ms	384 KB	Output is correct
48	Correct	2 ms	384 KB	Output is correct
49	Correct	2 ms	384 KB	Output is correct
50	Correct	2 ms	384 KB	Output is correct
51	Correct	2 ms	384 KB	Output is correct
52	Correct	2 ms	384 KB	Output is correct
53	Correct	465 ms	3724 KB	Output is correct
54	Correct	461 ms	3724 KB	Output is correct
55	Correct	439 ms	3596 KB	Output is correct
56	Correct	439 ms	3596 KB	Output is correct
57	Correct	257 ms	3596 KB	Output is correct
58	Correct	262 ms	3724 KB	Output is correct
59	Correct	252 ms	3596 KB	Output is correct
60	Correct	253 ms	3596 KB	Output is correct
61	Correct	260 ms	3596 KB	Output is correct
62	Correct	267 ms	3724 KB	Output is correct
63	Correct	298 ms	3596 KB	Output is correct
64	Correct	222 ms	3596 KB	Output is correct
65	Correct	259 ms	3468 KB	Output is correct
66	Correct	267 ms	3596 KB	Output is correct
67	Correct	269 ms	3596 KB	Output is correct
68	Correct	259 ms	3468 KB	Output is correct
69	Correct	263 ms	3724 KB	Output is correct
70	Correct	243 ms	3468 KB	Output is correct
71	Correct	199 ms	3724 KB	Output is correct
72	Correct	204 ms	3724 KB	Output is correct
73	Correct	274 ms	3716 KB	Output is correct

답안 #294180

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 21.0 / 21.0

Subtask #3 10.0 / 10.0

Subtask #4 65.0 / 65.0

Subtask #1
4.0 / 4.0

Subtask #2
21.0 / 21.0

Subtask #3
10.0 / 10.0

Subtask #4
65.0 / 65.0