답안 #50756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50756 2018-06-13T07:03:34 Z Mamnoon_Siam Detecting Molecules (IOI16_molecules) C++17
100 / 100
128 ms 28576 KB
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'
typedef long long ll;

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
    return os<<"(" <<p.first<<", "<<p.second<<")"; }

typedef pair<int, int> ii;
template<typename T> using min_pq =
	priority_queue<T, vector<T>, greater<T> >;

//int dx[] = {-1, +0, +1, +0};
//int dy[] = {+0, +1, +0, -1};

vector<ll> a, idx;
ll l, r;

vector<int> get_prefix(int k) {
	vector<int> ret;
	for(int i = 0; i < k; i++) {
		ret.push_back(idx[i]);
	} return ret;
}
vector<int> get_suffix(int k) {
	vector<int> ret;
	for(int i = 0, j = a.size() - 1; i < k; i++, j--) {
		ret.push_back(idx[j]);
	} return ret;
}
vector<int> subarray(int x, int y) {
	vector<int> ret;
	for(int i = x; i <= y; i++) {
		ret.push_back(idx[i]);
	} return ret;
}

vector<int> get_whole(int k) {
	ll s = 0;
	for(int i = 0; i < k; i++)
		s += a[i];
	int lp = 0, rp = k - 1;
	while(true) {
		s -= a[lp++];
		s += a[++rp];
		if(l <= s and s <= r) {
			return subarray(lp, rp);
		}
	}
}

vector<int> find_subset(int L, int R, vector<int> w) {
	l = L, r = R;
    for(int i = 0; i < w.size(); i++) {
    	idx.push_back(i);
    	a.push_back(w[i]);
    }
    sort(all(idx), [](int x, int y){return a[x] < a[y];});
    sort(all(a));
    ll pre = 0, suf = 0;
    for(int i = 1; i <= a.size(); i++) {
    	pre += a[i - 1], suf += a[a.size() - i];
    	if(l <= pre and pre <= r) return get_prefix(i);
    	if(l <= suf and suf <= r) return get_suffix(i);
    	if(pre < l and r < suf) return get_whole(i);
    }
    return vector<int>();
}

Compilation message

