oj.uz

답안 #549931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
549931 2022-04-16T21:05:14 Z Bogdan1110 Detecting Molecules (IOI16_molecules) C++14
100 / 100
 44 ms 7152 KB 
#include <bits/stdc++.h>
#define FAST {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fi first
#define se second
#define ld long double
#define pii pair<int,int>
#define pll pair<long long,long long>
#define all(a) (a).begin(), (a).end()
#define mp make_pair 
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
// order_of_key -> # less than k
// find_by_order -> k-th element
// pq max element

void files() {
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
}

const double eps = 0.00000001;
const int NMAX = 200010;
const ll inf = LLONG_MAX/2;
const ll modi = 1e9+7;

vector<int> find_subset(int l, int r, vector<int>w) {
    int n = w.size();
    vector<pll>v(n);
    for (int i = 0 ; i < n ; i++ ) {
        v[i] = {w[i],i};
    }
    sort(all(v));
    int L = 0, R = 0;
    ll sum = 0;
    vector<int>ans;
    while(true) {
        //cout << L << ' ' << R << endl;
        if ( sum < l ) {
            if ( R >= n ) break;
            sum += v[R].fi;
            R++;
            continue;
        }
        if ( sum > r ) {
            sum -= v[L].fi;
            L++;
            continue;
        }
        for (int i = L ; i < R ; i++ ) {
            ans.pb(v[i].se);
        }
        break;
    }
    sort(all(ans));
    return ans;
}

Compilation message

molecules.cpp: In function 'void files()':
molecules.cpp:25:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
molecules.cpp:26:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 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 0 ms 300 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 300 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 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 212 KB OK (n = 12, answer = YES)
7 Correct 1 ms 212 KB OK (n = 12, answer = YES)
8 Correct 0 ms 212 KB OK (n = 12, answer = YES)
9 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
13 Correct 1 ms 212 KB OK (n = 100, answer = NO)
14 Correct 1 ms 304 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 1 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 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 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 0 ms 300 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 300 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 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 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 212 KB OK (n = 12, answer = YES)
27 Correct 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 304 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 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 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 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 296 KB OK (n = 100, answer = YES)
44 Correct 0 ms 300 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 300 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 296 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 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 1 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 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 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 0 ms 300 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 300 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 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 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 212 KB OK (n = 12, answer = YES)
27 Correct 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 304 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 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 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 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 296 KB OK (n = 100, answer = YES)
44 Correct 0 ms 300 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 300 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 296 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 572 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 560 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 564 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 300 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 1 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 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 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 0 ms 300 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 300 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 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 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 212 KB OK (n = 12, answer = YES)
27 Correct 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 304 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 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 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 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 296 KB OK (n = 100, answer = YES)
44 Correct 0 ms 300 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 300 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 296 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 572 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 560 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 564 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 300 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 2 ms 568 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 492 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 572 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 492 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 568 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 564 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 468 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 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 0 ms 300 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 1 ms 212 KB OK (n = 3, answer = NO)
17 Correct 1 ms 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 300 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 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 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 212 KB OK (n = 12, answer = YES)
27 Correct 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 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 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 304 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 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 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 1 ms 304 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 296 KB OK (n = 100, answer = YES)
44 Correct 0 ms 300 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 300 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 296 KB OK (n = 100, answer = YES)
53 Correct 1 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 508 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 572 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 560 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 572 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 492 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 564 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 300 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 2 ms 568 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 492 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 572 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 492 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 568 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 564 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 300 KB OK (n = 1, answer = YES)
95 Correct 1 ms 212 KB OK (n = 3, answer = YES)
96 Correct 1 ms 212 KB OK (n = 3, answer = NO)
97 Correct 0 ms 212 KB OK (n = 3, answer = YES)
98 Correct 26 ms 4596 KB OK (n = 150000, answer = NO)
99 Correct 38 ms 6572 KB OK (n = 200000, answer = YES)
100 Correct 42 ms 7152 KB OK (n = 200000, answer = NO)
101 Correct 40 ms 6488 KB OK (n = 200000, answer = YES)
102 Correct 40 ms 7048 KB OK (n = 200000, answer = YES)
103 Correct 39 ms 6444 KB OK (n = 200000, answer = YES)
104 Correct 39 ms 6316 KB OK (n = 200000, answer = YES)
105 Correct 35 ms 5712 KB OK (n = 200000, answer = NO)
106 Correct 44 ms 6392 KB OK (n = 200000, answer = YES)
107 Correct 39 ms 7148 KB OK (n = 200000, answer = NO)
108 Correct 37 ms 5780 KB OK (n = 200000, answer = NO)
109 Correct 35 ms 5732 KB OK (n = 200000, answer = NO)
110 Correct 31 ms 5972 KB OK (n = 200000, answer = YES)
111 Correct 24 ms 6156 KB OK (n = 200000, answer = YES)
112 Correct 24 ms 6068 KB OK (n = 200000, answer = YES)
113 Correct 25 ms 6192 KB OK (n = 200000, answer = YES)
114 Correct 25 ms 6200 KB OK (n = 200000, answer = YES)
115 Correct 25 ms 6220 KB OK (n = 200000, answer = YES)
116 Correct 32 ms 5940 KB OK (n = 200000, answer = YES)
117 Correct 33 ms 5972 KB OK (n = 200000, answer = YES)