oj.uz

답안 #1114468

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1114468 2024-11-18T23:52:17 Z Hostek Detecting Molecules (IOI16_molecules) C++17
100 / 100
 46 ms 7364 KB 
// https://oj.uz/problem/view/IOI16_molecules
// https://ioinformatics.org/files/ioi2016problem1.pdf

// #define GARY_DBG

#ifndef GARY_DBG
#include "molecules.h"
#endif
#include <bits/stdc++.h>

// #define int long long

constexpr int sizik = 1000 * 1001;

#define ar std::array
#define pr std::pair
#define vec std::vector

typedef vec<vec<int>> _kra;

std::vector<int32_t> find_subset(int l, int u, std::vector<int32_t> w) {
    int n = (int)w.size();
    std::vector<ar<int, 2>> local_w;
    for (int i = 0; i < n; i++) {
        local_w.push_back({w[i], i});
    }

    std::sort(local_w.begin(), local_w.end());

    std::deque<int> ans;

    long long p = 0, k = -1, sum = 0;
    while (k < n) {
        if (l <= sum && sum <= u) {
            // conv ans to vector;
            std::vector<int32_t> rans;
            for (const auto& a : ans) {
                rans.push_back(a);
            }
            std::sort(rans.begin(), rans.end());
            return rans;
        } else if ((k < p) || (sum < l)) {
            k++;
            if (k >= n) break;
            ans.push_back(local_w[k][1]);
            sum += local_w[k][0];
        } else if (sum > u) {
            // remove first element.
            ans.pop_front();
            sum -= local_w[p][0];
            p++;
        }
    }

    return std::vector<int32_t>(0);
}

#ifdef GARY_DBG

void solve() {
    int n;
    std::cin >> n;

    std::vector<int> w(n);
    for (auto& a : w) {
        std::cin >> a;
    }

    int l, u;
    std::cin >> l >> u;

    const auto res = find_subset(l, u, w);

    if (res.size() == 0) {
        std::cout << "RETURNED EMPTY VECTOR (...)\n";
        return;
    }

    std::cout << "res ~> ";
    for (const auto& a : res) {
        std::cout << a << " ";
    }
    std::cout << '\n';
    // check if condition met:
    int sum = 0;
    for (const auto& a : res) {
        sum += w[a];
    }

    if (l <= sum && sum <= u) {
        std::cout << "YES: SOLUTION CORRECT\n";
    } else {
        std::cout << "l: " << l << " | u: " << u << " " << " | got: " << sum << '\n';
    }
    std::cout << l << " <= " << sum << " <= " << u << '\n';
}

int32_t main() {
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);

    int t = 1;
    // std::cin >> t;

    for (; t > 0; t--) {
        solve();
    }

    return 0;
}

