답안 #819472

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
819472 2023-08-10T11:05:58 Z Gangsta Detecting Molecules (IOI16_molecules) C++14
100 / 100
44 ms 5692 KB
/*
ID: didarco1
LANG: C++17
TASK:
*/
// a >> b = a / pow(2,b)
// a << b = a * pow(2,b)
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define sz size()
#define ss second
#define ff first
#define N 200001
#define pii pair<int,int>

using namespace std;

//ll  _, x, n;

vector<int> find_subset(int l, int u, vector<int> w){
	vector<int> result;
	vector<pii> a;
	int n = w.sz, l1 = 0, r1 = 0;
	bool tr = 0;
	ll sum = 0;
	a.pb({0,0});
	for(int i = 0; i < n; i++) a.pb({w[i],i});
	sort(a.begin(), a.end());
//		cout << l1 << ' ' << r1 << ' ' << sum << ' ' << a[l1].ff << ' ' << a[r1].ff << '\n';
	while(l1 <= n or r1 <= n){
		if(r1 == n and sum < l) break;
		if(l1 == r1 and sum > u){
			sum -= a[l1].ff;
			l1++;
			r1++;
			sum += a[r1].ff;
			continue;
		}
		if(sum < l and r1 < n) r1++, sum += a[r1].ff;
		else if(sum > u and l1 < n){
			sum -= a[l1].ff;
			l1++;
		}
		else if(sum >= l and sum <= u){
			tr = 1;
			break;
		}
	}
	if(tr){
		if(l1 == 0) l1++;
//		cout << l1 << ' ' << r1 << '\n';
		for(int i = l1; i <= r1; i++) result.pb(a[i].ss);
		sort(result.begin(), result.end());
	}
	return result;
}

//int main(){
//	int l, u, n;
//	cin >> n >> l >> u;
//	vector <int> w;
//	w.resize(n);
//	for(int i = 0; i < n; i++){
//		cin >> w[i];
//	}
//	for(auto i : find_subset(l,u,w)) cout << i << ' ';
//}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 300 KB OK (n = 1, answer = NO)
3 Correct 0 ms 224 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 300 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 304 KB OK (n = 3, answer = NO)
17 Correct 1 ms 296 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 0 ms 212 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 12, answer = YES)
2 Correct 0 ms 212 KB OK (n = 12, answer = YES)
3 Correct 0 ms 296 KB OK (n = 12, answer = NO)
4 Correct 0 ms 212 KB OK (n = 12, answer = NO)
5 Correct 0 ms 212 KB OK (n = 12, answer = YES)
6 Correct 0 ms 212 KB OK (n = 12, answer = YES)
7 Correct 1 ms 344 KB OK (n = 12, answer = YES)
8 Correct 1 ms 212 KB OK (n = 12, answer = YES)
9 Correct 0 ms 212 KB OK (n = 6, answer = YES)
10 Correct 0 ms 212 KB OK (n = 12, answer = YES)
11 Correct 1 ms 304 KB OK (n = 100, answer = NO)
12 Correct 0 ms 212 KB OK (n = 100, answer = YES)
13 Correct 0 ms 296 KB OK (n = 100, answer = NO)
14 Correct 1 ms 212 KB OK (n = 100, answer = YES)
15 Correct 0 ms 212 KB OK (n = 100, answer = YES)
16 Correct 1 ms 212 KB OK (n = 100, answer = YES)
17 Correct 0 ms 212 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 300 KB OK (n = 1, answer = NO)
3 Correct 0 ms 224 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 300 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 304 KB OK (n = 3, answer = NO)
17 Correct 1 ms 296 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 296 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 344 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 304 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 296 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 300 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 ms 300 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 300 KB OK (n = 100, answer = NO)
48 Correct 0 ms 252 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 300 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 300 KB OK (n = 1, answer = NO)
3 Correct 0 ms 224 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 300 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 304 KB OK (n = 3, answer = NO)
17 Correct 1 ms 296 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 296 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 344 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 304 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 296 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 300 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 ms 300 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 300 KB OK (n = 100, answer = NO)
48 Correct 0 ms 252 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 300 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 564 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 568 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 224 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 300 KB OK (n = 1, answer = NO)
3 Correct 0 ms 224 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 300 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 304 KB OK (n = 3, answer = NO)
17 Correct 1 ms 296 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 296 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 344 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 304 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 296 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 300 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 ms 300 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 300 KB OK (n = 100, answer = NO)
48 Correct 0 ms 252 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 300 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 564 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 568 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 224 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
74 Correct 1 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 572 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 644 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 628 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 300 KB OK (n = 1, answer = NO)
3 Correct 0 ms 224 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 300 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 304 KB OK (n = 3, answer = NO)
17 Correct 1 ms 296 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 296 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 344 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 304 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 296 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 300 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 ms 300 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 300 KB OK (n = 100, answer = NO)
48 Correct 0 ms 252 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 300 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 564 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 568 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 224 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
74 Correct 1 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 572 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 644 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 628 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 596 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 212 KB OK (n = 1, answer = YES)
95 Correct 1 ms 212 KB OK (n = 3, answer = YES)
96 Correct 0 ms 212 KB OK (n = 3, answer = NO)
97 Correct 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 24 ms 4384 KB OK (n = 150000, answer = NO)
99 Correct 37 ms 5572 KB OK (n = 200000, answer = YES)
100 Correct 40 ms 5692 KB OK (n = 200000, answer = NO)
101 Correct 39 ms 5320 KB OK (n = 200000, answer = YES)
102 Correct 37 ms 5608 KB OK (n = 200000, answer = YES)
103 Correct 36 ms 5540 KB OK (n = 200000, answer = YES)
104 Correct 36 ms 5412 KB OK (n = 200000, answer = YES)
105 Correct 34 ms 4772 KB OK (n = 200000, answer = NO)
106 Correct 40 ms 5280 KB OK (n = 200000, answer = YES)
107 Correct 44 ms 5656 KB OK (n = 200000, answer = NO)
108 Correct 36 ms 4780 KB OK (n = 200000, answer = NO)
109 Correct 34 ms 4808 KB OK (n = 200000, answer = NO)
110 Correct 31 ms 4928 KB OK (n = 200000, answer = YES)
111 Correct 25 ms 5180 KB OK (n = 200000, answer = YES)
112 Correct 23 ms 5116 KB OK (n = 200000, answer = YES)
113 Correct 31 ms 5184 KB OK (n = 200000, answer = YES)
114 Correct 28 ms 5188 KB OK (n = 200000, answer = YES)
115 Correct 27 ms 5152 KB OK (n = 200000, answer = YES)
116 Correct 31 ms 4936 KB OK (n = 200000, answer = YES)
117 Correct 32 ms 5012 KB OK (n = 200000, answer = YES)