oj.uz

답안 #707568

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707568 2023-03-09T10:32:11 Z Error42 Detecting Molecules (IOI16_molecules) C++14
100 / 100
 53 ms 8652 KB 
#include "molecules.h"

#include <algorithm>
#include <numeric>
#include <vector>

using namespace std;
using ll = long long;

vector<int> find_subset(
    int const _l,
    int const _u,
    vector<int> _w
) {
    ll const l = _l;
    ll const u = _u;

    vector<pair<ll, int>> w(_w.size());

    for (int i = 0; i < w.size(); i++) {
        w[i].first = _w[i];
        w[i].second = i;
    }

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

    vector<ll> prefix(w.size() + 1);

    for (int i = 1; i <= w.size(); i++)
        prefix[i] = prefix[i - 1] + w[i - 1].first;

    for (int mol_count = 1; mol_count <= w.size(); mol_count++) {
        int lo = 0;
        int hi = mol_count;

        while (lo <= hi) {
            int const mi = (lo + hi) / 2;
            int const top = mi;
            int const bottom = mol_count - mi; 

            ll val = prefix[bottom] + prefix[w.size()] - prefix[w.size() - top];

            if (l <= val && val <= u) {
                vector<int> solution;

                for (int i = 0; i < bottom; i++)
                    solution.push_back(w[i].second);

                for (int i = w.size() - top; i < w.size(); i++)
                    solution.push_back(w[i].second);

                return solution;
            }
            
            if (val < l)
                lo = mi + 1;
            else
                hi = mi - 1;
        }
    }

    return {};
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:20:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for (int i = 0; i < w.size(); i++) {
      |                     ~~^~~~~~~~~~
molecules.cpp:29:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (int i = 1; i <= w.size(); i++)
      |                     ~~^~~~~~~~~~~
molecules.cpp:32:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int mol_count = 1; mol_count <= w.size(); mol_count++) {
      |                             ~~~~~~~~~~^~~~~~~~~~~
molecules.cpp:49:48: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |                 for (int i = w.size() - top; i < w.size(); i++)
      |                                              ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 212 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 0 ms 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 0 ms 212 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 288 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 ms 288 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 292 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 288 KB OK (n = 100, answer = YES)
42 Correct 0 ms 288 KB OK (n = 10, answer = YES)
43 Correct 0 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 0 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 288 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 556 KB OK (n = 10000, answer = YES)
58 Correct 4 ms 552 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 576 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 552 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
74 Correct 2 ms 428 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 560 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 556 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 684 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 556 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 652 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 548 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 648 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 616 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 560 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 616 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 552 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 212 KB OK (n = 1, answer = YES)
95 Correct 1 ms 288 KB OK (n = 3, answer = YES)
96 Correct 0 ms 212 KB OK (n = 3, answer = NO)
97 Correct 1 ms 340 KB OK (n = 3, answer = YES)
98 Correct 34 ms 5724 KB OK (n = 150000, answer = NO)
99 Correct 42 ms 8080 KB OK (n = 200000, answer = YES)
100 Correct 51 ms 8652 KB OK (n = 200000, answer = NO)
101 Correct 44 ms 8012 KB OK (n = 200000, answer = YES)
102 Correct 44 ms 8596 KB OK (n = 200000, answer = YES)
103 Correct 46 ms 8148 KB OK (n = 200000, answer = YES)
104 Correct 42 ms 7844 KB OK (n = 200000, answer = YES)
105 Correct 45 ms 7280 KB OK (n = 200000, answer = NO)
106 Correct 45 ms 7972 KB OK (n = 200000, answer = YES)
107 Correct 52 ms 8604 KB OK (n = 200000, answer = NO)
108 Correct 53 ms 7432 KB OK (n = 200000, answer = NO)
109 Correct 45 ms 7260 KB OK (n = 200000, answer = NO)
110 Correct 36 ms 7456 KB OK (n = 200000, answer = YES)
111 Correct 29 ms 7712 KB OK (n = 200000, answer = YES)
112 Correct 29 ms 7580 KB OK (n = 200000, answer = YES)
113 Correct 31 ms 7756 KB OK (n = 200000, answer = YES)
114 Correct 30 ms 7840 KB OK (n = 200000, answer = YES)
115 Correct 30 ms 7756 KB OK (n = 200000, answer = YES)
116 Correct 36 ms 7504 KB OK (n = 200000, answer = YES)
117 Correct 36 ms 7500 KB OK (n = 200000, answer = YES)