oj.uz

답안 #293755

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293755 2020-09-08T11:32:08 Z Hemimor Detecting Molecules (IOI16_molecules) C++14
100 / 100
 59 ms 5880 KB 
#include "molecules.h"
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

vi find_subset(int l,int u,vi w){
	int n=w.size();
	vp a(n);
	for(int i=0;i<n;i++) a[i]={w[i],i};
	sort(a.begin(),a.end());
	ll L=0,R=0,x=a[0].first;
	vi b;
	for(int i=0;i<n;i++){
		L+=a[i].first-x;
		R+=a[n-i-1].first-x;
		ll ls=x*(i+1)+L,rs=x*(i+1)+R,t=ls;
		if(u<ls||rs<l) continue;
		if(l<=t&&t<=u){
			for(int j=0;j<=i;j++) b.push_back(a[j].second);
		}
		else{
			for(int j=0;j<=i;j++){
				t-=a[i-j].first;
				t+=a[n-j-1].first;
				if(l<=t&&t<=u){
					for(int k=0;k<i-j;k++) b.push_back(a[k].second);
					for(int k=0;k<=j;k++) b.push_back(a[n-k-1].second);
					break;
				}
			}
		}
		break;
	}
	sort(b.begin(),b.end());
	return b;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 1 ms 256 KB OK (n = 12, answer = NO)
4 Correct 0 ms 256 KB OK (n = 12, answer = NO)
5 Correct 1 ms 256 KB OK (n = 12, answer = YES)
6 Correct 0 ms 256 KB OK (n = 12, answer = YES)
7 Correct 1 ms 256 KB OK (n = 12, answer = YES)
8 Correct 0 ms 256 KB OK (n = 12, answer = YES)
9 Correct 1 ms 256 KB OK (n = 6, answer = YES)
10 Correct 0 ms 256 KB OK (n = 12, answer = YES)
11 Correct 1 ms 256 KB OK (n = 100, answer = NO)
12 Correct 0 ms 384 KB OK (n = 100, answer = YES)
13 Correct 0 ms 256 KB OK (n = 100, answer = NO)
14 Correct 1 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 0 ms 256 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 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 1 ms 384 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 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 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 1 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 1 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 1 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 1 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 1 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 1 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 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 1 ms 384 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 1 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 256 KB OK (n = 10, answer = YES)
43 Correct 1 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 ms 256 KB OK (n = 100, answer = YES)
46 Correct 1 ms 256 KB OK (n = 100, answer = YES)
47 Correct 1 ms 256 KB OK (n = 100, answer = NO)
48 Correct 1 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 1 ms 256 KB OK (n = 100, answer = YES)
51 Correct 1 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 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 1 ms 384 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 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 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 1 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 1 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 1 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 1 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 1 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 1 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 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 1 ms 384 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 1 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 256 KB OK (n = 10, answer = YES)
43 Correct 1 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 ms 256 KB OK (n = 100, answer = YES)
46 Correct 1 ms 256 KB OK (n = 100, answer = YES)
47 Correct 1 ms 256 KB OK (n = 100, answer = NO)
48 Correct 1 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 1 ms 256 KB OK (n = 100, answer = YES)
51 Correct 1 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 1 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 2 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 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 256 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 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 1 ms 384 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 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 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 1 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 1 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 1 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 1 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 1 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 1 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 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 1 ms 384 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 1 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 256 KB OK (n = 10, answer = YES)
43 Correct 1 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 ms 256 KB OK (n = 100, answer = YES)
46 Correct 1 ms 256 KB OK (n = 100, answer = YES)
47 Correct 1 ms 256 KB OK (n = 100, answer = NO)
48 Correct 1 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 1 ms 256 KB OK (n = 100, answer = YES)
51 Correct 1 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 1 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 2 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 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 256 KB OK (n = 820, answer = YES)
74 Correct 2 ms 384 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 512 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 512 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 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 1 ms 384 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 1 ms 384 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 1 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 1 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 1 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 1 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 1 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 1 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 1 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 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 1 ms 384 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 1 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 256 KB OK (n = 10, answer = YES)
43 Correct 1 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 ms 256 KB OK (n = 100, answer = YES)
46 Correct 1 ms 256 KB OK (n = 100, answer = YES)
47 Correct 1 ms 256 KB OK (n = 100, answer = NO)
48 Correct 1 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 1 ms 256 KB OK (n = 100, answer = YES)
51 Correct 1 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 1 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 2 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 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 256 KB OK (n = 820, answer = YES)
74 Correct 2 ms 384 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 512 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 512 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 512 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 0 ms 256 KB OK (n = 3, answer = NO)
97 Correct 0 ms 256 KB OK (n = 3, answer = YES)
98 Correct 34 ms 3448 KB OK (n = 150000, answer = NO)
99 Correct 53 ms 4984 KB OK (n = 200000, answer = YES)
100 Correct 57 ms 5624 KB OK (n = 200000, answer = NO)
101 Correct 55 ms 4984 KB OK (n = 200000, answer = YES)
102 Correct 59 ms 5496 KB OK (n = 200000, answer = YES)
103 Correct 50 ms 4992 KB OK (n = 200000, answer = YES)
104 Correct 50 ms 4852 KB OK (n = 200000, answer = YES)
105 Correct 49 ms 4224 KB OK (n = 200000, answer = NO)
106 Correct 56 ms 4984 KB OK (n = 200000, answer = YES)
107 Correct 58 ms 5880 KB OK (n = 200000, answer = NO)
108 Correct 45 ms 4224 KB OK (n = 200000, answer = NO)
109 Correct 46 ms 4216 KB OK (n = 200000, answer = NO)
110 Correct 43 ms 4480 KB OK (n = 200000, answer = YES)
111 Correct 34 ms 4608 KB OK (n = 200000, answer = YES)
112 Correct 31 ms 4480 KB OK (n = 200000, answer = YES)
113 Correct 35 ms 4856 KB OK (n = 200000, answer = YES)
114 Correct 37 ms 4728 KB OK (n = 200000, answer = YES)
115 Correct 37 ms 4728 KB OK (n = 200000, answer = YES)
116 Correct 40 ms 4480 KB OK (n = 200000, answer = YES)
117 Correct 41 ms 4472 KB OK (n = 200000, answer = YES)