oj.uz

Submission #735308

# Submission time Handle Problem Language Result Execution time Memory
735308 2023-05-04T00:10:24 Z That_Salamander Detecting Molecules (IOI16_molecules) C++17
100 / 100
 45 ms 5580 KB 
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <cstring>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <cassert>
#include <random>

#define FOR(var,bound) for(int var = 0; var < bound; var++)
#define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
#define FORR(var,bound) for(int var = bound-1; var >= 0; var--)
#define int long long

//#define RANDOMISE

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;

vector<signed> find_subset(signed l, signed u, vector<signed> w) {
    vector<int> sortedPerm(w.size());
    FOR(i, w.size()) sortedPerm[i] = i;
    sort(sortedPerm.begin(), sortedPerm.end(), [&](int a, int b) {
        return w[a] < w[b];
    });

    int sum = 0;

    int li = 0;
    int ri = -1;

    while (ri < (int) w.size() && li < w.size()) {
        if (l <= sum && sum <= u) {
            vector<signed> res;

            for (int i = li ; i <= ri; i++) {
                res.push_back(sortedPerm[i]);
            }

            return res;
        } else if (sum < l) {
            if (ri + 1 < (int) w.size()) {
                sum += w[sortedPerm[++ri]];
            } else break;
        } else {
            sum -= w[sortedPerm[li++]];
        }
    }

    return {};
}

#ifdef LOCAL_TEST
signed main() {
#ifdef RANDOMISE
    FOR(iter, 10000) {
#endif

    signed n, l, u;

#ifdef RANDOMISE
    n = 100;
    l = rand() % 1000 + 1;
    if (l == 1000) {
        u = 1000;
    } else {
        u = l + (rand() % (1001 - l));
    }

    vector<signed> w(n);
    fill(w.begin(), w.end(), rand() % 100 + 1);
#else
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<signed> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
#endif
    std::vector<signed> result = find_subset(l, u, w);
    
#ifdef RANDOMISE
    if (result.size()  == 0) {
        int count = (l + w[0] - 1) / w[0];
        int mres = w[0] * count;

        if (mres >= l && mres <= u && count <= n) {
            cout << "Didn't find solution!" << endl;
            cout << "w = " << w[0] << " range = [" << l << ", " << u << "]" << endl;
            exit(0);
        }
    } else {
        int res = 0;
        for (int i: result) {
            res += w[i];
        }

        if (res < l) {
            cout << "Too small!" << endl;
            exit(0);
        }

        if (res > u) {
            cout << "Too big!" << endl;
            exit(0);
        }

        set<int> unique(result.begin(), result.end());
        if (unique.size() != result.size()) {
            cout << "Duplicate molecules!" << endl;
            cout << "w = " << w[0] << " range = [" << l << ", " << u << "]" << endl;
            exit(0);
        }
    }
    }
#else
    printf("%d\n", (signed) result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (signed)result.size() - 1]);
#endif
}
#endif

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:15:45: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 | #define FOR(var,bound) for(int var = 0; var < bound; var++)
......
   31 |     FOR(i, w.size()) sortedPerm[i] = i;
      |         ~~~~~~~~~~~                          
molecules.cpp:31:5: note: in expansion of macro 'FOR'
   31 |     FOR(i, w.size()) sortedPerm[i] = i;
      |     ^~~
