oj.uz

답안 #341199

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341199 2020-12-29T05:57:18 Z YJU Detecting Molecules (IOI16_molecules) C++14
100 / 100
 65 ms 6240 KB 
#include<bits/stdc++.h>
#include"molecules.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=5e3+7;
const ll K=350;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

vector<int> find_subset(int l,int r,vector<int> w){
	vector<ll> lis;
	REP(i,SZ(w))lis.pb(i);
	sort(lis.begin(),lis.end(),[&](ll a,ll b){
		return (w[a]<w[b]);
	});
	ll sum=0,id=0,st;
	vector<int> ans;
	REP(i,SZ(lis)){
		st=i;
		while(id<SZ(lis)&&sum<l)sum+=w[lis[id++]];
		if(sum>=l&&sum<=r){
			for(int j=st;j<id;j++)ans.pb(lis[j]);
			return ans;
		}
		sum-=w[lis[i]];
		st=i+1;
		if(sum>=l&&sum<=r){
			for(int j=st;j<id;j++)ans.pb(lis[j]);
			return ans;
		}
	}
	return vector<int>(0);
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 384 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 0 ms 364 KB OK (n = 3, answer = YES)
7 Correct 0 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 0 ms 364 KB OK (n = 3, answer = YES)
10 Correct 0 ms 364 KB OK (n = 3, answer = YES)
11 Correct 0 ms 364 KB OK (n = 3, answer = YES)
12 Correct 0 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 0 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 364 KB OK (n = 12, answer = YES)
2 Correct 1 ms 364 KB OK (n = 12, answer = YES)
3 Correct 1 ms 364 KB OK (n = 12, answer = NO)
4 Correct 0 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 0 ms 364 KB OK (n = 12, answer = YES)
8 Correct 1 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 0 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 1 ms 384 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 0 ms 364 KB OK (n = 3, answer = YES)
7 Correct 0 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 0 ms 364 KB OK (n = 3, answer = YES)
10 Correct 0 ms 364 KB OK (n = 3, answer = YES)
11 Correct 0 ms 364 KB OK (n = 3, answer = YES)
12 Correct 0 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 0 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 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 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 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 1 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 0 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 384 KB OK (n = 90, answer = YES)
40 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
45 Correct 1 ms 364 KB OK (n = 100, answer = YES)
46 Correct 0 ms 364 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 0 ms 364 KB OK (n = 100, answer = NO)
49 Correct 0 ms 364 KB OK (n = 100, answer = NO)
50 Correct 0 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 0 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 1 ms 384 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 0 ms 364 KB OK (n = 3, answer = YES)
7 Correct 0 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 0 ms 364 KB OK (n = 3, answer = YES)
10 Correct 0 ms 364 KB OK (n = 3, answer = YES)
11 Correct 0 ms 364 KB OK (n = 3, answer = YES)
12 Correct 0 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 0 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 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 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 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 1 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 0 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 384 KB OK (n = 90, answer = YES)
40 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
45 Correct 1 ms 364 KB OK (n = 100, answer = YES)
46 Correct 0 ms 364 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 0 ms 364 KB OK (n = 100, answer = NO)
49 Correct 0 ms 364 KB OK (n = 100, answer = NO)
50 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
54 Correct 1 ms 364 KB OK (n = 100, answer = YES)
55 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
58 Correct 0 ms 620 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 620 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 1 ms 384 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 0 ms 364 KB OK (n = 3, answer = YES)
7 Correct 0 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 0 ms 364 KB OK (n = 3, answer = YES)
10 Correct 0 ms 364 KB OK (n = 3, answer = YES)
11 Correct 0 ms 364 KB OK (n = 3, answer = YES)
12 Correct 0 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 0 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 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 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 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 1 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 0 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 384 KB OK (n = 90, answer = YES)
40 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
45 Correct 1 ms 364 KB OK (n = 100, answer = YES)
46 Correct 0 ms 364 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 0 ms 364 KB OK (n = 100, answer = NO)
49 Correct 0 ms 364 KB OK (n = 100, answer = NO)
50 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
54 Correct 1 ms 364 KB OK (n = 100, answer = YES)
55 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
58 Correct 0 ms 620 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 620 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 2 ms 620 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 620 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 1 ms 384 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 0 ms 364 KB OK (n = 3, answer = YES)
7 Correct 0 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 0 ms 364 KB OK (n = 3, answer = YES)
10 Correct 0 ms 364 KB OK (n = 3, answer = YES)
11 Correct 0 ms 364 KB OK (n = 3, answer = YES)
12 Correct 0 ms 384 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 0 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 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 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 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 1 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 0 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 384 KB OK (n = 90, answer = YES)
40 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
45 Correct 1 ms 364 KB OK (n = 100, answer = YES)
46 Correct 0 ms 364 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 0 ms 364 KB OK (n = 100, answer = NO)
49 Correct 0 ms 364 KB OK (n = 100, answer = NO)
50 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
54 Correct 1 ms 364 KB OK (n = 100, answer = YES)
55 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
58 Correct 0 ms 620 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 620 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 2 ms 620 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 620 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
94 Correct 1 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 28 ms 3680 KB OK (n = 150000, answer = NO)
99 Correct 54 ms 4064 KB OK (n = 200000, answer = YES)
100 Correct 57 ms 6240 KB OK (n = 200000, answer = NO)
101 Correct 53 ms 5472 KB OK (n = 200000, answer = YES)
102 Correct 65 ms 6112 KB OK (n = 200000, answer = YES)
103 Correct 44 ms 5600 KB OK (n = 200000, answer = YES)
104 Correct 42 ms 5472 KB OK (n = 200000, answer = YES)
105 Correct 48 ms 4832 KB OK (n = 200000, answer = NO)
106 Correct 65 ms 5344 KB OK (n = 200000, answer = YES)
107 Correct 64 ms 6240 KB OK (n = 200000, answer = NO)
108 Correct 43 ms 4832 KB OK (n = 200000, answer = NO)
109 Correct 43 ms 4832 KB OK (n = 200000, answer = NO)
110 Correct 40 ms 5088 KB OK (n = 200000, answer = YES)
111 Correct 36 ms 5216 KB OK (n = 200000, answer = YES)
112 Correct 35 ms 5088 KB OK (n = 200000, answer = YES)
113 Correct 37 ms 5216 KB OK (n = 200000, answer = YES)
114 Correct 39 ms 5216 KB OK (n = 200000, answer = YES)
115 Correct 38 ms 5216 KB OK (n = 200000, answer = YES)
116 Correct 34 ms 5088 KB OK (n = 200000, answer = YES)
117 Correct 34 ms 5088 KB OK (n = 200000, answer = YES)