oj.uz

Submission #319298

# Submission time Handle Problem Language Result Execution time Memory
319298 2020-11-04T16:00:20 Z VROOM_VARUN Detecting Molecules (IOI16_molecules) C++14
100 / 100
 58 ms 6376 KB 
/*
ID: varunra2
LANG: C++
TASK: molecules
*/

#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

VII vals;

VI get(deque<int>& dq) {
  VI ret;
  while (!dq.empty()) {
    ret.PB(dq.back());
    dq.pop_back();
  }
  sort(all(ret));
  return ret;
}

VI find_subset(int l, int u, VI w) {
  int n = sz(w);
  vals.resize(n);
  for (int i = 0; i < n; i++) {
    vals[i] = MP(w[i], i);
  }
  sort(all(vals));
  int p1 = 0, p2 = 0;
  ll sum = 0;
  deque<int> dq;
  while (p1 < n) {
    while (p2 < n and sum + vals[p2].x <= u)
      sum += vals[p2].x, dq.PB(vals[p2++].y);
    // debug(sum);
    // debug(p1, p2);
    if (sum >= l) {
      return get(dq);
    }
    sum -= vals[p1].x;
    dq.pop_front();
    p1++;
  }
  return {};
}

// int main() {
// #ifndef ONLINE_JUDGE
//   freopen("molecules.in", "r", stdin);
//   freopen("molecules.out", "w", stdout);
// #endif
//   cin.sync_with_stdio(0);
//   cin.tie(0);

//   int n, l, r;
//   cin >> n >> l >> r;
//   VI vals(n);
//   for (int i = 0; i < n; i++) {
//     cin >> vals[i];
//   }

//   auto x = find_subset(l, r, vals);

//   int sum = 0;
//   trav(xx, x) sum += vals[xx];

//   cout << sum << '\n';

//   return 0;
// }

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 0 ms 352 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 492 KB OK (n = 2, answer = YES)
6 Correct 1 ms 416 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 448 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 1 ms 364 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 364 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 ms 364 KB OK (n = 12, answer = NO)
24 Correct 1 ms 364 KB OK (n = 12, answer = YES)
25 Correct 1 ms 364 KB OK (n = 12, answer = YES)
26 Correct 1 ms 364 KB OK (n = 12, answer = YES)
27 Correct 1 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 364 KB OK (n = 6, answer = YES)
29 Correct 1 ms 364 KB OK (n = 12, answer = YES)
30 Correct 1 ms 384 KB OK (n = 100, answer = NO)
31 Correct 1 ms 364 KB OK (n = 100, answer = YES)
32 Correct 1 ms 364 KB OK (n = 100, answer = NO)
33 Correct 1 ms 364 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 364 KB OK (n = 100, answer = YES)
36 Correct 1 ms 364 KB OK (n = 100, answer = YES)
37 Correct 1 ms 396 KB OK (n = 28, answer = YES)
38 Correct 1 ms 364 KB OK (n = 27, answer = YES)
39 Correct 1 ms 384 KB OK (n = 90, answer = YES)
40 Correct 1 ms 364 KB OK (n = 100, answer = YES)
41 Correct 1 ms 364 KB OK (n = 100, answer = YES)
42 Correct 1 ms 364 KB OK (n = 10, answer = YES)
43 Correct 1 ms 364 KB OK (n = 100, answer = YES)
44 Correct 1 ms 364 KB OK (n = 100, answer = YES)
45 Correct 1 ms 364 KB OK (n = 100, answer = YES)
46 Correct 1 ms 364 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 364 KB OK (n = 100, answer = NO)
49 Correct 1 ms 364 KB OK (n = 100, answer = NO)
50 Correct 1 ms 364 KB OK (n = 100, answer = YES)
51 Correct 1 ms 364 KB OK (n = 100, answer = YES)
52 Correct 1 ms 364 KB OK (n = 100, answer = YES)
53 Correct 1 ms 364 KB OK (n = 100, answer = YES)
54 Correct 1 ms 364 KB OK (n = 100, answer = YES)
55 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 364 KB OK (n = 865, answer = YES)
73 Correct 1 ms 364 KB OK (n = 820, answer = YES)
74 Correct 2 ms 620 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
76 Correct 4 ms 524 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 620 KB OK (n = 10000, answer = YES)
80 Correct 4 ms 492 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 492 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 620 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 492 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 364 KB OK (n = 1, answer = YES)
95 Correct 1 ms 364 KB OK (n = 3, answer = YES)
96 Correct 1 ms 364 KB OK (n = 3, answer = NO)
97 Correct 1 ms 364 KB OK (n = 3, answer = YES)
98 Correct 37 ms 4196 KB OK (n = 150000, answer = NO)
99 Correct 53 ms 5096 KB OK (n = 200000, answer = YES)
100 Correct 57 ms 5604 KB OK (n = 200000, answer = NO)
101 Correct 58 ms 5092 KB OK (n = 200000, answer = YES)
102 Correct 54 ms 5476 KB OK (n = 200000, answer = YES)
103 Correct 53 ms 5092 KB OK (n = 200000, answer = YES)
104 Correct 52 ms 4836 KB OK (n = 200000, answer = YES)
105 Correct 49 ms 5216 KB OK (n = 200000, answer = NO)
106 Correct 58 ms 5092 KB OK (n = 200000, answer = YES)
107 Correct 54 ms 6376 KB OK (n = 200000, answer = NO)
108 Correct 50 ms 5088 KB OK (n = 200000, answer = NO)
109 Correct 48 ms 5220 KB OK (n = 200000, answer = NO)
110 Correct 43 ms 4452 KB OK (n = 200000, answer = YES)
111 Correct 34 ms 4580 KB OK (n = 200000, answer = YES)
112 Correct 34 ms 4588 KB OK (n = 200000, answer = YES)
113 Correct 36 ms 4844 KB OK (n = 200000, answer = YES)
114 Correct 37 ms 4964 KB OK (n = 200000, answer = YES)
115 Correct 37 ms 4836 KB OK (n = 200000, answer = YES)
116 Correct 47 ms 4596 KB OK (n = 200000, answer = YES)
117 Correct 44 ms 4580 KB OK (n = 200000, answer = YES)