#endif

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB OK (n = 1, answer = NO)
2 Correct 1 ms 504 KB OK (n = 1, answer = NO)
3 Correct 1 ms 336 KB OK (n = 1, answer = YES)
4 Correct 1 ms 336 KB OK (n = 2, answer = YES)
5 Correct 1 ms 336 KB OK (n = 2, answer = YES)
6 Correct 1 ms 336 KB OK (n = 3, answer = YES)
7 Correct 1 ms 504 KB OK (n = 3, answer = YES)
8 Correct 1 ms 336 KB OK (n = 3, answer = YES)
9 Correct 1 ms 336 KB OK (n = 3, answer = YES)
10 Correct 1 ms 336 KB OK (n = 3, answer = YES)
11 Correct 1 ms 336 KB OK (n = 3, answer = YES)
12 Correct 1 ms 336 KB OK (n = 3, answer = YES)
13 Correct 1 ms 336 KB OK (n = 3, answer = NO)
14 Correct 1 ms 336 KB OK (n = 3, answer = YES)
15 Correct 1 ms 336 KB OK (n = 3, answer = YES)
16 Correct 1 ms 336 KB OK (n = 3, answer = NO)
17 Correct 1 ms 336 KB OK (n = 3, answer = NO)
18 Correct 1 ms 336 KB OK (n = 100, answer = NO)
19 Correct 1 ms 336 KB OK (n = 100, answer = YES)
20 Correct 1 ms 336 KB OK (n = 12, answer = YES)
21 Correct 1 ms 336 KB OK (n = 12, answer = YES)
22 Correct 1 ms 336 KB OK (n = 12, answer = NO)
23 Correct 1 ms 336 KB OK (n = 12, answer = NO)
24 Correct 1 ms 504 KB OK (n = 12, answer = YES)
25 Correct 1 ms 336 KB OK (n = 12, answer = YES)
26 Correct 1 ms 336 KB OK (n = 12, answer = YES)
27 Correct 1 ms 336 KB OK (n = 12, answer = YES)
28 Correct 1 ms 336 KB OK (n = 6, answer = YES)
29 Correct 1 ms 336 KB OK (n = 12, answer = YES)
30 Correct 1 ms 336 KB OK (n = 100, answer = NO)
31 Correct 1 ms 336 KB OK (n = 100, answer = YES)
32 Correct 1 ms 336 KB OK (n = 100, answer = NO)
33 Correct 1 ms 336 KB OK (n = 100, answer = YES)
34 Correct 1 ms 504 KB OK (n = 100, answer = YES)
35 Correct 1 ms 336 KB OK (n = 100, answer = YES)
36 Correct 1 ms 336 KB OK (n = 100, answer = YES)
37 Correct 1 ms 336 KB OK (n = 28, answer = YES)
38 Correct 1 ms 336 KB OK (n = 27, answer = YES)
39 Correct 1 ms 336 KB OK (n = 90, answer = YES)
40 Correct 1 ms 336 KB OK (n = 100, answer = YES)
41 Correct 1 ms 336 KB OK (n = 100, answer = YES)
42 Correct 1 ms 336 KB OK (n = 10, answer = YES)
43 Correct 1 ms 336 KB OK (n = 100, answer = YES)
44 Correct 1 ms 336 KB OK (n = 100, answer = YES)
45 Correct 1 ms 336 KB OK (n = 100, answer = YES)
46 Correct 1 ms 336 KB OK (n = 100, answer = YES)
47 Correct 1 ms 336 KB OK (n = 100, answer = NO)
48 Correct 1 ms 336 KB OK (n = 100, answer = NO)
49 Correct 1 ms 336 KB OK (n = 100, answer = NO)
50 Correct 1 ms 336 KB OK (n = 100, answer = YES)
51 Correct 1 ms 336 KB OK (n = 100, answer = YES)
52 Correct 1 ms 336 KB OK (n = 100, answer = YES)
53 Correct 1 ms 336 KB OK (n = 100, answer = YES)
54 Correct 1 ms 336 KB OK (n = 100, answer = YES)
55 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 592 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 592 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 648 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 764 KB OK (n = 10000, answer = YES)
69 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 764 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 336 KB OK (n = 865, answer = YES)
73 Correct 1 ms 336 KB OK (n = 820, answer = YES)
74 Correct 2 ms 592 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 644 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 592 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 592 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 776 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 760 KB OK (n = 10000, answer = NO)
86 Correct 5 ms 592 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 760 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 592 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 504 KB OK (n = 1, answer = YES)
95 Correct 1 ms 336 KB OK (n = 3, answer = YES)
96 Correct 1 ms 336 KB OK (n = 3, answer = NO)
97 Correct 1 ms 336 KB OK (n = 3, answer = YES)
98 Correct 28 ms 4976 KB OK (n = 150000, answer = NO)
99 Correct 38 ms 5060 KB OK (n = 200000, answer = YES)
100 Correct 46 ms 7364 KB OK (n = 200000, answer = NO)
101 Correct 43 ms 6340 KB OK (n = 200000, answer = YES)
102 Correct 40 ms 7124 KB OK (n = 200000, answer = YES)
103 Correct 40 ms 6588 KB OK (n = 200000, answer = YES)
104 Correct 40 ms 6452 KB OK (n = 200000, answer = YES)
105 Correct 38 ms 5828 KB OK (n = 200000, answer = NO)
106 Correct 43 ms 6332 KB OK (n = 200000, answer = YES)
107 Correct 39 ms 7364 KB OK (n = 200000, answer = NO)
108 Correct 38 ms 5828 KB OK (n = 200000, answer = NO)
109 Correct 37 ms 5828 KB OK (n = 200000, answer = NO)
110 Correct 31 ms 6052 KB OK (n = 200000, answer = YES)
111 Correct 34 ms 6332 KB OK (n = 200000, answer = YES)
112 Correct 26 ms 6084 KB OK (n = 200000, answer = YES)
113 Correct 27 ms 6340 KB OK (n = 200000, answer = YES)
114 Correct 28 ms 6340 KB OK (n = 200000, answer = YES)
115 Correct 29 ms 6340 KB OK (n = 200000, answer = YES)
116 Correct 35 ms 6084 KB OK (n = 200000, answer = YES)
117 Correct 37 ms 6084 KB OK (n = 200000, answer = YES)