oj.uz

Submission #98964

# Submission time Handle Problem Language Result Execution time Memory
98964 2019-02-27T19:06:44 Z eriksuenderhauf Detecting Molecules (IOI16_molecules) C++11
100 / 100
 97 ms 8056 KB 
//#pragma GCC optimize("O3")
//#include "grader.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
ll pre[MAXN], suf[MAXN];
int ind[MAXN];

vector<int> find_subset(int l, int u, vector<int> w) {
    int r = 0, n = w.size();
    r = n - 1;
    for (int i = 0; i < n; i++) ind[i] = i;
    sort(ind, ind + n, [&w](int l, int r) -> bool {
        if (w[l] == w[r])
            return l < r;
        return w[l] < w[r];
    });
    sort(w.begin(), w.end());
    pre[0] = w[0], suf[n - 1] = w[n - 1];
    if (l <= w[0] && w[0] <= u)
        return {ind[0]};
    if (l <= w[n-1] && w[n-1] <= u)
        return {ind[n-1]};
    vector<int> ans;
    for (int i = 1; i < n; i++) {
        if (l <= w[i] && w[i] <= u)
            return {ind[i]};
        pre[i] = pre[i - 1] + (ll) w[i], suf[n - i - 1] = suf[n - i] + (ll) w[n - i - 1];
        if (l <= pre[i] && pre[i] <= u) {
            for (int j = 0; j <= i; j++)
                ans.pb(ind[j]);
            return ans;
        }
        if (l <= suf[n - i - 1] && suf[n - i - 1] <= u) {
            for (int j = n - 1; j >= n - i - 1; j--)
                ans.pb(ind[j]);
            return ans;
        }
    }
    for (int i = n - 2; i >= 0; i--) {
        while (r  - 1 > i && pre[i] + suf[r] < l) r--;
        if (l <= pre[i] + suf[r] && pre[i] + suf[r] <= u) {
            for (int j = 0; j <= i; j++)
                ans.pb(ind[j]);
            for (int j = n - 1; j >= r; j--)
                ans.pb(ind[j]);
            return ans;
        }
    }
    return {};
}

