oj.uz

답안 #988566

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988566 2024-05-25T07:22:31 Z Wane Detecting Molecules (IOI16_molecules) C++14
100 / 100
 65 ms 16148 KB 
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include "molecules.h"

#define int long long
#define pp std::pair<int, int>

bool cmp1(pp a, pp b) {
    return a.first > b.first;
}

std::vector<signed> find_subset(signed l, signed u, std::vector<signed> w) {
    
    std::vector<pp> wp;
    for (int i = 0; i < w.size(); i++) wp.push_back({w[i], i});
    // Notice that w_max - w_min is always smaller than u - l.

    sort(wp.begin(), wp.end(), cmp1);

    // We can just put ALL things down here first, and 'replace' them until it satisfies the condition;

    std::priority_queue<pp> q;
    std::priority_queue<pp> d;

    //cout << l << ' ' <<  u << '\n';
    int man = 0;
    for (auto a : wp) {
        if (man >= l) {
            //cout << a.first << " << D, ";
            d.push(a); // it means 'ready' queue
            continue;
        }
        //cout << a.first << " << Q, ";
        q.push(a); man += a.first;
    }
    //cout << "Man: " << man << '\n';

    if (man < l) {
        return {}; // Impossible!
    }

    while (!d.empty() && man > u) {
        // Replace d's top and q's top, but there's no more usage for q's top so just fuck it off
        auto dt = d.top();
        auto qt = q.top();
        q.pop(); d.pop();
        q.push(dt);
        man -= qt.first - dt.first;
    }

    if (man > u) {
        return {};
    }
    
    std::vector<signed> ans;
    while (!q.empty()) {
        ans.push_back(q.top().second);
        //cout << q.top().second << ' ';
        q.pop();
    }
    //cout << '\n';

    return ans;
}

/*
signed main() {
    int n, l, u;
    cin >> n >> l >> u;
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    //cout << l << ' ' << u << '\n';
    std::vector<int> result = find_subset(l, u, w);
    
    
    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d ", result[i]);
}
*/

