oj.uz

답안 #491941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
491941 2021-12-05T08:38:58 Z TheScrasse Detecting Molecules (IOI16_molecules) C++17
100 / 100
 69 ms 11932 KB 
#include <bits/stdc++.h>
using namespace std;

#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<

#define INF (ll)1e18
#define mod 998244353
#define maxn 200010

ll i, i1, j, k, k1, t, n, m, res, flag[10], a[maxn], b;
ll l, u, ps[maxn], p[maxn], bsl, bsm, bsu;
vector<int> rs;
vector<array<ll, 2>> v;

ll rsq(ll l, ll r) {
    if (l <= 0) return -INF;
    if (r >= n + 1) return INF;
    return (ps[r] - ps[l - 1]);
}

vector<int> find_subset(int _l, int _u, vector<int> w) {
    n = w.size(); l = _l; u = _u;

    for (i = 1; i <= n; i++) v.pb({w[i - 1], i});
    sort(v.begin(), v.end());

    for (i = 1; i <= n; i++) {
        a[i] = v[i - 1][0]; p[i] = v[i - 1][1];
    }

    for (i = 1; i <= n; i++) ps[i] = ps[i - 1] + a[i];

    for (i = 1; i <= n; i++) {
        bsl = 0; bsu = n;
        while (bsl != bsu) {
            bsm = (bsl + bsu) / 2;
            if (rsq(bsm, bsm + i - 1) >= l) bsu = bsm;
            else bsl = bsm + 1;
        }

        k = rsq(bsl, bsl + i - 1);
        if (k < l || k > u) continue;
        for (j = bsl; j <= bsl + i - 1; j++) rs.pb(p[j] - 1);
        return rs;
    }

    return rs;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 1 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 ms 204 KB OK (n = 2, answer = YES)
5 Correct 1 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 296 KB OK (n = 3, answer = YES)
7 Correct 1 ms 204 KB OK (n = 3, answer = YES)
8 Correct 1 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 1 ms 300 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 1 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 300 KB OK (n = 12, answer = YES)
22 Correct 1 ms 204 KB OK (n = 12, answer = NO)
23 Correct 1 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 1 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 ms 204 KB OK (n = 6, answer = YES)
29 Correct 0 ms 296 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 332 KB OK (n = 100, answer = YES)
32 Correct 0 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 1 ms 204 KB OK (n = 100, answer = YES)
35 Correct 0 ms 204 KB OK (n = 100, answer = YES)
36 Correct 0 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 ms 204 KB OK (n = 100, answer = YES)
41 Correct 1 ms 204 KB OK (n = 100, answer = YES)
42 Correct 1 ms 204 KB OK (n = 10, answer = YES)
43 Correct 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 216 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 296 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 0 ms 204 KB OK (n = 100, answer = YES)
51 Correct 0 ms 204 KB OK (n = 100, answer = YES)
52 Correct 0 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 840 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 840 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 968 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
59 Correct 4 ms 840 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 968 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 968 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 968 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 952 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 840 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 840 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 840 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 840 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 840 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 968 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 948 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 840 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 332 KB OK (n = 865, answer = YES)
73 Correct 1 ms 332 KB OK (n = 820, answer = YES)
74 Correct 2 ms 716 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 840 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 840 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 840 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 840 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 968 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 968 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 968 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 968 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 840 KB OK (n = 10000, answer = YES)
85 Correct 4 ms 968 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
88 Correct 4 ms 968 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 968 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 840 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 840 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 840 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 840 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 204 KB OK (n = 1, answer = YES)
95 Correct 0 ms 204 KB OK (n = 3, answer = YES)
96 Correct 0 ms 204 KB OK (n = 3, answer = NO)
97 Correct 0 ms 204 KB OK (n = 3, answer = YES)
98 Correct 43 ms 8220 KB OK (n = 150000, answer = NO)
99 Correct 69 ms 11308 KB OK (n = 200000, answer = YES)
100 Correct 57 ms 11896 KB OK (n = 200000, answer = NO)
101 Correct 50 ms 11356 KB OK (n = 200000, answer = YES)
102 Correct 48 ms 11824 KB OK (n = 200000, answer = YES)
103 Correct 49 ms 11288 KB OK (n = 200000, answer = YES)
104 Correct 50 ms 11128 KB OK (n = 200000, answer = YES)
105 Correct 60 ms 10516 KB OK (n = 200000, answer = NO)
106 Correct 52 ms 11140 KB OK (n = 200000, answer = YES)
107 Correct 52 ms 11932 KB OK (n = 200000, answer = NO)
108 Correct 56 ms 10520 KB OK (n = 200000, answer = NO)
109 Correct 64 ms 10604 KB OK (n = 200000, answer = NO)
110 Correct 41 ms 10716 KB OK (n = 200000, answer = YES)
111 Correct 36 ms 10908 KB OK (n = 200000, answer = YES)
112 Correct 36 ms 10948 KB OK (n = 200000, answer = YES)
113 Correct 37 ms 10904 KB OK (n = 200000, answer = YES)
114 Correct 36 ms 10904 KB OK (n = 200000, answer = YES)
115 Correct 38 ms 10904 KB OK (n = 200000, answer = YES)
116 Correct 62 ms 10728 KB OK (n = 200000, answer = YES)
117 Correct 45 ms 10744 KB OK (n = 200000, answer = YES)