oj.uz

답안 #253295

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
253295 2020-07-27T16:02:43 Z Hehehe Detecting Molecules (IOI16_molecules) C++14
100 / 100
 64 ms 6252 KB 
#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define pi pair <int, int>
#define sz(x) (int)((x).size())
#include "molecules.h"

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

const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int H = 2e6 + 11;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);

//ifstream in(".in");
//ofstream out(".out");

vector<pi>v;

vector<int> add(int l, int r){
    
    vector<int>ans;
    
    if(l > r)return ans;
    
    for(int i = l; i <= r; i++){
        ans.push_back(v[i].ss);
    }
    return ans;
}

vector<int> find_subset(int l, int u, vector<int> w) {
    
    int n = sz(w);
    
    v.clear();
    
    for(int i = 0; i < n; i++){
        v.push_back({w[i], i});
    }
    
    sort(all(v));
    
    int L = 0;
    ll cur = v[0].ff;
    
    if(cur >= l && cur <= u)return add(0, 0);
    
    for(int i = 1; i < n; i++){
        
        cur += v[i].ff;
        
        while(cur > u && L < i){
            cur -= v[L].ff;
            L++;
        }
        
        if(cur >= l && cur <= u)return add(L, i);
    }
    
    return add(1, 0);
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 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 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 1 ms 384 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 1 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 1 ms 384 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 0 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 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 384 KB OK (n = 100, answer = NO)
12 Correct 1 ms 384 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 384 KB OK (n = 100, answer = YES)
16 Correct 1 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 1 ms 376 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 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 1 ms 384 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 1 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 1 ms 384 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 0 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 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 384 KB OK (n = 100, answer = NO)
31 Correct 1 ms 384 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 384 KB OK (n = 100, answer = YES)
35 Correct 1 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 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 384 KB OK (n = 90, answer = YES)
40 Correct 0 ms 384 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 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 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 384 KB OK (n = 100, answer = NO)
49 Correct 1 ms 384 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 0 ms 256 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 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 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 1 ms 384 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 1 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 1 ms 384 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 0 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 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 384 KB OK (n = 100, answer = NO)
31 Correct 1 ms 384 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 384 KB OK (n = 100, answer = YES)
35 Correct 1 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 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 384 KB OK (n = 90, answer = YES)
40 Correct 0 ms 384 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 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 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 384 KB OK (n = 100, answer = NO)
49 Correct 1 ms 384 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 0 ms 256 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 640 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 3 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 3 ms 640 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 684 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 376 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 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 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 1 ms 384 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 1 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 1 ms 384 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 0 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 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 384 KB OK (n = 100, answer = NO)
31 Correct 1 ms 384 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 384 KB OK (n = 100, answer = YES)
35 Correct 1 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 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 384 KB OK (n = 90, answer = YES)
40 Correct 0 ms 384 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 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 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 384 KB OK (n = 100, answer = NO)
49 Correct 1 ms 384 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 0 ms 256 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 640 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 3 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 3 ms 640 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 684 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 376 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
74 Correct 2 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 632 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 632 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 640 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 640 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 376 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 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 1 ms 384 KB OK (n = 3, answer = YES)
8 Correct 0 ms 256 KB OK (n = 3, answer = YES)
9 Correct 1 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 1 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 1 ms 384 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 0 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 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 384 KB OK (n = 100, answer = NO)
31 Correct 1 ms 384 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 384 KB OK (n = 100, answer = YES)
35 Correct 1 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 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 384 KB OK (n = 90, answer = YES)
40 Correct 0 ms 384 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 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 0 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 384 KB OK (n = 100, answer = NO)
49 Correct 1 ms 384 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 0 ms 256 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 640 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
60 Correct 3 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 3 ms 640 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
66 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 684 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 376 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
74 Correct 2 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 632 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 632 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 640 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 640 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 640 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 36 ms 3828 KB OK (n = 150000, answer = NO)
99 Correct 55 ms 4204 KB OK (n = 200000, answer = YES)
100 Correct 61 ms 6252 KB OK (n = 200000, answer = NO)
101 Correct 57 ms 5492 KB OK (n = 200000, answer = YES)
102 Correct 64 ms 6124 KB OK (n = 200000, answer = YES)
103 Correct 54 ms 5612 KB OK (n = 200000, answer = YES)
104 Correct 53 ms 5484 KB OK (n = 200000, answer = YES)
105 Correct 52 ms 4844 KB OK (n = 200000, answer = NO)
106 Correct 59 ms 5356 KB OK (n = 200000, answer = YES)
107 Correct 62 ms 6252 KB OK (n = 200000, answer = NO)
108 Correct 50 ms 4844 KB OK (n = 200000, answer = NO)
109 Correct 50 ms 4852 KB OK (n = 200000, answer = NO)
110 Correct 45 ms 5100 KB OK (n = 200000, answer = YES)
111 Correct 35 ms 5228 KB OK (n = 200000, answer = YES)
112 Correct 34 ms 5100 KB OK (n = 200000, answer = YES)
113 Correct 36 ms 5228 KB OK (n = 200000, answer = YES)
114 Correct 37 ms 5236 KB OK (n = 200000, answer = YES)
115 Correct 40 ms 5228 KB OK (n = 200000, answer = YES)
116 Correct 52 ms 5100 KB OK (n = 200000, answer = YES)
117 Correct 48 ms 5100 KB OK (n = 200000, answer = YES)