답안 #342036

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
342036	2021-01-01T07:08:50 Z	SeDunion	Detecting Molecules (IOI16_molecules)	C++17	100 / 100	54 ms	4972 KB

molecules

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 66;

vector<int> find_subset(int l, int r, vector<int> w) {
	ll L = 0, R = 0;
	int n = (int)w.size();
	vector<pair<int,int>> a(n); for (int i = 0 ; i < n ; ++ i) a[i] = {w[i], i};
	sort(a.begin(), a.end());
	for (int i = 0 ; i < n ; ++ i) {
		L += a[i].first;
		R += a[n - i - 1].first;
		if (L <= r && R >= l) {
			int j = i;
			for ( ; L < l ; ) {
				++j;
				L -= a[j - i - 1].first;
				L += a[j].first;
			}
			vector<int> res;
			for (int q = j - i ; q <= j ; ++ q) {
				res.push_back(a[q].second);
			}
			return res;
		}
	}
	return {};
}
/*
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int n, l, u;
	cin >> n >> l >> u;
	vector<int> w(n);
	for (int &i : w) cin >> i;
	auto A = find_subset(l, u, w);
	cout << A.size() << "\n";
	for (int i : A) cout << i << " ";
}

*/

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	364 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
2	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
3	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
4	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
5	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
6	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
8	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
9	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
10	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
11	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
12	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
13	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
14	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
15	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
16	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
17	Correct	1 ms	364 KB	OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	364 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
26	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	364 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	364 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	364 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	364 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
51	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
52	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
53	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
54	Correct	1 ms	364 KB	OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	364 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
26	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	364 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	364 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	364 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	364 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
51	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
52	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
53	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
54	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
55	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
56	Correct	3 ms	512 KB	OK (n = 10000, answer = YES)
57	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
58	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
59	Correct	4 ms	492 KB	OK (n = 10000, answer = YES)
60	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
61	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
62	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
63	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
64	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
65	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
66	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
67	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
68	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
69	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
70	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
71	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
72	Correct	1 ms	364 KB	OK (n = 865, answer = YES)
73	Correct	1 ms	364 KB	OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	364 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
26	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	364 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	364 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	364 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	364 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
51	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
52	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
53	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
54	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
55	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
56	Correct	3 ms	512 KB	OK (n = 10000, answer = YES)
57	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
58	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
59	Correct	4 ms	492 KB	OK (n = 10000, answer = YES)
60	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
61	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
62	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
63	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
64	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
65	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
66	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
67	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
68	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
69	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
70	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
71	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
72	Correct	1 ms	364 KB	OK (n = 865, answer = YES)
73	Correct	1 ms	364 KB	OK (n = 820, answer = YES)
74	Correct	2 ms	492 KB	OK (n = 7500, answer = NO)
75	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
76	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
77	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
78	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
79	Correct	3 ms	620 KB	OK (n = 10000, answer = YES)
80	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
81	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
82	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
83	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
84	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
85	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
86	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
87	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
88	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
89	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
90	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
91	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
92	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
93	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	364 KB	OK (n = 1, answer = NO)
2	Correct	1 ms	364 KB	OK (n = 1, answer = NO)
3	Correct	1 ms	364 KB	OK (n = 1, answer = YES)
4	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
5	Correct	0 ms	364 KB	OK (n = 2, answer = YES)
6	Correct	1 ms	384 KB	OK (n = 3, answer = YES)
7	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
8	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
9	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
10	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
11	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
12	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
13	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
14	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
15	Correct	0 ms	364 KB	OK (n = 3, answer = YES)
16	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
17	Correct	0 ms	364 KB	OK (n = 3, answer = NO)
18	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
19	Correct	0 ms	364 KB	OK (n = 100, answer = YES)
20	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
21	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
22	Correct	1 ms	364 KB	OK (n = 12, answer = NO)
23	Correct	0 ms	364 KB	OK (n = 12, answer = NO)
24	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
25	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
26	Correct	0 ms	364 KB	OK (n = 12, answer = YES)
27	Correct	1 ms	256 KB	OK (n = 12, answer = YES)
28	Correct	1 ms	364 KB	OK (n = 6, answer = YES)
29	Correct	1 ms	364 KB	OK (n = 12, answer = YES)
30	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
31	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
32	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
33	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
34	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
35	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
36	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
37	Correct	1 ms	364 KB	OK (n = 28, answer = YES)
38	Correct	1 ms	364 KB	OK (n = 27, answer = YES)
39	Correct	1 ms	364 KB	OK (n = 90, answer = YES)
40	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
41	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
42	Correct	1 ms	364 KB	OK (n = 10, answer = YES)
43	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
44	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
45	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
46	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
47	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
48	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
49	Correct	1 ms	364 KB	OK (n = 100, answer = NO)
50	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
51	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
52	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
53	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
54	Correct	1 ms	364 KB	OK (n = 100, answer = YES)
55	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
56	Correct	3 ms	512 KB	OK (n = 10000, answer = YES)
57	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
58	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
59	Correct	4 ms	492 KB	OK (n = 10000, answer = YES)
60	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
61	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
62	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
63	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
64	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
65	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
66	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
67	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
68	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
69	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
70	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
71	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
72	Correct	1 ms	364 KB	OK (n = 865, answer = YES)
73	Correct	1 ms	364 KB	OK (n = 820, answer = YES)
74	Correct	2 ms	492 KB	OK (n = 7500, answer = NO)
75	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
76	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
77	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
78	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
79	Correct	3 ms	620 KB	OK (n = 10000, answer = YES)
80	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
81	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
82	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
83	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
84	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
85	Correct	3 ms	492 KB	OK (n = 10000, answer = NO)
86	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
87	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
88	Correct	3 ms	492 KB	OK (n = 10000, answer = YES)
89	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
90	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
91	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
92	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
93	Correct	2 ms	492 KB	OK (n = 10000, answer = YES)
94	Correct	1 ms	364 KB	OK (n = 1, answer = YES)
95	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
96	Correct	1 ms	364 KB	OK (n = 3, answer = NO)
97	Correct	1 ms	364 KB	OK (n = 3, answer = YES)
98	Correct	34 ms	3436 KB	OK (n = 150000, answer = NO)
99	Correct	52 ms	4844 KB	OK (n = 200000, answer = YES)
100	Correct	54 ms	4844 KB	OK (n = 200000, answer = NO)
101	Correct	53 ms	4972 KB	OK (n = 200000, answer = YES)
102	Correct	54 ms	4972 KB	OK (n = 200000, answer = YES)
103	Correct	51 ms	4844 KB	OK (n = 200000, answer = YES)
104	Correct	49 ms	4972 KB	OK (n = 200000, answer = YES)
105	Correct	47 ms	4204 KB	OK (n = 200000, answer = NO)
106	Correct	52 ms	4844 KB	OK (n = 200000, answer = YES)
107	Correct	51 ms	4844 KB	OK (n = 200000, answer = NO)
108	Correct	48 ms	4208 KB	OK (n = 200000, answer = NO)
109	Correct	46 ms	4204 KB	OK (n = 200000, answer = NO)
110	Correct	42 ms	4460 KB	OK (n = 200000, answer = YES)
111	Correct	36 ms	4588 KB	OK (n = 200000, answer = YES)
112	Correct	33 ms	4588 KB	OK (n = 200000, answer = YES)
113	Correct	36 ms	4716 KB	OK (n = 200000, answer = YES)
114	Correct	36 ms	4716 KB	OK (n = 200000, answer = YES)
115	Correct	36 ms	4716 KB	OK (n = 200000, answer = YES)
116	Correct	41 ms	4460 KB	OK (n = 200000, answer = YES)
117	Correct	42 ms	4460 KB	OK (n = 200000, answer = YES)

답안 #342036

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 10.0 / 10.0

Subtask #3 12.0 / 12.0

Subtask #4 15.0 / 15.0

Subtask #5 23.0 / 23.0

Subtask #6 31.0 / 31.0

Subtask #1
9.0 / 9.0

Subtask #2
10.0 / 10.0

Subtask #3
12.0 / 12.0

Subtask #4
15.0 / 15.0

Subtask #5
23.0 / 23.0

Subtask #6
31.0 / 31.0