oj.uz

답안 #281967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
281967 2020-08-23T16:41:33 Z Atill83 Detecting Molecules (IOI16_molecules) C++14
100 / 100
 77 ms 25696 KB 
#include "molecules.h"
#include <bits/stdc++.h> 
using namespace std;
#define ff first
#define ss second
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
int n;
int cnt = 0;
vector<int> ans;
map<pii, int> done;
vector<ll> pre;

int do_it(vector<pll> &vc, int idx, ll l, ll r, int k){
    if(l <= 0 && r >= 0){
        return 1;
    }
    ll len = n - idx;
    ll l1 = pre[idx + k - 1] - (idx != 0 ? pre[idx - 1] : 0), r1 = pre[n - 1] - (k == n ? 0 : pre[n - 1 - k]);
    ll mxL = max(l1, l), mxR = min(r, r1);
    if(mxL <= mxR){
        if(do_it(vc, idx + 1, l - vc[idx].ff, r - vc[idx].ff, k - 1)){
            ans.push_back(vc[idx].ss);
            return 1;
        }else if(do_it(vc, idx + 1, l, r, k)){
            return 1;
        }else{
            assert(0);
            return 0;
        }
    }else{
        return 0;
    }
}

vector<int> find_subset(int l, int u, vector<int> w) {
    ans.clear();
    vector<pll> vc;
    ll top = 0;
    n = w.size();
    for(ll i: w)
        top += i;
    
    if(top < l) return ans;
    for(int i = 0; i < w.size(); i++){
        vc.push_back({w[i], i});
    }
    sort(vc.begin(), vc.end());

    for(int i = 0; i < w.size(); i++){
        pre.push_back(vc[i].ff);
        if(i) pre[i] += pre[i - 1];
    }

    for(int i = 1; i <= n; i++){
        if(do_it(vc, 0, l, u, i)) break;
    }

    return ans;
}

Compilation message

