oj.uz

답안 #397271

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
397271 2021-05-01T19:19:11 Z peuch Detecting Molecules (IOI16_molecules) C++17
100 / 100
 62 ms 15264 KB 
#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> getAns(vector<pair<long long, int> > aux, int ini, int fim);

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	int n = w.size();
	
	vector<int> ret;
	vector<pair<long long, int> > aux;
	for(int i = 0; i < w.size(); i++)
		aux.push_back(make_pair(w[i], i));
	sort(aux.begin(), aux.end()); 
 	
	vector<long long> suf, pref;
	suf.push_back(aux[0].first);
	pref.push_back(aux[n - 1].first);
 	
	for(int i = 1; i < n; i++)
		suf.push_back(suf[suf.size() - 1] + aux[i].first);
 	for(int i = n - 2; i >= 0; i--)
		pref.push_back(pref[pref.size() - 1] + aux[i].first);
 	
	if(suf[n - 1] < l) return ret;
	if(suf[0] > u) return ret;
 	
 	
	if(suf[n - 1] <= u) return getAns(aux, n - 1, n);
 	
	for(int i = 0; i < n; i++){
		if(suf[i] > u) break;
		if(suf[i] >= l) return getAns(aux, i, n + 1);
		int k = lower_bound(pref.begin(), pref.end(), l - suf[i]) - pref.begin();
		if(k == pref.size()) continue;
		if(k + 1 + i + 1 > n) continue;
		if(suf[i] + pref[k] > u) continue;
		if(suf[i] + pref[k] < l) continue;
		k = n - 1 - k;
		if(k <= i) continue;
		return getAns(aux, i, k);
	}
 	
	int k = lower_bound(pref.begin(), pref.end(), l) - pref.begin();
 	
 	if(k == pref.size()) return ret;
 	if(pref[k] > u) return ret;
 	if(pref[k] < l) return ret;
 	k = n - 1 - k;
    return getAns(aux, -1, k);
}

vector<int> getAns(vector<pair<long long, int> > aux, int ini, int fim){
	vector<int> ret;
	for(int i = 0; i <= ini; i++)
		ret.push_back(aux[i].second);
	for(int i = aux.size() - 1; i >= fim; i--)
		ret.push_back(aux[i].second);
	sort(ret.begin(), ret.end());
	return ret;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:12:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |  for(int i = 0; i < w.size(); i++)
      |                 ~~^~~~~~~~~~
molecules.cpp:35:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |   if(k == pref.size()) continue;
      |      ~~^~~~~~~~~~~~~~
molecules.cpp:46:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |   if(k == pref.size()) return ret;
      |      ~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 1 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 204 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 204 KB OK (n = 100, answer = YES)
20 Correct 1 ms 204 KB OK (n = 12, answer = YES)
21 Correct 1 ms 204 KB OK (n = 12, answer = YES)
22 Correct 1 ms 204 KB OK (n = 12, answer = NO)
23 Correct 1 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 204 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 204 KB OK (n = 100, answer = YES)
41 Correct 1 ms 204 KB OK (n = 100, answer = YES)
42 Correct 1 ms 204 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 1 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 204 KB OK (n = 100, answer = YES)
55 Correct 3 ms 972 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 972 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 968 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
67 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
68 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
69 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
71 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 332 KB OK (n = 865, answer = YES)
73 Correct 1 ms 456 KB OK (n = 820, answer = YES)
74 Correct 2 ms 588 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 800 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 968 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 924 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 844 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 944 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 824 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 968 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 968 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 1008 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
92 Correct 4 ms 968 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 300 KB OK (n = 1, answer = YES)
95 Correct 1 ms 204 KB OK (n = 3, answer = YES)
96 Correct 1 ms 204 KB OK (n = 3, answer = NO)
97 Correct 1 ms 332 KB OK (n = 3, answer = YES)
98 Correct 41 ms 9044 KB OK (n = 150000, answer = NO)
99 Correct 60 ms 14764 KB OK (n = 200000, answer = YES)
100 Correct 62 ms 12308 KB OK (n = 200000, answer = NO)
101 Correct 62 ms 14676 KB OK (n = 200000, answer = YES)
102 Correct 62 ms 15264 KB OK (n = 200000, answer = YES)
103 Correct 60 ms 14876 KB OK (n = 200000, answer = YES)
104 Correct 59 ms 14612 KB OK (n = 200000, answer = YES)
105 Correct 54 ms 10876 KB OK (n = 200000, answer = NO)
106 Correct 62 ms 14484 KB OK (n = 200000, answer = YES)
107 Correct 57 ms 12332 KB OK (n = 200000, answer = NO)
108 Correct 53 ms 10896 KB OK (n = 200000, answer = NO)
109 Correct 54 ms 10900 KB OK (n = 200000, answer = NO)
110 Correct 51 ms 14296 KB OK (n = 200000, answer = YES)
111 Correct 42 ms 14472 KB OK (n = 200000, answer = YES)
112 Correct 42 ms 14308 KB OK (n = 200000, answer = YES)
113 Correct 45 ms 14384 KB OK (n = 200000, answer = YES)
114 Correct 45 ms 14484 KB OK (n = 200000, answer = YES)
115 Correct 59 ms 14488 KB OK (n = 200000, answer = YES)
116 Correct 50 ms 14200 KB OK (n = 200000, answer = YES)
117 Correct 52 ms 14296 KB OK (n = 200000, answer = YES)