molecules.cpp: In function 'int myrand(int, int)':
molecules.cpp:18:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
molecules.cpp:18:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:70:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < w.size(); i++) {
                    ~~^~~~~~~~~~
molecules.cpp:77:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 1; i <= a.size(); i++) {
                    ~~^~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 428 KB OK (n = 3, answer = YES)
9 Correct 2 ms 428 KB OK (n = 3, answer = YES)
10 Correct 2 ms 460 KB OK (n = 3, answer = YES)
11 Correct 2 ms 460 KB OK (n = 3, answer = YES)
12 Correct 2 ms 460 KB OK (n = 3, answer = YES)
13 Correct 2 ms 460 KB OK (n = 3, answer = NO)
14 Correct 2 ms 520 KB OK (n = 3, answer = YES)
15 Correct 2 ms 532 KB OK (n = 3, answer = YES)
16 Correct 2 ms 596 KB OK (n = 3, answer = NO)
17 Correct 2 ms 612 KB OK (n = 3, answer = NO)
18 Correct 2 ms 612 KB OK (n = 100, answer = NO)
19 Correct 2 ms 612 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 612 KB OK (n = 12, answer = YES)
2 Correct 2 ms 612 KB OK (n = 12, answer = YES)
3 Correct 2 ms 612 KB OK (n = 12, answer = NO)
4 Correct 2 ms 612 KB OK (n = 12, answer = NO)
5 Correct 2 ms 612 KB OK (n = 12, answer = YES)
6 Correct 2 ms 612 KB OK (n = 12, answer = YES)
7 Correct 2 ms 612 KB OK (n = 12, answer = YES)
8 Correct 2 ms 628 KB OK (n = 12, answer = YES)
9 Correct 2 ms 628 KB OK (n = 6, answer = YES)
10 Correct 2 ms 628 KB OK (n = 12, answer = YES)
11 Correct 2 ms 628 KB OK (n = 100, answer = NO)
12 Correct 2 ms 628 KB OK (n = 100, answer = YES)
13 Correct 2 ms 628 KB OK (n = 100, answer = NO)
14 Correct 2 ms 628 KB OK (n = 100, answer = YES)
15 Correct 2 ms 628 KB OK (n = 100, answer = YES)
16 Correct 2 ms 628 KB OK (n = 100, answer = YES)
17 Correct 2 ms 628 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 428 KB OK (n = 3, answer = YES)
9 Correct 2 ms 428 KB OK (n = 3, answer = YES)
10 Correct 2 ms 460 KB OK (n = 3, answer = YES)
11 Correct 2 ms 460 KB OK (n = 3, answer = YES)
12 Correct 2 ms 460 KB OK (n = 3, answer = YES)
13 Correct 2 ms 460 KB OK (n = 3, answer = NO)
14 Correct 2 ms 520 KB OK (n = 3, answer = YES)
15 Correct 2 ms 532 KB OK (n = 3, answer = YES)
16 Correct 2 ms 596 KB OK (n = 3, answer = NO)
17 Correct 2 ms 612 KB OK (n = 3, answer = NO)
18 Correct 2 ms 612 KB OK (n = 100, answer = NO)
19 Correct 2 ms 612 KB OK (n = 100, answer = YES)
20 Correct 2 ms 612 KB OK (n = 12, answer = YES)
21 Correct 2 ms 612 KB OK (n = 12, answer = YES)
22 Correct 2 ms 612 KB OK (n = 12, answer = NO)
23 Correct 2 ms 612 KB OK (n = 12, answer = NO)
24 Correct 2 ms 612 KB OK (n = 12, answer = YES)
25 Correct 2 ms 612 KB OK (n = 12, answer = YES)
26 Correct 2 ms 612 KB OK (n = 12, answer = YES)
27 Correct 2 ms 628 KB OK (n = 12, answer = YES)
28 Correct 2 ms 628 KB OK (n = 6, answer = YES)
29 Correct 2 ms 628 KB OK (n = 12, answer = YES)
30 Correct 2 ms 628 KB OK (n = 100, answer = NO)
31 Correct 2 ms 628 KB OK (n = 100, answer = YES)
32 Correct 2 ms 628 KB OK (n = 100, answer = NO)
33 Correct 2 ms 628 KB OK (n = 100, answer = YES)
34 Correct 2 ms 628 KB OK (n = 100, answer = YES)
35 Correct 2 ms 628 KB OK (n = 100, answer = YES)
36 Correct 2 ms 628 KB OK (n = 100, answer = YES)
37 Correct 2 ms 628 KB OK (n = 28, answer = YES)
38 Correct 2 ms 628 KB OK (n = 27, answer = YES)
39 Correct 2 ms 628 KB OK (n = 90, answer = YES)
40 Correct 2 ms 628 KB OK (n = 100, answer = YES)
41 Correct 2 ms 628 KB OK (n = 100, answer = YES)
42 Correct 2 ms 628 KB OK (n = 10, answer = YES)
43 Correct 2 ms 628 KB OK (n = 100, answer = YES)
44 Correct 2 ms 628 KB OK (n = 100, answer = YES)
45 Correct 2 ms 628 KB OK (n = 100, answer = YES)
46 Correct 2 ms 628 KB OK (n = 100, answer = YES)
47 Correct 2 ms 628 KB OK (n = 100, answer = NO)
48 Correct 2 ms 628 KB OK (n = 100, answer = NO)
49 Correct 2 ms 628 KB OK (n = 100, answer = NO)
50 Correct 2 ms 628 KB OK (n = 100, answer = YES)
51 Correct 2 ms 628 KB OK (n = 100, answer = YES)
52 Correct 2 ms 628 KB OK (n = 100, answer = YES)
53 Correct 2 ms 628 KB OK (n = 100, answer = YES)
54 Correct 2 ms 628 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 428 KB OK (n = 3, answer = YES)
9 Correct 2 ms 428 KB OK (n = 3, answer = YES)
10 Correct 2 ms 460 KB OK (n = 3, answer = YES)
11 Correct 2 ms 460 KB OK (n = 3, answer = YES)
12 Correct 2 ms 460 KB OK (n = 3, answer = YES)
13 Correct 2 ms 460 KB OK (n = 3, answer = NO)
14 Correct 2 ms 520 KB OK (n = 3, answer = YES)
15 Correct 2 ms 532 KB OK (n = 3, answer = YES)
16 Correct 2 ms 596 KB OK (n = 3, answer = NO)
17 Correct 2 ms 612 KB OK (n = 3, answer = NO)
18 Correct 2 ms 612 KB OK (n = 100, answer = NO)
19 Correct 2 ms 612 KB OK (n = 100, answer = YES)
20 Correct 2 ms 612 KB OK (n = 12, answer = YES)
21 Correct 2 ms 612 KB OK (n = 12, answer = YES)
22 Correct 2 ms 612 KB OK (n = 12, answer = NO)
23 Correct 2 ms 612 KB OK (n = 12, answer = NO)
24 Correct 2 ms 612 KB OK (n = 12, answer = YES)
25 Correct 2 ms 612 KB OK (n = 12, answer = YES)
26 Correct 2 ms 612 KB OK (n = 12, answer = YES)
27 Correct 2 ms 628 KB OK (n = 12, answer = YES)
28 Correct 2 ms 628 KB OK (n = 6, answer = YES)
29 Correct 2 ms 628 KB OK (n = 12, answer = YES)
30 Correct 2 ms 628 KB OK (n = 100, answer = NO)
31 Correct 2 ms 628 KB OK (n = 100, answer = YES)
32 Correct 2 ms 628 KB OK (n = 100, answer = NO)
33 Correct 2 ms 628 KB OK (n = 100, answer = YES)
34 Correct 2 ms 628 KB OK (n = 100, answer = YES)
35 Correct 2 ms 628 KB OK (n = 100, answer = YES)
36 Correct 2 ms 628 KB OK (n = 100, answer = YES)
37 Correct 2 ms 628 KB OK (n = 28, answer = YES)
38 Correct 2 ms 628 KB OK (n = 27, answer = YES)
39 Correct 2 ms 628 KB OK (n = 90, answer = YES)
40 Correct 2 ms 628 KB OK (n = 100, answer = YES)
41 Correct 2 ms 628 KB OK (n = 100, answer = YES)
42 Correct 2 ms 628 KB OK (n = 10, answer = YES)
43 Correct 2 ms 628 KB OK (n = 100, answer = YES)
44 Correct 2 ms 628 KB OK (n = 100, answer = YES)
45 Correct 2 ms 628 KB OK (n = 100, answer = YES)
46 Correct 2 ms 628 KB OK (n = 100, answer = YES)
47 Correct 2 ms 628 KB OK (n = 100, answer = NO)
48 Correct 2 ms 628 KB OK (n = 100, answer = NO)
49 Correct 2 ms 628 KB OK (n = 100, answer = NO)
50 Correct 2 ms 628 KB OK (n = 100, answer = YES)
51 Correct 2 ms 628 KB OK (n = 100, answer = YES)
52 Correct 2 ms 628 KB OK (n = 100, answer = YES)
53 Correct 2 ms 628 KB OK (n = 100, answer = YES)
54 Correct 2 ms 628 KB OK (n = 100, answer = YES)
55 Correct 5 ms 900 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 912 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 912 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 912 KB OK (n = 10000, answer = YES)
59 Correct 6 ms 912 KB OK (n = 10000, answer = YES)
60 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
61 Correct 5 ms 1020 KB OK (n = 10000, answer = NO)
62 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
63 Correct 6 ms 1020 KB OK (n = 10000, answer = NO)
64 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
66 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
67 Correct 4 ms 1020 KB OK (n = 10000, answer = YES)
68 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
69 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
70 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
71 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 1020 KB OK (n = 865, answer = YES)
73 Correct 2 ms 1020 KB OK (n = 820, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 428 KB OK (n = 3, answer = YES)
9 Correct 2 ms 428 KB OK (n = 3, answer = YES)
10 Correct 2 ms 460 KB OK (n = 3, answer = YES)
11 Correct 2 ms 460 KB OK (n = 3, answer = YES)
12 Correct 2 ms 460 KB OK (n = 3, answer = YES)
13 Correct 2 ms 460 KB OK (n = 3, answer = NO)
14 Correct 2 ms 520 KB OK (n = 3, answer = YES)
15 Correct 2 ms 532 KB OK (n = 3, answer = YES)
16 Correct 2 ms 596 KB OK (n = 3, answer = NO)
17 Correct 2 ms 612 KB OK (n = 3, answer = NO)
18 Correct 2 ms 612 KB OK (n = 100, answer = NO)
19 Correct 2 ms 612 KB OK (n = 100, answer = YES)
20 Correct 2 ms 612 KB OK (n = 12, answer = YES)
21 Correct 2 ms 612 KB OK (n = 12, answer = YES)
22 Correct 2 ms 612 KB OK (n = 12, answer = NO)
23 Correct 2 ms 612 KB OK (n = 12, answer = NO)
24 Correct 2 ms 612 KB OK (n = 12, answer = YES)
25 Correct 2 ms 612 KB OK (n = 12, answer = YES)
26 Correct 2 ms 612 KB OK (n = 12, answer = YES)
27 Correct 2 ms 628 KB OK (n = 12, answer = YES)
28 Correct 2 ms 628 KB OK (n = 6, answer = YES)
29 Correct 2 ms 628 KB OK (n = 12, answer = YES)
30 Correct 2 ms 628 KB OK (n = 100, answer = NO)
31 Correct 2 ms 628 KB OK (n = 100, answer = YES)
32 Correct 2 ms 628 KB OK (n = 100, answer = NO)
33 Correct 2 ms 628 KB OK (n = 100, answer = YES)
34 Correct 2 ms 628 KB OK (n = 100, answer = YES)
35 Correct 2 ms 628 KB OK (n = 100, answer = YES)
36 Correct 2 ms 628 KB OK (n = 100, answer = YES)
37 Correct 2 ms 628 KB OK (n = 28, answer = YES)
38 Correct 2 ms 628 KB OK (n = 27, answer = YES)
39 Correct 2 ms 628 KB OK (n = 90, answer = YES)
40 Correct 2 ms 628 KB OK (n = 100, answer = YES)
41 Correct 2 ms 628 KB OK (n = 100, answer = YES)
42 Correct 2 ms 628 KB OK (n = 10, answer = YES)
43 Correct 2 ms 628 KB OK (n = 100, answer = YES)
44 Correct 2 ms 628 KB OK (n = 100, answer = YES)
45 Correct 2 ms 628 KB OK (n = 100, answer = YES)
46 Correct 2 ms 628 KB OK (n = 100, answer = YES)
47 Correct 2 ms 628 KB OK (n = 100, answer = NO)
48 Correct 2 ms 628 KB OK (n = 100, answer = NO)
49 Correct 2 ms 628 KB OK (n = 100, answer = NO)
50 Correct 2 ms 628 KB OK (n = 100, answer = YES)
51 Correct 2 ms 628 KB OK (n = 100, answer = YES)
52 Correct 2 ms 628 KB OK (n = 100, answer = YES)
53 Correct 2 ms 628 KB OK (n = 100, answer = YES)
54 Correct 2 ms 628 KB OK (n = 100, answer = YES)
55 Correct 5 ms 900 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 912 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 912 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 912 KB OK (n = 10000, answer = YES)
59 Correct 6 ms 912 KB OK (n = 10000, answer = YES)
60 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
61 Correct 5 ms 1020 KB OK (n = 10000, answer = NO)
62 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
63 Correct 6 ms 1020 KB OK (n = 10000, answer = NO)
64 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
66 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
67 Correct 4 ms 1020 KB OK (n = 10000, answer = YES)
68 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
69 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
70 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
71 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 1020 KB OK (n = 865, answer = YES)
73 Correct 2 ms 1020 KB OK (n = 820, answer = YES)
74 Correct 4 ms 1020 KB OK (n = 7500, answer = NO)
75 Correct 5 ms 1020 KB OK (n = 10000, answer = NO)
76 Correct 6 ms 1020 KB OK (n = 10000, answer = NO)
77 Correct 5 ms 1020 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 1020 KB OK (n = 10000, answer = NO)
79 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
81 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
82 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
83 Correct 6 ms 1020 KB OK (n = 10000, answer = NO)
84 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
85 Correct 6 ms 1020 KB OK (n = 10000, answer = NO)
86 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
87 Correct 6 ms 1024 KB OK (n = 10000, answer = YES)
88 Correct 5 ms 1024 KB OK (n = 10000, answer = YES)
89 Correct 5 ms 1024 KB OK (n = 10000, answer = YES)
90 Correct 5 ms 1036 KB OK (n = 10000, answer = YES)
91 Correct 6 ms 1036 KB OK (n = 10000, answer = YES)
92 Correct 5 ms 1036 KB OK (n = 10000, answer = YES)
93 Correct 5 ms 1036 KB OK (n = 10000, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 376 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 376 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 428 KB OK (n = 3, answer = YES)
9 Correct 2 ms 428 KB OK (n = 3, answer = YES)
10 Correct 2 ms 460 KB OK (n = 3, answer = YES)
11 Correct 2 ms 460 KB OK (n = 3, answer = YES)
12 Correct 2 ms 460 KB OK (n = 3, answer = YES)
13 Correct 2 ms 460 KB OK (n = 3, answer = NO)
14 Correct 2 ms 520 KB OK (n = 3, answer = YES)
15 Correct 2 ms 532 KB OK (n = 3, answer = YES)
16 Correct 2 ms 596 KB OK (n = 3, answer = NO)
17 Correct 2 ms 612 KB OK (n = 3, answer = NO)
18 Correct 2 ms 612 KB OK (n = 100, answer = NO)
19 Correct 2 ms 612 KB OK (n = 100, answer = YES)
20 Correct 2 ms 612 KB OK (n = 12, answer = YES)
21 Correct 2 ms 612 KB OK (n = 12, answer = YES)
22 Correct 2 ms 612 KB OK (n = 12, answer = NO)
23 Correct 2 ms 612 KB OK (n = 12, answer = NO)
24 Correct 2 ms 612 KB OK (n = 12, answer = YES)
25 Correct 2 ms 612 KB OK (n = 12, answer = YES)
26 Correct 2 ms 612 KB OK (n = 12, answer = YES)
27 Correct 2 ms 628 KB OK (n = 12, answer = YES)
28 Correct 2 ms 628 KB OK (n = 6, answer = YES)
29 Correct 2 ms 628 KB OK (n = 12, answer = YES)
30 Correct 2 ms 628 KB OK (n = 100, answer = NO)
31 Correct 2 ms 628 KB OK (n = 100, answer = YES)
32 Correct 2 ms 628 KB OK (n = 100, answer = NO)
33 Correct 2 ms 628 KB OK (n = 100, answer = YES)
34 Correct 2 ms 628 KB OK (n = 100, answer = YES)
35 Correct 2 ms 628 KB OK (n = 100, answer = YES)
36 Correct 2 ms 628 KB OK (n = 100, answer = YES)
37 Correct 2 ms 628 KB OK (n = 28, answer = YES)
38 Correct 2 ms 628 KB OK (n = 27, answer = YES)
39 Correct 2 ms 628 KB OK (n = 90, answer = YES)
40 Correct 2 ms 628 KB OK (n = 100, answer = YES)
41 Correct 2 ms 628 KB OK (n = 100, answer = YES)
42 Correct 2 ms 628 KB OK (n = 10, answer = YES)
43 Correct 2 ms 628 KB OK (n = 100, answer = YES)
44 Correct 2 ms 628 KB OK (n = 100, answer = YES)
45 Correct 2 ms 628 KB OK (n = 100, answer = YES)
46 Correct 2 ms 628 KB OK (n = 100, answer = YES)
47 Correct 2 ms 628 KB OK (n = 100, answer = NO)
48 Correct 2 ms 628 KB OK (n = 100, answer = NO)
49 Correct 2 ms 628 KB OK (n = 100, answer = NO)
50 Correct 2 ms 628 KB OK (n = 100, answer = YES)
51 Correct 2 ms 628 KB OK (n = 100, answer = YES)
52 Correct 2 ms 628 KB OK (n = 100, answer = YES)
53 Correct 2 ms 628 KB OK (n = 100, answer = YES)
54 Correct 2 ms 628 KB OK (n = 100, answer = YES)
55 Correct 5 ms 900 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 912 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 912 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 912 KB OK (n = 10000, answer = YES)
59 Correct 6 ms 912 KB OK (n = 10000, answer = YES)
60 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
61 Correct 5 ms 1020 KB OK (n = 10000, answer = NO)
62 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
63 Correct 6 ms 1020 KB OK (n = 10000, answer = NO)
64 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
66 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
67 Correct 4 ms 1020 KB OK (n = 10000, answer = YES)
68 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
69 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
70 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
71 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 1020 KB OK (n = 865, answer = YES)
73 Correct 2 ms 1020 KB OK (n = 820, answer = YES)
74 Correct 4 ms 1020 KB OK (n = 7500, answer = NO)
75 Correct 5 ms 1020 KB OK (n = 10000, answer = NO)
76 Correct 6 ms 1020 KB OK (n = 10000, answer = NO)
77 Correct 5 ms 1020 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 1020 KB OK (n = 10000, answer = NO)
79 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
81 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
82 Correct 5 ms 1020 KB OK (n = 10000, answer = YES)
83 Correct 6 ms 1020 KB OK (n = 10000, answer = NO)
84 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
85 Correct 6 ms 1020 KB OK (n = 10000, answer = NO)
86 Correct 6 ms 1020 KB OK (n = 10000, answer = YES)
87 Correct 6 ms 1024 KB OK (n = 10000, answer = YES)
88 Correct 5 ms 1024 KB OK (n = 10000, answer = YES)
89 Correct 5 ms 1024 KB OK (n = 10000, answer = YES)
90 Correct 5 ms 1036 KB OK (n = 10000, answer = YES)
91 Correct 6 ms 1036 KB OK (n = 10000, answer = YES)
92 Correct 5 ms 1036 KB OK (n = 10000, answer = YES)
93 Correct 5 ms 1036 KB OK (n = 10000, answer = YES)
94 Correct 2 ms 1036 KB OK (n = 1, answer = YES)
95 Correct 2 ms 1036 KB OK (n = 3, answer = YES)
96 Correct 2 ms 1036 KB OK (n = 3, answer = NO)
97 Correct 2 ms 1036 KB OK (n = 3, answer = YES)
98 Correct 57 ms 5056 KB OK (n = 150000, answer = NO)
99 Correct 104 ms 5500 KB OK (n = 200000, answer = YES)
100 Correct 106 ms 7692 KB OK (n = 200000, answer = NO)
101 Correct 101 ms 9080 KB OK (n = 200000, answer = YES)
102 Correct 128 ms 11100 KB OK (n = 200000, answer = YES)
103 Correct 121 ms 12636 KB OK (n = 200000, answer = YES)
104 Correct 83 ms 14088 KB OK (n = 200000, answer = YES)
105 Correct 100 ms 14836 KB OK (n = 200000, answer = NO)
106 Correct 116 ms 16236 KB OK (n = 200000, answer = YES)
107 Correct 128 ms 18276 KB OK (n = 200000, answer = NO)
108 Correct 90 ms 19020 KB OK (n = 200000, answer = NO)
109 Correct 87 ms 19804 KB OK (n = 200000, answer = NO)
110 Correct 84 ms 20848 KB OK (n = 200000, answer = YES)
111 Correct 72 ms 21968 KB OK (n = 200000, answer = YES)
112 Correct 98 ms 23024 KB OK (n = 200000, answer = YES)
113 Correct 83 ms 24336 KB OK (n = 200000, answer = YES)
114 Correct 75 ms 25448 KB OK (n = 200000, answer = YES)
115 Correct 78 ms 26560 KB OK (n = 200000, answer = YES)
116 Correct 73 ms 27596 KB OK (n = 200000, answer = YES)
117 Correct 72 ms 28576 KB OK (n = 200000, answer = YES)