oj.uz

답안 #297852

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
297852 2020-09-12T05:03:05 Z kevlee Detecting Molecules (IOI16_molecules) C++17
100 / 100
 129 ms 12920 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a))
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
pii a[200005];
vector<int> find_subset(int l, int u, vector<int> w) {
  vi ret;
  int n = 0;
  for (int weight: w) {
    a[n] = {weight, n};
    n++;
  }
  sort(a, a + n);
  set <ll> s;
  ll sum = 0;
  s.insert(0);
  FOR(i, 0, n-1) {
    sum += a[i].fi;
    auto it = s.lower_bound(sum - u);
    ll num = 0;
    if (it != s.end()) {
      num = *it;
    }
    //cerr << sum << ' ' << num << endl;
    if (sum - num >= l && sum - num <= u) {
      ll cursum = 0;
      FORD(j, i, 0) {
        cursum += a[j].fi;
        ret.pb(a[j].se);
        if (cursum >= l) return ret;
      }
    }
    s.insert(sum);
  }
  return ret;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 1, answer = NO)
2 Correct 0 ms 256 KB OK (n = 1, answer = NO)
3 Correct 0 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 384 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 1 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 ms 256 KB OK (n = 100, answer = NO)
19 Correct 0 ms 256 KB OK (n = 100, answer = YES)
20 Correct 1 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 1 ms 256 KB OK (n = 12, answer = NO)
24 Correct 1 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 256 KB OK (n = 12, answer = YES)
30 Correct 0 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 1 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 384 KB OK (n = 100, answer = YES)
35 Correct 0 ms 256 KB OK (n = 100, answer = YES)
36 Correct 0 ms 384 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 0 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 384 KB OK (n = 100, answer = YES)
45 Correct 1 ms 256 KB OK (n = 100, answer = YES)
46 Correct 0 ms 256 KB OK (n = 100, answer = YES)
47 Correct 1 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 0 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 0 ms 384 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 0 ms 384 KB OK (n = 100, answer = YES)
54 Correct 0 ms 384 KB OK (n = 100, answer = YES)
55 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
61 Correct 5 ms 896 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
63 Correct 5 ms 896 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
71 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
74 Correct 3 ms 768 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 896 KB OK (n = 10000, answer = NO)
76 Correct 5 ms 896 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 896 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 896 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 768 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
82 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
83 Correct 5 ms 896 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
85 Correct 5 ms 896 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 768 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 640 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 512 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
90 Correct 4 ms 896 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 512 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 256 KB OK (n = 1, answer = YES)
95 Correct 0 ms 256 KB OK (n = 3, answer = YES)
96 Correct 1 ms 256 KB OK (n = 3, answer = NO)
97 Correct 0 ms 256 KB OK (n = 3, answer = YES)
98 Correct 74 ms 9720 KB OK (n = 150000, answer = NO)
99 Correct 66 ms 5624 KB OK (n = 200000, answer = YES)
100 Correct 129 ms 12920 KB OK (n = 200000, answer = NO)
101 Correct 61 ms 4728 KB OK (n = 200000, answer = YES)
102 Correct 60 ms 3448 KB OK (n = 200000, answer = YES)
103 Correct 52 ms 3448 KB OK (n = 200000, answer = YES)
104 Correct 109 ms 12024 KB OK (n = 200000, answer = YES)
105 Correct 104 ms 12808 KB OK (n = 200000, answer = NO)
106 Correct 64 ms 5112 KB OK (n = 200000, answer = YES)
107 Correct 124 ms 12792 KB OK (n = 200000, answer = NO)
108 Correct 100 ms 12792 KB OK (n = 200000, answer = NO)
109 Correct 101 ms 12800 KB OK (n = 200000, answer = NO)
110 Correct 43 ms 3448 KB OK (n = 200000, answer = YES)
111 Correct 40 ms 4472 KB OK (n = 200000, answer = YES)
112 Correct 90 ms 11900 KB OK (n = 200000, answer = YES)
113 Correct 38 ms 4344 KB OK (n = 200000, answer = YES)
114 Correct 72 ms 8952 KB OK (n = 200000, answer = YES)
115 Correct 66 ms 8588 KB OK (n = 200000, answer = YES)
116 Correct 107 ms 12792 KB OK (n = 200000, answer = YES)
117 Correct 45 ms 3456 KB OK (n = 200000, answer = YES)