oj.uz

답안 #596945

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596945 2022-07-15T09:46:30 Z jophyyjh Detecting Molecules (IOI16_molecules) C++14
100 / 100
 51 ms 7080 KB 
/**
 * If we've got a subset S and two elements x, y (not in S). We must not have:
 *                  sum(S + {x}) > u, sum(S + {y}) < v,
 * As this immediately violates the given constraint. We now can propose a solution.
 * 
 * Time Complexity: O(n * log(n))
 * Implementation 1
*/

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

typedef long long   ll;


struct val_t {
    int pos, val;
};

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    std::vector<val_t> values(n);
    for (int k = 0; k < n; k++)
        values[k].val = w[k], values[k].pos = k;
    std::sort(values.begin(), values.end(),
              [](const val_t& v1, const val_t& v2) {
                 return v1.val < v2.val;
              });
    std::vector<ll> prefix_sum(n + 1);
    prefix_sum[0] = 0;
    for (int i = 0; i < n; i++)
        prefix_sum[i + 1] = prefix_sum[i] + values[i].val;
    
    bool found = false;
    std::vector<int> ans;
    for (int i = n; i >= 1 && !found; i--) {
        int j = i;
        for (int step = n / 2 + 1; step >= 1; step /= 2) {
            while (j - step >= 0 && prefix_sum[i] - prefix_sum[j - step] <= ll(u))
                j -= step;
        }
        if (prefix_sum[i] - prefix_sum[j] >= ll(l)) {
            assert(prefix_sum[i] - prefix_sum[j] <= ll(u));
            found = true;
            for (int k = j; k < i; k++)
                ans.emplace_back(k);
        } else if (j > 0) {
            if (ll(values[0].val) + prefix_sum[i] - prefix_sum[j] <= ll(u)) {
                found = true;
                ans.emplace_back(0);
                for (int k = j; k < i; k++)
                    ans.emplace_back(k);
            }
        }
    }
    if (found) {    // test-driven development
        ll sum = 0;
        for (int& a : ans) {
            sum += values[a].val;
            a = values[a].pos;
        }
        assert(sum >= ll(l) && sum <= ll(u));
        return ans;
    } else {
        return std::vector<int>();
    }
}

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 1 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 1 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 1 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 1 ms 296 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 0 ms 212 KB OK (n = 12, answer = YES)
3 Correct 0 ms 212 KB OK (n = 12, answer = NO)
4 Correct 0 ms 212 KB OK (n = 12, answer = NO)
5 Correct 0 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 1 ms 212 KB OK (n = 12, answer = YES)
11 Correct 1 ms 216 KB OK (n = 100, answer = NO)
12 Correct 0 ms 212 KB OK (n = 100, answer = YES)
13 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
17 Correct 0 ms 212 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 1 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 1 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 1 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 1 ms 296 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 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 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 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 216 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 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 0 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 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 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 1 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 1 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 1 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 1 ms 296 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 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 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 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 216 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 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 0 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 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 448 KB OK (n = 10000, answer = YES)
59 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 4 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 212 KB OK (n = 865, answer = YES)
73 Correct 0 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 1 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 1 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 1 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 1 ms 296 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 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 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 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 216 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 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 0 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 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 448 KB OK (n = 10000, answer = YES)
59 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 4 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 212 KB OK (n = 865, answer = YES)
73 Correct 0 ms 212 KB OK (n = 820, answer = YES)
74 Correct 1 ms 448 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 464 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 596 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 452 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 464 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 2 ms 468 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 468 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

# 결과 실행 시간 메모리 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 1 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 1 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 1 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 1 ms 296 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 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 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 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 216 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 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 0 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 0 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 448 KB OK (n = 10000, answer = YES)
59 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 4 ms 468 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 0 ms 212 KB OK (n = 865, answer = YES)
73 Correct 0 ms 212 KB OK (n = 820, answer = YES)
74 Correct 1 ms 448 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 464 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 596 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 452 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 464 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 2 ms 468 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 468 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 0 ms 212 KB OK (n = 1, answer = YES)
95 Correct 0 ms 212 KB OK (n = 3, answer = YES)
96 Correct 0 ms 212 KB OK (n = 3, answer = NO)
97 Correct 0 ms 212 KB OK (n = 3, answer = YES)
98 Correct 27 ms 3708 KB OK (n = 150000, answer = NO)
99 Correct 36 ms 5000 KB OK (n = 200000, answer = YES)
100 Correct 50 ms 7076 KB OK (n = 200000, answer = NO)
101 Correct 38 ms 6676 KB OK (n = 200000, answer = YES)
102 Correct 43 ms 6944 KB OK (n = 200000, answer = YES)
103 Correct 42 ms 6476 KB OK (n = 200000, answer = YES)
104 Correct 30 ms 6356 KB OK (n = 200000, answer = YES)
105 Correct 39 ms 5864 KB OK (n = 200000, answer = NO)
106 Correct 42 ms 6428 KB OK (n = 200000, answer = YES)
107 Correct 51 ms 7080 KB OK (n = 200000, answer = NO)
108 Correct 36 ms 5680 KB OK (n = 200000, answer = NO)
109 Correct 37 ms 5680 KB OK (n = 200000, answer = NO)
110 Correct 28 ms 5964 KB OK (n = 200000, answer = YES)
111 Correct 33 ms 6148 KB OK (n = 200000, answer = YES)
112 Correct 24 ms 5964 KB OK (n = 200000, answer = YES)
113 Correct 29 ms 6220 KB OK (n = 200000, answer = YES)
114 Correct 27 ms 6180 KB OK (n = 200000, answer = YES)
115 Correct 29 ms 6188 KB OK (n = 200000, answer = YES)
116 Correct 28 ms 5908 KB OK (n = 200000, answer = YES)
117 Correct 42 ms 5988 KB OK (n = 200000, answer = YES)