Compilation message

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

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB OK (n = 1, answer = NO)
2 Correct 1 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 1 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 1 ms 348 KB OK (n = 3, answer = YES)
7 Correct 1 ms 348 KB OK (n = 3, answer = YES)
8 Correct 1 ms 348 KB OK (n = 3, answer = YES)
9 Correct 0 ms 428 KB OK (n = 3, answer = YES)
10 Correct 1 ms 344 KB OK (n = 3, answer = YES)
11 Correct 1 ms 348 KB OK (n = 3, answer = YES)
12 Correct 1 ms 348 KB OK (n = 3, answer = YES)
13 Correct 1 ms 344 KB OK (n = 3, answer = NO)
14 Correct 1 ms 348 KB OK (n = 3, answer = YES)
15 Correct 1 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 428 KB OK (n = 3, answer = NO)
17 Correct 1 ms 348 KB OK (n = 3, answer = NO)
18 Correct 1 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Correct 1 ms 344 KB OK (n = 12, answer = YES)
21 Correct 0 ms 348 KB OK (n = 12, answer = YES)
22 Correct 0 ms 348 KB OK (n = 12, answer = NO)
23 Correct 1 ms 348 KB OK (n = 12, answer = NO)
24 Correct 1 ms 348 KB OK (n = 12, answer = YES)
25 Correct 1 ms 348 KB OK (n = 12, answer = YES)
26 Correct 1 ms 348 KB OK (n = 12, answer = YES)
27 Correct 0 ms 348 KB OK (n = 12, answer = YES)
28 Correct 1 ms 348 KB OK (n = 6, answer = YES)
29 Correct 1 ms 348 KB OK (n = 12, answer = YES)
30 Correct 0 ms 348 KB OK (n = 100, answer = NO)
31 Correct 1 ms 348 KB OK (n = 100, answer = YES)
32 Correct 1 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 348 KB OK (n = 100, answer = YES)
34 Correct 1 ms 348 KB OK (n = 100, answer = YES)
35 Correct 0 ms 348 KB OK (n = 100, answer = YES)
36 Correct 0 ms 348 KB OK (n = 100, answer = YES)
37 Correct 1 ms 348 KB OK (n = 28, answer = YES)
38 Correct 0 ms 348 KB OK (n = 27, answer = YES)
39 Correct 0 ms 348 KB OK (n = 90, answer = YES)
40 Correct 0 ms 348 KB OK (n = 100, answer = YES)
41 Correct 1 ms 348 KB OK (n = 100, answer = YES)
42 Correct 1 ms 500 KB OK (n = 10, answer = YES)
43 Correct 1 ms 344 KB OK (n = 100, answer = YES)
44 Correct 0 ms 416 KB OK (n = 100, answer = YES)
45 Correct 1 ms 344 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 1 ms 348 KB OK (n = 100, answer = NO)
48 Correct 1 ms 348 KB OK (n = 100, answer = NO)
49 Correct 0 ms 348 KB OK (n = 100, answer = NO)
50 Correct 0 ms 348 KB OK (n = 100, answer = YES)
51 Correct 0 ms 348 KB OK (n = 100, answer = YES)
52 Correct 1 ms 348 KB OK (n = 100, answer = YES)
53 Correct 1 ms 348 KB OK (n = 100, answer = YES)
54 Correct 1 ms 344 KB OK (n = 100, answer = YES)
55 Correct 2 ms 984 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 984 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 892 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 984 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 984 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 984 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 1072 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 980 KB OK (n = 10000, answer = YES)
63 Correct 4 ms 888 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 984 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 980 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 984 KB OK (n = 10000, answer = YES)
67 Correct 4 ms 980 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 984 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 984 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 984 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 980 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 348 KB OK (n = 865, answer = YES)
73 Correct 1 ms 348 KB OK (n = 820, answer = YES)
74 Correct 2 ms 860 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 984 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 1068 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 984 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 984 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 984 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 984 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 984 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 980 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 908 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 884 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 984 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 984 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 984 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 1048 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 980 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 984 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 984 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 980 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 984 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 348 KB OK (n = 1, answer = YES)
95 Correct 1 ms 344 KB OK (n = 3, answer = YES)
96 Correct 1 ms 348 KB OK (n = 3, answer = NO)
97 Correct 1 ms 348 KB OK (n = 3, answer = YES)
98 Correct 25 ms 11196 KB OK (n = 150000, answer = NO)
99 Correct 49 ms 14060 KB OK (n = 200000, answer = YES)
100 Correct 61 ms 16148 KB OK (n = 200000, answer = NO)
101 Correct 40 ms 15808 KB OK (n = 200000, answer = YES)
102 Correct 45 ms 15036 KB OK (n = 200000, answer = YES)
103 Correct 65 ms 14784 KB OK (n = 200000, answer = YES)
104 Correct 32 ms 14268 KB OK (n = 200000, answer = YES)
105 Correct 38 ms 14272 KB OK (n = 200000, answer = NO)
106 Correct 45 ms 14784 KB OK (n = 200000, answer = YES)
107 Correct 59 ms 14784 KB OK (n = 200000, answer = NO)
108 Correct 39 ms 14520 KB OK (n = 200000, answer = NO)
109 Correct 32 ms 12480 KB OK (n = 200000, answer = NO)
110 Correct 39 ms 14432 KB OK (n = 200000, answer = YES)
111 Correct 55 ms 12736 KB OK (n = 200000, answer = YES)
112 Correct 31 ms 13196 KB OK (n = 200000, answer = YES)
113 Correct 52 ms 13740 KB OK (n = 200000, answer = YES)
114 Correct 31 ms 15040 KB OK (n = 200000, answer = YES)
115 Correct 42 ms 14092 KB OK (n = 200000, answer = YES)
116 Correct 27 ms 12736 KB OK (n = 200000, answer = YES)
117 Correct 47 ms 14012 KB OK (n = 200000, answer = YES)