oj.uz

답안 #391519

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
391519 2021-04-19T06:51:42 Z giorgikob Detecting Molecules (IOI16_molecules) C++14
100 / 100
 64 ms 8864 KB 
#include "molecules.h"

#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;

std::vector<int> find_subset(int l, int u, std::vector<int> w) {

    vector<pair<int,int>>P;
    for(int i = 0; i < w.size(); i++){
        P.pb({w[i],i});
    }

    sort(P.begin(),P.end());

    for(int i = 0; i < w.size(); i++) w[i] = P[i].ff;

    if(w[0] > u) return {};

    vector<int>answer;

    ll sum = 0;
    for(auto a : w) sum += a;
    if(sum < l) return {};

    vector<ll>pre(w.size(),0);
    pre[0] = w[0];
    for(int i = 1; i < w.size(); i++){
        pre[i] = pre[i-1] + w[i];
        if(pre[i] >= l && pre[i] <= u){
            for(int j = 0; j <= i; j++) answer.pb(P[j].ss);
            return answer;
        }
    }


    sum = 0;
    for(int i = w.size() - 1; i >= 0; i--){
        sum += w[i];
        answer.pb(P[i].ss);
        if(sum >= l && sum <= u) return answer;
        int L = 0, r = i-1, res = -1;
        while(L <= r){
            int mid = (L+r)/2;
            if(pre[mid] + sum >= l){
                res = mid;
                r = mid - 1;
            } else {
                L = mid + 1;
            }
        }

        if(pre[res]+sum <= u){
            for(int j = 0; j <= res; j++){
                answer.pb(P[j].ss);
            }
            return answer;
        }
    }

    return {};
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:13:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i = 0; i < w.size(); i++){
      |                    ~~^~~~~~~~~~
molecules.cpp:19:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i = 0; i < w.size(); i++) w[i] = P[i].ff;
      |                    ~~^~~~~~~~~~