molecules.cpp: In function 'int do_it(std::vector<std::pair<long long int, long long int> >&, int, ll, ll, int)':
molecules.cpp:19:8: warning: unused variable 'len' [-Wunused-variable]
   19 |     ll len = n - idx;
      |        ^~~
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i = 0; i < w.size(); i++){
      |                    ~~^~~~~~~~~~
molecules.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int i = 0; i < w.size(); i++){
      |                    ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 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 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 1 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 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 256 KB OK (n = 12, answer = NO)
5 Correct 0 ms 256 KB OK (n = 12, answer = YES)
6 Correct 1 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 1 ms 256 KB OK (n = 100, answer = NO)
12 Correct 1 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 384 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 384 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 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 1 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 1 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 1 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 1 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 1 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 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 1 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 384 KB OK (n = 100, answer = YES)
36 Correct 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 288 KB OK (n = 28, answer = YES)
38 Correct 1 ms 256 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 1 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 1 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 256 KB OK (n = 100, answer = NO)
49 Correct 0 ms 256 KB OK (n = 100, answer = NO)
50 Correct 1 ms 384 KB OK (n = 100, answer = YES)
51 Correct 1 ms 384 KB OK (n = 100, answer = YES)
52 Correct 1 ms 384 KB OK (n = 100, answer = YES)
53 Correct 1 ms 384 KB OK (n = 100, answer = YES)
54 Correct 1 ms 256 KB OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 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 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 1 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 1 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 1 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 1 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 1 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 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 1 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 384 KB OK (n = 100, answer = YES)
36 Correct 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 288 KB OK (n = 28, answer = YES)
38 Correct 1 ms 256 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 1 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 1 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 256 KB OK (n = 100, answer = NO)
49 Correct 0 ms 256 KB OK (n = 100, answer = NO)
50 Correct 1 ms 384 KB OK (n = 100, answer = YES)
51 Correct 1 ms 384 KB OK (n = 100, answer = YES)
52 Correct 1 ms 384 KB OK (n = 100, answer = YES)
53 Correct 1 ms 384 KB OK (n = 100, answer = YES)
54 Correct 1 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 1404 KB OK (n = 10000, answer = YES)
59 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
65 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 1148 KB OK (n = 10000, answer = YES)
68 Correct 3 ms 1404 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 4 ms 1148 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 1148 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 384 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 384 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 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 1 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 1 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 1 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 1 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 1 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 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 1 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 384 KB OK (n = 100, answer = YES)
36 Correct 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 288 KB OK (n = 28, answer = YES)
38 Correct 1 ms 256 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 1 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 1 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 256 KB OK (n = 100, answer = NO)
49 Correct 0 ms 256 KB OK (n = 100, answer = NO)
50 Correct 1 ms 384 KB OK (n = 100, answer = YES)
51 Correct 1 ms 384 KB OK (n = 100, answer = YES)
52 Correct 1 ms 384 KB OK (n = 100, answer = YES)
53 Correct 1 ms 384 KB OK (n = 100, answer = YES)
54 Correct 1 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 1404 KB OK (n = 10000, answer = YES)
59 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
65 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 1148 KB OK (n = 10000, answer = YES)
68 Correct 3 ms 1404 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 4 ms 1148 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 1148 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
74 Correct 2 ms 384 KB OK (n = 7500, answer = NO)
75 Correct 1 ms 384 KB OK (n = 10000, answer = NO)
76 Correct 1 ms 384 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 384 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 384 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 1148 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 1148 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 1148 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 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 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 1 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 1 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 1 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 1 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 1 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 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 1 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 384 KB OK (n = 100, answer = YES)
36 Correct 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 288 KB OK (n = 28, answer = YES)
38 Correct 1 ms 256 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 1 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 1 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 256 KB OK (n = 100, answer = NO)
49 Correct 0 ms 256 KB OK (n = 100, answer = NO)
50 Correct 1 ms 384 KB OK (n = 100, answer = YES)
51 Correct 1 ms 384 KB OK (n = 100, answer = YES)
52 Correct 1 ms 384 KB OK (n = 100, answer = YES)
53 Correct 1 ms 384 KB OK (n = 100, answer = YES)
54 Correct 1 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 1404 KB OK (n = 10000, answer = YES)
59 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
65 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 1148 KB OK (n = 10000, answer = YES)
68 Correct 3 ms 1404 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 4 ms 1148 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 1148 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
74 Correct 2 ms 384 KB OK (n = 7500, answer = NO)
75 Correct 1 ms 384 KB OK (n = 10000, answer = NO)
76 Correct 1 ms 384 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 384 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 384 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 1532 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 1148 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 1532 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 1148 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 1148 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 19 ms 1528 KB OK (n = 150000, answer = NO)
99 Correct 71 ms 24420 KB OK (n = 200000, answer = YES)
100 Correct 65 ms 10852 KB OK (n = 200000, answer = NO)
101 Correct 73 ms 25696 KB OK (n = 200000, answer = YES)
102 Correct 65 ms 10724 KB OK (n = 200000, answer = YES)
103 Correct 57 ms 10368 KB OK (n = 200000, answer = YES)
104 Correct 74 ms 24288 KB OK (n = 200000, answer = YES)
105 Correct 25 ms 2680 KB OK (n = 200000, answer = NO)
106 Correct 77 ms 25568 KB OK (n = 200000, answer = YES)
107 Correct 66 ms 10852 KB OK (n = 200000, answer = NO)
108 Correct 24 ms 2688 KB OK (n = 200000, answer = NO)
109 Correct 29 ms 2712 KB OK (n = 200000, answer = NO)
110 Correct 60 ms 25188 KB OK (n = 200000, answer = YES)
111 Correct 45 ms 17636 KB OK (n = 200000, answer = YES)
112 Correct 59 ms 23908 KB OK (n = 200000, answer = YES)
113 Correct 42 ms 10980 KB OK (n = 200000, answer = YES)
114 Correct 48 ms 18788 KB OK (n = 200000, answer = YES)
115 Correct 57 ms 18276 KB OK (n = 200000, answer = YES)
116 Correct 60 ms 25312 KB OK (n = 200000, answer = YES)
117 Correct 51 ms 9696 KB OK (n = 200000, answer = YES)