oj.uz

Submission #284309

# Submission time Handle Problem Language Result Execution time Memory
284309 2020-08-27T08:15:33 Z user202729 Detecting Molecules (IOI16_molecules) C++17
100 / 100
 62 ms 7160 KB 
// moreflags=grader.cpp
// 16
// ... isn't the site revealing too much...
// (... what's with this bug?)
#include "molecules.h"
#include<vector>
#include<algorithm>
#include<numeric>
#if not LOCAL
#define NDEBUG 1
#endif
#include<cassert>

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
	struct Item{int index, value;};
	std::vector<Item> items(w.size());
	for(int index=0; index<(int)w.size(); ++index)
		items[index]={index, w[index]};
	std::sort(begin(items), end(items),[&](Item first, Item sec){return first.value<sec.value;});

	int count;
	{
		std::vector<int64_t> tmp; tmp.reserve(items.size());
		for(auto& it: items) tmp.push_back(it.value);
		std::partial_sum(begin(tmp), end(tmp), tmp.begin());

		count=0; // maximum such that minimum sum <= u
		for(int step=1<<30; step>>=1;)
			if(count+step<=(int)tmp.size() and tmp[count+step-1]<=u)
				count+=step;

		auto const maxSum=tmp.back()-(count==(int)tmp.size()? 0: tmp.end()[-1-count]);
		if(maxSum<l)
			return {};
	}
	// so maximum sum >=l and minimum sum <=u

	std::vector<char> mark(w.size());
	int countLeft=count, countRight=0;
	int64_t total=0;
	for(int i=0; i<count; ++i){
		mark[i]=true;
		total+=items[i].value;
	}

	assert(total<=u);
	while(total<l){
		--countLeft; ++countRight;
		assert(mark[countLeft]); assert(not mark[w.size()-countRight]);
		int64_t const total1=total-items[countLeft].value+items[w.size()-countRight].value;
		if(total1>u){
			int i=countLeft;
			while(total<l){
				assert(mark[i]); assert(not mark[i+1]);
				mark[i]=false; mark[i+1]=true;
				total+=items[i+1].value-items[i].value;
				++i;
			}
			assert(total<=u);
			break;
		}else{
			total=total1;
			mark[countLeft]=false; mark[w.size()-countRight]=true;
		}
	}

	int64_t total_{};
	std::vector<int> result; result.reserve(count);
	for(int index=0; index<w.size(); ++index)
		if(mark[index]){
			result.push_back(items[index].index);
			total_+=items[index].value;
		}
	assert(total==total_);
	assert(l<=total); assert(total<=u);
	return result;
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:69:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |  for(int index=0; index<w.size(); ++index)
      |                   ~~~~~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 0 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB OK (n = 12, answer = YES)
2 Correct 0 ms 256 KB OK (n = 12, answer = YES)
3 Correct 0 ms 256 KB OK (n = 12, answer = NO)
4 Correct 0 ms 256 KB OK (n = 12, answer = NO)
5 Correct 0 ms 256 KB OK (n = 12, answer = YES)
6 Correct 0 ms 256 KB OK (n = 12, answer = YES)
7 Correct 0 ms 256 KB OK (n = 12, answer = YES)
8 Correct 0 ms 256 KB OK (n = 12, answer = YES)
9 Correct 0 ms 256 KB OK (n = 6, answer = YES)
10 Correct 0 ms 256 KB OK (n = 12, answer = YES)
11 Correct 0 ms 256 KB OK (n = 100, answer = NO)
12 Correct 0 ms 256 KB OK (n = 100, answer = YES)
13 Correct 0 ms 256 KB OK (n = 100, answer = NO)
14 Correct 0 ms 256 KB OK (n = 100, answer = YES)
15 Correct 0 ms 256 KB OK (n = 100, answer = YES)
16 Correct 0 ms 256 KB OK (n = 100, answer = YES)
17 Correct 1 ms 256 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 0 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 0 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 256 KB OK (n = 12, answer = YES)
30 Correct 0 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 256 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 0 ms 256 KB OK (n = 100, answer = YES)
36 Correct 1 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 0 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 308 KB OK (n = 10, answer = YES)
43 Correct 0 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 0 ms 256 KB OK (n = 100, answer = YES)
46 Correct 0 ms 256 KB OK (n = 100, answer = YES)
47 Correct 1 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 0 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 0 ms 256 KB OK (n = 100, answer = YES)
52 Correct 1 ms 384 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 576 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 256 KB OK (n = 865, answer = YES)
73 Correct 1 ms 256 KB OK (n = 820, answer = YES)
74 Correct 2 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 512 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 512 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 512 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 512 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 576 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
85 Correct 4 ms 640 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 576 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 256 KB OK (n = 1, answer = YES)
95 Correct 0 ms 256 KB OK (n = 3, answer = YES)
96 Correct 1 ms 256 KB OK (n = 3, answer = NO)
97 Correct 0 ms 256 KB OK (n = 3, answer = YES)
98 Correct 24 ms 4600 KB OK (n = 150000, answer = NO)
99 Correct 47 ms 6600 KB OK (n = 200000, answer = YES)
100 Correct 56 ms 7160 KB OK (n = 200000, answer = NO)
101 Correct 59 ms 6392 KB OK (n = 200000, answer = YES)
102 Correct 62 ms 7032 KB OK (n = 200000, answer = YES)
103 Correct 38 ms 6520 KB OK (n = 200000, answer = YES)
104 Correct 38 ms 6392 KB OK (n = 200000, answer = YES)
105 Correct 39 ms 5756 KB OK (n = 200000, answer = NO)
106 Correct 57 ms 6264 KB OK (n = 200000, answer = YES)
107 Correct 62 ms 7160 KB OK (n = 200000, answer = NO)
108 Correct 34 ms 5880 KB OK (n = 200000, answer = NO)
109 Correct 34 ms 5752 KB OK (n = 200000, answer = NO)
110 Correct 34 ms 6016 KB OK (n = 200000, answer = YES)
111 Correct 30 ms 6136 KB OK (n = 200000, answer = YES)
112 Correct 30 ms 6144 KB OK (n = 200000, answer = YES)
113 Correct 34 ms 6136 KB OK (n = 200000, answer = YES)
114 Correct 34 ms 6144 KB OK (n = 200000, answer = YES)
115 Correct 34 ms 6136 KB OK (n = 200000, answer = YES)
116 Correct 35 ms 6008 KB OK (n = 200000, answer = YES)
117 Correct 32 ms 6000 KB OK (n = 200000, answer = YES)