/*int main()
{
    vector<int> ans = solve(10, 20, {15, 17, 16, 18});
    for (int i: ans)
        printf("%d ", i);
    printf("\n");
    return 0;
}*/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 3 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Correct 3 ms 384 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 384 KB OK (n = 3, answer = YES)
7 Correct 2 ms 384 KB OK (n = 3, answer = YES)
8 Correct 2 ms 384 KB OK (n = 3, answer = YES)
9 Correct 2 ms 384 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 384 KB OK (n = 3, answer = YES)
12 Correct 2 ms 384 KB OK (n = 3, answer = YES)
13 Correct 2 ms 384 KB OK (n = 3, answer = NO)
14 Correct 2 ms 384 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 384 KB OK (n = 3, answer = NO)
17 Correct 2 ms 384 KB OK (n = 3, answer = NO)
18 Correct 2 ms 384 KB OK (n = 100, answer = NO)
19 Correct 3 ms 384 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB OK (n = 12, answer = YES)
2 Correct 2 ms 384 KB OK (n = 12, answer = YES)
3 Correct 2 ms 384 KB OK (n = 12, answer = NO)
4 Correct 2 ms 384 KB OK (n = 12, answer = NO)
5 Correct 2 ms 384 KB OK (n = 12, answer = YES)
6 Correct 2 ms 384 KB OK (n = 12, answer = YES)
7 Correct 2 ms 384 KB OK (n = 12, answer = YES)
8 Correct 2 ms 384 KB OK (n = 12, answer = YES)
9 Correct 2 ms 384 KB OK (n = 6, answer = YES)
10 Correct 2 ms 384 KB OK (n = 12, answer = YES)
11 Correct 2 ms 384 KB OK (n = 100, answer = NO)
12 Correct 2 ms 384 KB OK (n = 100, answer = YES)
13 Correct 2 ms 384 KB OK (n = 100, answer = NO)
14 Correct 2 ms 384 KB OK (n = 100, answer = YES)
15 Correct 2 ms 384 KB OK (n = 100, answer = YES)
16 Correct 2 ms 384 KB OK (n = 100, answer = YES)
17 Correct 3 ms 384 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 3 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Correct 3 ms 384 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 384 KB OK (n = 3, answer = YES)
7 Correct 2 ms 384 KB OK (n = 3, answer = YES)
8 Correct 2 ms 384 KB OK (n = 3, answer = YES)
9 Correct 2 ms 384 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 384 KB OK (n = 3, answer = YES)
12 Correct 2 ms 384 KB OK (n = 3, answer = YES)
13 Correct 2 ms 384 KB OK (n = 3, answer = NO)
14 Correct 2 ms 384 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 384 KB OK (n = 3, answer = NO)
17 Correct 2 ms 384 KB OK (n = 3, answer = NO)
18 Correct 2 ms 384 KB OK (n = 100, answer = NO)
19 Correct 3 ms 384 KB OK (n = 100, answer = YES)
20 Correct 2 ms 384 KB OK (n = 12, answer = YES)
21 Correct 2 ms 384 KB OK (n = 12, answer = YES)
22 Correct 2 ms 384 KB OK (n = 12, answer = NO)
23 Correct 2 ms 384 KB OK (n = 12, answer = NO)
24 Correct 2 ms 384 KB OK (n = 12, answer = YES)
25 Correct 2 ms 384 KB OK (n = 12, answer = YES)
26 Correct 2 ms 384 KB OK (n = 12, answer = YES)
27 Correct 2 ms 384 KB OK (n = 12, answer = YES)
28 Correct 2 ms 384 KB OK (n = 6, answer = YES)
29 Correct 2 ms 384 KB OK (n = 12, answer = YES)
30 Correct 2 ms 384 KB OK (n = 100, answer = NO)
31 Correct 2 ms 384 KB OK (n = 100, answer = YES)
32 Correct 2 ms 384 KB OK (n = 100, answer = NO)
33 Correct 2 ms 384 KB OK (n = 100, answer = YES)
34 Correct 2 ms 384 KB OK (n = 100, answer = YES)
35 Correct 2 ms 384 KB OK (n = 100, answer = YES)
36 Correct 3 ms 384 KB OK (n = 100, answer = YES)
37 Correct 2 ms 384 KB OK (n = 28, answer = YES)
38 Correct 2 ms 384 KB OK (n = 27, answer = YES)
39 Correct 2 ms 384 KB OK (n = 90, answer = YES)
40 Correct 2 ms 384 KB OK (n = 100, answer = YES)
41 Correct 3 ms 384 KB OK (n = 100, answer = YES)
42 Correct 2 ms 384 KB OK (n = 10, answer = YES)
43 Correct 2 ms 384 KB OK (n = 100, answer = YES)
44 Correct 2 ms 384 KB OK (n = 100, answer = YES)
45 Correct 3 ms 384 KB OK (n = 100, answer = YES)
46 Correct 2 ms 384 KB OK (n = 100, answer = YES)
47 Correct 2 ms 384 KB OK (n = 100, answer = NO)
48 Correct 2 ms 384 KB OK (n = 100, answer = NO)
49 Correct 2 ms 384 KB OK (n = 100, answer = NO)
50 Correct 2 ms 384 KB OK (n = 100, answer = YES)
51 Correct 2 ms 384 KB OK (n = 100, answer = YES)
52 Correct 2 ms 384 KB OK (n = 100, answer = YES)
53 Correct 2 ms 384 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 428 KB OK (n = 10000, answer = YES)
57 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 7 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
63 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
64 Correct 6 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
66 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
67 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
69 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
70 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
71 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 384 KB OK (n = 865, answer = YES)
73 Correct 2 ms 384 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 3 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Correct 3 ms 384 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 384 KB OK (n = 3, answer = YES)
7 Correct 2 ms 384 KB OK (n = 3, answer = YES)
8 Correct 2 ms 384 KB OK (n = 3, answer = YES)
9 Correct 2 ms 384 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 384 KB OK (n = 3, answer = YES)
12 Correct 2 ms 384 KB OK (n = 3, answer = YES)
13 Correct 2 ms 384 KB OK (n = 3, answer = NO)
14 Correct 2 ms 384 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 384 KB OK (n = 3, answer = NO)
17 Correct 2 ms 384 KB OK (n = 3, answer = NO)
18 Correct 2 ms 384 KB OK (n = 100, answer = NO)
19 Correct 3 ms 384 KB OK (n = 100, answer = YES)
20 Correct 2 ms 384 KB OK (n = 12, answer = YES)
21 Correct 2 ms 384 KB OK (n = 12, answer = YES)
22 Correct 2 ms 384 KB OK (n = 12, answer = NO)
23 Correct 2 ms 384 KB OK (n = 12, answer = NO)
24 Correct 2 ms 384 KB OK (n = 12, answer = YES)
25 Correct 2 ms 384 KB OK (n = 12, answer = YES)
26 Correct 2 ms 384 KB OK (n = 12, answer = YES)
27 Correct 2 ms 384 KB OK (n = 12, answer = YES)
28 Correct 2 ms 384 KB OK (n = 6, answer = YES)
29 Correct 2 ms 384 KB OK (n = 12, answer = YES)
30 Correct 2 ms 384 KB OK (n = 100, answer = NO)
31 Correct 2 ms 384 KB OK (n = 100, answer = YES)
32 Correct 2 ms 384 KB OK (n = 100, answer = NO)
33 Correct 2 ms 384 KB OK (n = 100, answer = YES)
34 Correct 2 ms 384 KB OK (n = 100, answer = YES)
35 Correct 2 ms 384 KB OK (n = 100, answer = YES)
36 Correct 3 ms 384 KB OK (n = 100, answer = YES)
37 Correct 2 ms 384 KB OK (n = 28, answer = YES)
38 Correct 2 ms 384 KB OK (n = 27, answer = YES)
39 Correct 2 ms 384 KB OK (n = 90, answer = YES)
40 Correct 2 ms 384 KB OK (n = 100, answer = YES)
41 Correct 3 ms 384 KB OK (n = 100, answer = YES)
42 Correct 2 ms 384 KB OK (n = 10, answer = YES)
43 Correct 2 ms 384 KB OK (n = 100, answer = YES)
44 Correct 2 ms 384 KB OK (n = 100, answer = YES)
45 Correct 3 ms 384 KB OK (n = 100, answer = YES)
46 Correct 2 ms 384 KB OK (n = 100, answer = YES)
47 Correct 2 ms 384 KB OK (n = 100, answer = NO)
48 Correct 2 ms 384 KB OK (n = 100, answer = NO)
49 Correct 2 ms 384 KB OK (n = 100, answer = NO)
50 Correct 2 ms 384 KB OK (n = 100, answer = YES)
51 Correct 2 ms 384 KB OK (n = 100, answer = YES)
52 Correct 2 ms 384 KB OK (n = 100, answer = YES)
53 Correct 2 ms 384 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 428 KB OK (n = 10000, answer = YES)
57 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 7 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
63 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
64 Correct 6 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
66 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
67 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
69 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
70 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
71 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 384 KB OK (n = 865, answer = YES)
73 Correct 2 ms 384 KB OK (n = 820, answer = YES)
74 Correct 4 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 560 KB OK (n = 10000, answer = NO)
76 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
77 Correct 7 ms 640 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
79 Correct 6 ms 768 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 484 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
83 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
84 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
85 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
86 Correct 6 ms 512 KB OK (n = 10000, answer = YES)
87 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
89 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
90 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 6 ms 512 KB OK (n = 10000, answer = YES)
92 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 640 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB OK (n = 1, answer = NO)
2 Correct 3 ms 384 KB OK (n = 1, answer = NO)
3 Correct 2 ms 384 KB OK (n = 1, answer = YES)
4 Correct 3 ms 384 KB OK (n = 2, answer = YES)
5 Correct 2 ms 384 KB OK (n = 2, answer = YES)
6 Correct 2 ms 384 KB OK (n = 3, answer = YES)
7 Correct 2 ms 384 KB OK (n = 3, answer = YES)
8 Correct 2 ms 384 KB OK (n = 3, answer = YES)
9 Correct 2 ms 384 KB OK (n = 3, answer = YES)
10 Correct 2 ms 384 KB OK (n = 3, answer = YES)
11 Correct 2 ms 384 KB OK (n = 3, answer = YES)
12 Correct 2 ms 384 KB OK (n = 3, answer = YES)
13 Correct 2 ms 384 KB OK (n = 3, answer = NO)
14 Correct 2 ms 384 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 384 KB OK (n = 3, answer = NO)
17 Correct 2 ms 384 KB OK (n = 3, answer = NO)
18 Correct 2 ms 384 KB OK (n = 100, answer = NO)
19 Correct 3 ms 384 KB OK (n = 100, answer = YES)
20 Correct 2 ms 384 KB OK (n = 12, answer = YES)
21 Correct 2 ms 384 KB OK (n = 12, answer = YES)
22 Correct 2 ms 384 KB OK (n = 12, answer = NO)
23 Correct 2 ms 384 KB OK (n = 12, answer = NO)
24 Correct 2 ms 384 KB OK (n = 12, answer = YES)
25 Correct 2 ms 384 KB OK (n = 12, answer = YES)
26 Correct 2 ms 384 KB OK (n = 12, answer = YES)
27 Correct 2 ms 384 KB OK (n = 12, answer = YES)
28 Correct 2 ms 384 KB OK (n = 6, answer = YES)
29 Correct 2 ms 384 KB OK (n = 12, answer = YES)
30 Correct 2 ms 384 KB OK (n = 100, answer = NO)
31 Correct 2 ms 384 KB OK (n = 100, answer = YES)
32 Correct 2 ms 384 KB OK (n = 100, answer = NO)
33 Correct 2 ms 384 KB OK (n = 100, answer = YES)
34 Correct 2 ms 384 KB OK (n = 100, answer = YES)
35 Correct 2 ms 384 KB OK (n = 100, answer = YES)
36 Correct 3 ms 384 KB OK (n = 100, answer = YES)
37 Correct 2 ms 384 KB OK (n = 28, answer = YES)
38 Correct 2 ms 384 KB OK (n = 27, answer = YES)
39 Correct 2 ms 384 KB OK (n = 90, answer = YES)
40 Correct 2 ms 384 KB OK (n = 100, answer = YES)
41 Correct 3 ms 384 KB OK (n = 100, answer = YES)
42 Correct 2 ms 384 KB OK (n = 10, answer = YES)
43 Correct 2 ms 384 KB OK (n = 100, answer = YES)
44 Correct 2 ms 384 KB OK (n = 100, answer = YES)
45 Correct 3 ms 384 KB OK (n = 100, answer = YES)
46 Correct 2 ms 384 KB OK (n = 100, answer = YES)
47 Correct 2 ms 384 KB OK (n = 100, answer = NO)
48 Correct 2 ms 384 KB OK (n = 100, answer = NO)
49 Correct 2 ms 384 KB OK (n = 100, answer = NO)
50 Correct 2 ms 384 KB OK (n = 100, answer = YES)
51 Correct 2 ms 384 KB OK (n = 100, answer = YES)
52 Correct 2 ms 384 KB OK (n = 100, answer = YES)
53 Correct 2 ms 384 KB OK (n = 100, answer = YES)
54 Correct 2 ms 384 KB OK (n = 100, answer = YES)
55 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 428 KB OK (n = 10000, answer = YES)
57 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
61 Correct 7 ms 640 KB OK (n = 10000, answer = NO)
62 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
63 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
64 Correct 6 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
66 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
67 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
69 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
70 Correct 4 ms 512 KB OK (n = 10000, answer = YES)
71 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 2 ms 384 KB OK (n = 865, answer = YES)
73 Correct 2 ms 384 KB OK (n = 820, answer = YES)
74 Correct 4 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 560 KB OK (n = 10000, answer = NO)
76 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
77 Correct 7 ms 640 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
79 Correct 6 ms 768 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 484 KB OK (n = 10000, answer = YES)
81 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
83 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
84 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
85 Correct 5 ms 640 KB OK (n = 10000, answer = NO)
86 Correct 6 ms 512 KB OK (n = 10000, answer = YES)
87 Correct 5 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 7 ms 512 KB OK (n = 10000, answer = YES)
89 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
90 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 6 ms 512 KB OK (n = 10000, answer = YES)
92 Correct 5 ms 512 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
94 Correct 2 ms 384 KB OK (n = 1, answer = YES)
95 Correct 2 ms 384 KB OK (n = 3, answer = YES)
96 Correct 2 ms 384 KB OK (n = 3, answer = NO)
97 Correct 2 ms 384 KB OK (n = 3, answer = YES)
98 Correct 39 ms 5368 KB OK (n = 150000, answer = NO)
99 Correct 70 ms 7420 KB OK (n = 200000, answer = YES)
100 Correct 74 ms 8056 KB OK (n = 200000, answer = NO)
101 Correct 76 ms 7416 KB OK (n = 200000, answer = YES)
102 Correct 81 ms 4728 KB OK (n = 200000, answer = YES)
103 Correct 93 ms 4344 KB OK (n = 200000, answer = YES)
104 Correct 59 ms 4088 KB OK (n = 200000, answer = YES)
105 Correct 88 ms 6644 KB OK (n = 200000, answer = NO)
106 Correct 97 ms 4480 KB OK (n = 200000, answer = YES)
107 Correct 85 ms 7928 KB OK (n = 200000, answer = NO)
108 Correct 90 ms 6640 KB OK (n = 200000, answer = NO)
109 Correct 62 ms 6648 KB OK (n = 200000, answer = NO)
110 Correct 68 ms 3716 KB OK (n = 200000, answer = YES)
111 Correct 36 ms 7032 KB OK (n = 200000, answer = YES)
112 Correct 38 ms 6904 KB OK (n = 200000, answer = YES)
113 Correct 44 ms 4260 KB OK (n = 200000, answer = YES)
114 Correct 35 ms 4216 KB OK (n = 200000, answer = YES)
115 Correct 46 ms 7160 KB OK (n = 200000, answer = YES)
116 Correct 53 ms 3700 KB OK (n = 200000, answer = YES)
117 Correct 44 ms 3704 KB OK (n = 200000, answer = YES)