molecules.cpp:41:38: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     while (ri < (int) w.size() && li < w.size()) {
      |                                   ~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 300 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 300 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 300 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 296 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB OK (n = 12, answer = YES)
2 Correct 1 ms 300 KB OK (n = 12, answer = YES)
3 Correct 1 ms 212 KB OK (n = 12, answer = NO)
4 Correct 1 ms 212 KB OK (n = 12, answer = NO)
5 Correct 1 ms 300 KB OK (n = 12, answer = YES)
6 Correct 1 ms 300 KB OK (n = 12, answer = YES)
7 Correct 1 ms 300 KB OK (n = 12, answer = YES)
8 Correct 1 ms 212 KB OK (n = 12, answer = YES)
9 Correct 1 ms 300 KB OK (n = 6, answer = YES)
10 Correct 1 ms 212 KB OK (n = 12, answer = YES)
11 Correct 1 ms 212 KB OK (n = 100, answer = NO)
12 Correct 1 ms 212 KB OK (n = 100, answer = YES)
13 Correct 1 ms 212 KB OK (n = 100, answer = NO)
14 Correct 1 ms 212 KB OK (n = 100, answer = YES)
15 Correct 1 ms 212 KB OK (n = 100, answer = YES)
16 Correct 1 ms 212 KB OK (n = 100, answer = YES)
17 Correct 1 ms 212 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 300 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 300 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 300 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 296 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 300 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 300 KB OK (n = 12, answer = YES)
25 Correct 1 ms 300 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 300 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 296 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 296 KB OK (n = 100, answer = YES)
45 Correct 1 ms 296 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 300 KB OK (n = 100, answer = NO)
48 Correct 1 ms 224 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 296 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 432 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 436 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 300 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 300 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 300 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 296 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 300 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 300 KB OK (n = 12, answer = YES)
25 Correct 1 ms 300 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 300 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 296 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 296 KB OK (n = 100, answer = YES)
45 Correct 1 ms 296 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 300 KB OK (n = 100, answer = NO)
48 Correct 1 ms 224 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 296 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 432 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 436 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 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 1 ms 340 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 468 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 ms 212 KB OK (n = 2, answer = YES)
6 Correct 1 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 300 KB OK (n = 3, answer = YES)
9 Correct 1 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 1 ms 300 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 300 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 296 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 300 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 300 KB OK (n = 12, answer = YES)
25 Correct 1 ms 300 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 300 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 296 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 KB OK (n = 100, answer = YES)
44 Correct 1 ms 296 KB OK (n = 100, answer = YES)
45 Correct 1 ms 296 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 300 KB OK (n = 100, answer = NO)
48 Correct 1 ms 224 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 296 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 432 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 436 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 436 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 444 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 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 1 ms 340 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 440 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 212 KB OK (n = 1, answer = YES)
95 Correct 1 ms 296 KB OK (n = 3, answer = YES)
96 Correct 1 ms 212 KB OK (n = 3, answer = NO)
97 Correct 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 21 ms 3412 KB OK (n = 150000, answer = NO)
99 Correct 34 ms 4992 KB OK (n = 200000, answer = YES)
100 Correct 37 ms 5452 KB OK (n = 200000, answer = NO)
101 Correct 32 ms 4884 KB OK (n = 200000, answer = YES)
102 Correct 45 ms 5476 KB OK (n = 200000, answer = YES)
103 Correct 25 ms 4920 KB OK (n = 200000, answer = YES)
104 Correct 26 ms 4776 KB OK (n = 200000, answer = YES)
105 Correct 29 ms 4152 KB OK (n = 200000, answer = NO)
106 Correct 43 ms 4908 KB OK (n = 200000, answer = YES)
107 Correct 44 ms 5580 KB OK (n = 200000, answer = NO)
108 Correct 25 ms 4180 KB OK (n = 200000, answer = NO)
109 Correct 25 ms 4140 KB OK (n = 200000, answer = NO)
110 Correct 28 ms 4396 KB OK (n = 200000, answer = YES)
111 Correct 21 ms 4528 KB OK (n = 200000, answer = YES)
112 Correct 20 ms 4436 KB OK (n = 200000, answer = YES)
113 Correct 22 ms 4652 KB OK (n = 200000, answer = YES)
114 Correct 30 ms 4684 KB OK (n = 200000, answer = YES)
115 Correct 22 ms 4652 KB OK (n = 200000, answer = YES)
116 Correct 21 ms 4308 KB OK (n = 200000, answer = YES)
117 Correct 19 ms 4408 KB OK (n = 200000, answer = YES)