molecules.cpp:31:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int i = 1; i < w.size(); i++){
      |                    ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 208 KB OK (n = 3, answer = YES)
9 Correct 1 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 296 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 208 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 296 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 12, answer = YES)
2 Correct 1 ms 204 KB OK (n = 12, answer = YES)
3 Correct 1 ms 204 KB OK (n = 12, answer = NO)
4 Correct 1 ms 204 KB OK (n = 12, answer = NO)
5 Correct 1 ms 204 KB OK (n = 12, answer = YES)
6 Correct 1 ms 300 KB OK (n = 12, answer = YES)
7 Correct 1 ms 204 KB OK (n = 12, answer = YES)
8 Correct 1 ms 204 KB OK (n = 12, answer = YES)
9 Correct 1 ms 204 KB OK (n = 6, answer = YES)
10 Correct 1 ms 216 KB OK (n = 12, answer = YES)
11 Correct 1 ms 204 KB OK (n = 100, answer = NO)
12 Correct 1 ms 204 KB OK (n = 100, answer = YES)
13 Correct 1 ms 204 KB OK (n = 100, answer = NO)
14 Correct 1 ms 208 KB OK (n = 100, answer = YES)
15 Correct 1 ms 296 KB OK (n = 100, answer = YES)
16 Correct 1 ms 204 KB OK (n = 100, answer = YES)
17 Correct 1 ms 296 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 208 KB OK (n = 3, answer = YES)
9 Correct 1 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 296 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 208 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 296 KB OK (n = 100, answer = YES)
20 Correct 1 ms 204 KB OK (n = 12, answer = YES)
21 Correct 1 ms 204 KB OK (n = 12, answer = YES)
22 Correct 1 ms 204 KB OK (n = 12, answer = NO)
23 Correct 1 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 300 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 216 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 208 KB OK (n = 100, answer = YES)
34 Correct 1 ms 296 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 296 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 300 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 288 KB OK (n = 100, answer = YES)
41 Correct 1 ms 204 KB OK (n = 100, answer = YES)
42 Correct 1 ms 208 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 1 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 208 KB OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 208 KB OK (n = 3, answer = YES)
9 Correct 1 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 296 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 208 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 296 KB OK (n = 100, answer = YES)
20 Correct 1 ms 204 KB OK (n = 12, answer = YES)
21 Correct 1 ms 204 KB OK (n = 12, answer = YES)
22 Correct 1 ms 204 KB OK (n = 12, answer = NO)
23 Correct 1 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 300 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 216 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 208 KB OK (n = 100, answer = YES)
34 Correct 1 ms 296 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 296 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 300 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 288 KB OK (n = 100, answer = YES)
41 Correct 1 ms 204 KB OK (n = 100, answer = YES)
42 Correct 1 ms 208 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 1 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 208 KB OK (n = 100, answer = YES)
55 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 588 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 208 KB OK (n = 3, answer = YES)
9 Correct 1 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 296 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 208 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 296 KB OK (n = 100, answer = YES)
20 Correct 1 ms 204 KB OK (n = 12, answer = YES)
21 Correct 1 ms 204 KB OK (n = 12, answer = YES)
22 Correct 1 ms 204 KB OK (n = 12, answer = NO)
23 Correct 1 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 300 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 216 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 208 KB OK (n = 100, answer = YES)
34 Correct 1 ms 296 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 296 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 300 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 288 KB OK (n = 100, answer = YES)
41 Correct 1 ms 204 KB OK (n = 100, answer = YES)
42 Correct 1 ms 208 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 1 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 208 KB OK (n = 100, answer = YES)
55 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 588 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)
74 Correct 2 ms 588 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 632 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 588 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
83 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 536 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 588 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 1 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 1 ms 204 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 208 KB OK (n = 3, answer = YES)
9 Correct 1 ms 204 KB OK (n = 3, answer = YES)
10 Correct 1 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 204 KB OK (n = 3, answer = YES)
12 Correct 1 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 1 ms 296 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 ms 208 KB OK (n = 3, answer = NO)
18 Correct 1 ms 204 KB OK (n = 100, answer = NO)
19 Correct 1 ms 296 KB OK (n = 100, answer = YES)
20 Correct 1 ms 204 KB OK (n = 12, answer = YES)
21 Correct 1 ms 204 KB OK (n = 12, answer = YES)
22 Correct 1 ms 204 KB OK (n = 12, answer = NO)
23 Correct 1 ms 204 KB OK (n = 12, answer = NO)
24 Correct 1 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 300 KB OK (n = 12, answer = YES)
26 Correct 1 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 216 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 1 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 1 ms 208 KB OK (n = 100, answer = YES)
34 Correct 1 ms 296 KB OK (n = 100, answer = YES)
35 Correct 1 ms 204 KB OK (n = 100, answer = YES)
36 Correct 1 ms 296 KB OK (n = 100, answer = YES)
37 Correct 1 ms 204 KB OK (n = 28, answer = YES)
38 Correct 1 ms 300 KB OK (n = 27, answer = YES)
39 Correct 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 288 KB OK (n = 100, answer = YES)
41 Correct 1 ms 204 KB OK (n = 100, answer = YES)
42 Correct 1 ms 208 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 1 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 ms 204 KB OK (n = 100, answer = YES)
47 Correct 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 1 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 208 KB OK (n = 100, answer = YES)
55 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
64 Correct 4 ms 588 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)
74 Correct 2 ms 588 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 632 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 588 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
83 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 536 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 588 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 320 KB OK (n = 1, answer = YES)
95 Correct 1 ms 204 KB OK (n = 3, answer = YES)
96 Correct 1 ms 204 KB OK (n = 3, answer = NO)
97 Correct 1 ms 204 KB OK (n = 3, answer = YES)
98 Correct 36 ms 4416 KB OK (n = 150000, answer = NO)
99 Correct 54 ms 6688 KB OK (n = 200000, answer = YES)
100 Correct 64 ms 8864 KB OK (n = 200000, answer = NO)
101 Correct 56 ms 6552 KB OK (n = 200000, answer = YES)
102 Correct 56 ms 7092 KB OK (n = 200000, answer = YES)
103 Correct 54 ms 6668 KB OK (n = 200000, answer = YES)
104 Correct 52 ms 6432 KB OK (n = 200000, answer = YES)
105 Correct 48 ms 4800 KB OK (n = 200000, answer = NO)
106 Correct 57 ms 6492 KB OK (n = 200000, answer = YES)
107 Correct 54 ms 6164 KB OK (n = 200000, answer = NO)
108 Correct 49 ms 4792 KB OK (n = 200000, answer = NO)
109 Correct 51 ms 4780 KB OK (n = 200000, answer = NO)
110 Correct 44 ms 6048 KB OK (n = 200000, answer = YES)
111 Correct 35 ms 6176 KB OK (n = 200000, answer = YES)
112 Correct 35 ms 6192 KB OK (n = 200000, answer = YES)
113 Correct 37 ms 6196 KB OK (n = 200000, answer = YES)
114 Correct 49 ms 6196 KB OK (n = 200000, answer = YES)
115 Correct 50 ms 6168 KB OK (n = 200000, answer = YES)
116 Correct 44 ms 6100 KB OK (n = 200000, answer = YES)
117 Correct 47 ms 6068 KB OK (n = 200000, answer = YES)