oj.uz

답안 #567896

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
567896 2022-05-24T10:11:00 Z ngpin04 Detecting Molecules (IOI16_molecules) C++17
100 / 100
 53 ms 6964 KB 
#include "molecules.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define TASK ""
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end() 
using namespace std;
template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}
const int N = 1e5 + 5; 
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 1e9 + 7; // 998244353;
const long double pi = acos(-1);

vector <int> solve(int cnt, int l, int r, vector <int> w, vector <int> ind) {
    int n = w.size();
    vector <int> used(n, 0);
    
    int tot = 0;
    for (int i = 0; i < cnt; i++) {
        used[i] = true;
        tot += w[ind[i]];
        // cerr << ind[i] << " ";
    }

    for (int i = cnt - 1, las = n; i >= 0; i--) {
        if (tot >= l)
            break;
        int lo = i;
        int hi = las;
        while (hi - lo > 1) {
            int mid = (lo + hi) >> 1;
            int dif = w[ind[mid]] - w[ind[i]];
            if ((long long) tot + dif <= r)
                lo = mid;
            else
                hi = mid;
        }
        int dif = w[ind[lo]] - w[ind[i]];

        las = lo;
        tot += dif;
        used[i] = false;
        used[lo] = true;
    }

    vector <int> res;
    for (int i = 0; i < n; i++)
        if (used[i])
            res.push_back(ind[i]);
    return res;
}

vector<int> find_subset(int l, int u, vector<int> w) {
    if (accumulate(ALL(w), 0LL) < l || *min_element(ALL(w)) > u) 
        return vector <int> (0);

    int n = w.size();
    vector <int> ind(n, 0);
    iota(ALL(ind), 0);
    sort(ALL(ind), [&](int i, int j) {
        return w[i] < w[j];
    });

    long long pre = 0, suf = 0;
    for (int cnt = 1; cnt <= n; cnt++) {
        pre += w[ind[cnt - 1]];
        suf += w[ind[n - cnt]];
        if (pre > u)
            break;
        if (suf < l)
            continue;
        // cerr << cnt << " " << pre << " " << suf << "\n";
        return solve(cnt, l, u, w, ind);
    }

    return vector <int> (0);
}

//#include "grader.cpp"

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 1 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 1 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 1 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 1 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 1 ms 212 KB OK (n = 100, answer = NO)
12 Correct 0 ms 212 KB OK (n = 100, answer = YES)
13 Correct 1 ms 212 KB OK (n = 100, answer = NO)
14 Correct 0 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 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 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 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 1 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 1 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 1 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 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 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 292 KB OK (n = 100, answer = NO)
50 Correct 0 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 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 1 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 1 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 1 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 1 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 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 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 292 KB OK (n = 100, answer = NO)
50 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 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 1 ms 516 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 3 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 340 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 340 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 2 ms 468 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 1 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

# 결과 실행 시간 메모리 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 1 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 1 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 1 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 1 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 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 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 292 KB OK (n = 100, answer = NO)
50 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 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 1 ms 516 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 3 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 340 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 340 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 2 ms 468 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 1 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 1 ms 340 KB OK (n = 10000, answer = NO)
76 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
77 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
78 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 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 340 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 464 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 468 KB OK (n = 10000, answer = YES)
92 Correct 2 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 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 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 1 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 1 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 1 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 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 1 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 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 292 KB OK (n = 100, answer = NO)
50 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 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 1 ms 516 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 3 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 340 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 340 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 2 ms 468 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 1 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 1 ms 340 KB OK (n = 10000, answer = NO)
76 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
77 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
78 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 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 340 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 464 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 468 KB OK (n = 10000, answer = YES)
92 Correct 2 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 212 KB OK (n = 3, answer = YES)
96 Correct 0 ms 212 KB OK (n = 3, answer = NO)
97 Correct 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 16 ms 1412 KB OK (n = 150000, answer = NO)
99 Correct 36 ms 4944 KB OK (n = 200000, answer = YES)
100 Correct 43 ms 4796 KB OK (n = 200000, answer = NO)
101 Correct 47 ms 6572 KB OK (n = 200000, answer = YES)
102 Correct 49 ms 6964 KB OK (n = 200000, answer = YES)
103 Correct 32 ms 6452 KB OK (n = 200000, answer = YES)
104 Correct 29 ms 6316 KB OK (n = 200000, answer = YES)
105 Correct 20 ms 2608 KB OK (n = 200000, answer = NO)
106 Correct 53 ms 6348 KB OK (n = 200000, answer = YES)
107 Correct 27 ms 4008 KB OK (n = 200000, answer = NO)
108 Correct 16 ms 2608 KB OK (n = 200000, answer = NO)
109 Correct 18 ms 2620 KB OK (n = 200000, answer = NO)
110 Correct 28 ms 5912 KB OK (n = 200000, answer = YES)
111 Correct 30 ms 6092 KB OK (n = 200000, answer = YES)
112 Correct 23 ms 6060 KB OK (n = 200000, answer = YES)
113 Correct 24 ms 6224 KB OK (n = 200000, answer = YES)
114 Correct 25 ms 6184 KB OK (n = 200000, answer = YES)
115 Correct 39 ms 6252 KB OK (n = 200000, answer = YES)
116 Correct 24 ms 5964 KB OK (n = 200000, answer = YES)
117 Correct 22 ms 5936 KB OK (n = 200000, answer = YES)