oj.uz

답안 #352306

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
352306 2021-01-20T14:57:49 Z David_M Detecting Molecules (IOI16_molecules) C++14
100 / 100
 58 ms 7404 KB 
#include "molecules.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ll long long
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
	int n=w.size(), x=0;
	ll ans=0;
	pair<ll, int> p[n];
	bool f[n];
	memset(f, 0, sizeof(f));
	for (int i=0; i<n; i++)p[i]={w[i], i};
	sort(p, p+n);
	
	while(x<n&&ans+p[x].F<l)f[x]^=1,ans+=p[x++].F;
	if(x<n&&ans+p[x].F>=l&&ans+p[x].F<=u){
		vector<int> Ans;
		for (int j=0; j<=x; j++)Ans.pb(p[j].S);
		sort(Ans.begin(), Ans.end());
		return Ans;		
	}
//	cout<<'\n';
//	for (int i=0; i<n; i++)cout<<f[i]<<" ";
//	cout<<"\nAAAAA\n";
	for (int i=x-1; i>=0; i--){
		f[i+n-x]^=1; f[i]^=1;
		ans+=p[i+n-x].F-p[i].F;
		if(ans>=l&&ans<=u){
			vector<int> Ans;
			for (int j=0; j<n; j++)if(f[j])Ans.pb(p[j].S);
			sort(Ans.begin(), Ans.end());
			return Ans;
		}
	}
    return vector<int>(0);
}
//int main() {
//    int n, l, u;
//    assert(3 == scanf("%d %d %d", &n, &l, &u));
//    vector<int> w(n);
//    for (int i = 0; i < n; i++)
//        assert(1 == scanf("%d", &w[i]));
//    vector<int> result = find_subset(l, u, w);
//    
//    
//    printf("%d\n", (int)result.size());
//    for (int i = 0; i < (int)result.size(); i++)
//        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
//}
/*
4 15 17
6 8 8 7

4 14 15
5 5 6 6

4 10 20
15 17 16 18
*/

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 0 ms 364 KB OK (n = 1, answer = NO)
3 Correct 0 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 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 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB OK (n = 12, answer = YES)
2 Correct 0 ms 364 KB OK (n = 12, answer = YES)
3 Correct 0 ms 364 KB OK (n = 12, answer = NO)
4 Correct 1 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 1 ms 364 KB OK (n = 12, answer = YES)
8 Correct 0 ms 364 KB OK (n = 12, answer = YES)
9 Correct 0 ms 364 KB OK (n = 6, answer = YES)
10 Correct 0 ms 364 KB OK (n = 12, answer = YES)
11 Correct 0 ms 364 KB OK (n = 100, answer = NO)
12 Correct 1 ms 364 KB OK (n = 100, answer = YES)
13 Correct 0 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 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 0 ms 364 KB OK (n = 1, answer = NO)
3 Correct 0 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 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 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 384 KB OK (n = 12, answer = YES)
21 Correct 0 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 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 1 ms 364 KB OK (n = 12, answer = YES)
27 Correct 0 ms 364 KB OK (n = 12, answer = YES)
28 Correct 0 ms 364 KB OK (n = 6, answer = YES)
29 Correct 0 ms 364 KB OK (n = 12, answer = YES)
30 Correct 0 ms 364 KB OK (n = 100, answer = NO)
31 Correct 1 ms 364 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 364 KB OK (n = 28, answer = YES)
38 Correct 0 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 0 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 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 0 ms 364 KB OK (n = 1, answer = NO)
3 Correct 0 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 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 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 384 KB OK (n = 12, answer = YES)
21 Correct 0 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 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 1 ms 364 KB OK (n = 12, answer = YES)
27 Correct 0 ms 364 KB OK (n = 12, answer = YES)
28 Correct 0 ms 364 KB OK (n = 6, answer = YES)
29 Correct 0 ms 364 KB OK (n = 12, answer = YES)
30 Correct 0 ms 364 KB OK (n = 100, answer = NO)
31 Correct 1 ms 364 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 364 KB OK (n = 28, answer = YES)
38 Correct 0 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 0 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 4 ms 620 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 492 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 3 ms 620 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 3 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 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 0 ms 364 KB OK (n = 1, answer = NO)
3 Correct 0 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 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 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 384 KB OK (n = 12, answer = YES)
21 Correct 0 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 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 1 ms 364 KB OK (n = 12, answer = YES)
27 Correct 0 ms 364 KB OK (n = 12, answer = YES)
28 Correct 0 ms 364 KB OK (n = 6, answer = YES)
29 Correct 0 ms 364 KB OK (n = 12, answer = YES)
30 Correct 0 ms 364 KB OK (n = 100, answer = NO)
31 Correct 1 ms 364 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 364 KB OK (n = 28, answer = YES)
38 Correct 0 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 0 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 4 ms 620 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 492 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 3 ms 620 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 3 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 620 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
82 Correct 4 ms 492 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 620 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 620 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 3 ms 492 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 492 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 0 ms 364 KB OK (n = 1, answer = NO)
3 Correct 0 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 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 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 384 KB OK (n = 12, answer = YES)
21 Correct 0 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 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 1 ms 364 KB OK (n = 12, answer = YES)
27 Correct 0 ms 364 KB OK (n = 12, answer = YES)
28 Correct 0 ms 364 KB OK (n = 6, answer = YES)
29 Correct 0 ms 364 KB OK (n = 12, answer = YES)
30 Correct 0 ms 364 KB OK (n = 100, answer = NO)
31 Correct 1 ms 364 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 364 KB OK (n = 28, answer = YES)
38 Correct 0 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 0 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 4 ms 620 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 492 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 3 ms 620 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 3 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 620 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
82 Correct 4 ms 492 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 620 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 620 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 3 ms 492 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
94 Correct 0 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 37 ms 3968 KB OK (n = 150000, answer = NO)
99 Correct 57 ms 5228 KB OK (n = 200000, answer = YES)
100 Correct 57 ms 7404 KB OK (n = 200000, answer = NO)
101 Correct 57 ms 6892 KB OK (n = 200000, answer = YES)
102 Correct 54 ms 7276 KB OK (n = 200000, answer = YES)
103 Correct 54 ms 6764 KB OK (n = 200000, answer = YES)
104 Correct 58 ms 6636 KB OK (n = 200000, answer = YES)
105 Correct 49 ms 5996 KB OK (n = 200000, answer = NO)
106 Correct 58 ms 6764 KB OK (n = 200000, answer = YES)
107 Correct 53 ms 7404 KB OK (n = 200000, answer = NO)
108 Correct 48 ms 6124 KB OK (n = 200000, answer = NO)
109 Correct 47 ms 5996 KB OK (n = 200000, answer = NO)
110 Correct 44 ms 6252 KB OK (n = 200000, answer = YES)
111 Correct 49 ms 6380 KB OK (n = 200000, answer = YES)
112 Correct 35 ms 6252 KB OK (n = 200000, answer = YES)
113 Correct 41 ms 6508 KB OK (n = 200000, answer = YES)
114 Correct 40 ms 6508 KB OK (n = 200000, answer = YES)
115 Correct 38 ms 6508 KB OK (n = 200000, answer = YES)
116 Correct 46 ms 6252 KB OK (n = 200000, answer = YES)
117 Correct 48 ms 6252 KB OK (n = 200000, answer = YES)