oj.uz

답안 #632678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
632678 2022-08-20T15:11:00 Z ghostwriter Detecting Molecules (IOI16_molecules) C++14
100 / 100
 55 ms 6188 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Practising for VOI23 gold medal
*/
vi find_subset(int l, int u, vi w) {
    vpi w1;
    int pos = 0;
    EACH(i, w) w1.pb({i, pos++});
    sort(all(w1));
    int cur = 0;
    deque<int> d;
    EACH(i, w1) {
        int wi = i.st, pos = i.nd;
        // debug(1LL * cur + wi);
        if (1LL * cur + wi > u) {
            if (d.empty()) continue;
            cur -= w[d.front()];
            d._pf();
            d.pb(pos);
            cur += wi;
        }
        else {
            d.pb(pos);
            cur += wi;
        }
        if (l <= cur && cur <= u) {
            vi ans;
            EACH(j, d) ans.pb(j);
            return ans;
        }
    }
    return vi(0);
}

Compilation message

molecules.cpp: In function 'vi find_subset(int, int, vi)':
molecules.cpp:27:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
molecules.cpp:40:5: note: in expansion of macro 'EACH'
   40 |     EACH(i, w) w1.pb({i, pos++});
      |     ^~~~
molecules.cpp:27:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   27 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
molecules.cpp:44:5: note: in expansion of macro 'EACH'
   44 |     EACH(i, w1) {
      |     ^~~~
molecules.cpp:27:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   27 | #define EACH(i, x) for (auto &(i) : (x))
      |                               ^
molecules.cpp:60:13: note: in expansion of macro 'EACH'
   60 |             EACH(j, d) ans.pb(j);
      |             ^~~~

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 1 ms 300 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 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 304 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 224 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 288 KB OK (n = 12, answer = YES)
7 Correct 0 ms 212 KB OK (n = 12, answer = YES)
8 Correct 1 ms 212 KB OK (n = 12, answer = YES)
9 Correct 1 ms 212 KB OK (n = 6, answer = YES)
10 Correct 1 ms 212 KB OK (n = 12, answer = YES)
11 Correct 1 ms 212 KB OK (n = 100, answer = NO)
12 Correct 1 ms 304 KB OK (n = 100, answer = YES)
13 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
17 Correct 1 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 1 ms 300 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 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 304 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 224 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 288 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 304 KB OK (n = 100, answer = YES)
32 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 300 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 340 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 1 ms 300 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 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 304 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 224 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 288 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 304 KB OK (n = 100, answer = YES)
32 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 300 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 340 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 576 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 648 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 568 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 576 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 604 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 304 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 1 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 1 ms 300 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 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 304 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 224 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 288 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 304 KB OK (n = 100, answer = YES)
32 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 300 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 340 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 576 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 648 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 568 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 576 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 604 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 304 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
74 Correct 2 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 568 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 572 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 580 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 608 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 680 KB OK (n = 10000, answer = NO)
84 Correct 5 ms 588 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 680 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 584 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 580 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 584 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 608 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 652 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 608 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 648 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 608 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 1 ms 300 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 1 ms 212 KB OK (n = 3, answer = YES)
12 Correct 1 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 304 KB OK (n = 3, answer = YES)
15 Correct 1 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 1 ms 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 224 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 288 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 1 ms 212 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 304 KB OK (n = 100, answer = YES)
32 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 1 ms 212 KB OK (n = 100, answer = YES)
45 Correct 1 ms 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 1 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 300 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 340 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 576 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 648 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 568 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 576 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 604 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 604 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 304 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
74 Correct 2 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 568 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 572 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 580 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 608 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 680 KB OK (n = 10000, answer = NO)
84 Correct 5 ms 588 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 680 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 584 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 580 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 584 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 608 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 652 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 608 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 648 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 608 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 320 KB OK (n = 1, answer = YES)
95 Correct 1 ms 224 KB OK (n = 3, answer = YES)
96 Correct 1 ms 216 KB OK (n = 3, answer = NO)
97 Correct 0 ms 304 KB OK (n = 3, answer = YES)
98 Correct 28 ms 4440 KB OK (n = 150000, answer = NO)
99 Correct 40 ms 5552 KB OK (n = 200000, answer = YES)
100 Correct 46 ms 6188 KB OK (n = 200000, answer = NO)
101 Correct 45 ms 5404 KB OK (n = 200000, answer = YES)
102 Correct 55 ms 6016 KB OK (n = 200000, answer = YES)
103 Correct 43 ms 5536 KB OK (n = 200000, answer = YES)
104 Correct 40 ms 5416 KB OK (n = 200000, answer = YES)
105 Correct 40 ms 4964 KB OK (n = 200000, answer = NO)
106 Correct 53 ms 5220 KB OK (n = 200000, answer = YES)
107 Correct 44 ms 6168 KB OK (n = 200000, answer = NO)
108 Correct 37 ms 4924 KB OK (n = 200000, answer = NO)
109 Correct 38 ms 4992 KB OK (n = 200000, answer = NO)
110 Correct 35 ms 5040 KB OK (n = 200000, answer = YES)
111 Correct 27 ms 5168 KB OK (n = 200000, answer = YES)
112 Correct 27 ms 5080 KB OK (n = 200000, answer = YES)
113 Correct 28 ms 5160 KB OK (n = 200000, answer = YES)
114 Correct 28 ms 5184 KB OK (n = 200000, answer = YES)
115 Correct 28 ms 5164 KB OK (n = 200000, answer = YES)
116 Correct 33 ms 5028 KB OK (n = 200000, answer = YES)
117 Correct 33 ms 5036 KB OK (n = 200000, answer = YES)