oj.uz

답안 #489343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489343 2021-11-22T16:12:33 Z joshjms Detecting Molecules (IOI16_molecules) C++14
100 / 100
 57 ms 9004 KB 
#include "molecules.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define konaqua ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define otsuaqua exit(0);
 
#define debug(x) cout << #x << " => " << x << "\n"
#define all(x) x.begin(), x.end()
#define sp " "

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
const ll INFF = 1e18 + 5;
const ll INF = 1e10 + 5;
const int MX = 1e6 + 5;
const int MXL = 105;
const int mod = 1e9 + 7; // (use when CF)
// const int mod = 998244353; // (use when Atcoder)
const double ERROR = 1e-7;

const ld pi = 3.14159265358979323846;

const int set_inf = 0x3f3f3f3f;

ll N, L, R, S;
pair <ll, ll> A[3000005];
vector <int> emp, ans;
queue <pair<ll,ll>> Q;

vector<int> find_subset(int l, int u, vector<int> w) {
    N = w.size();
    L = R = 0;

    for(int i = 0; i < N; i++){
        A[i].fi = w[i];
        A[i].se = i;
    }

    sort(A, A + N);

    for(; R < N; R++){
        S += A[R].fi;
        Q.push(A[R]);

        while(S > u){
            S -= Q.front().fi;
            Q.pop();
            L++;
        }

        if(l <= S && S <= u){
            break;
        }
    }

    if(S < l || S > u) return emp;

    for(; Q.size(); Q.pop())
        ans.push_back(Q.front().se);

    sort(all(ans));
    return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 204 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 KB OK (n = 2, answer = YES)
6 Correct 0 ms 204 KB OK (n = 3, answer = YES)
7 Correct 0 ms 204 KB OK (n = 3, answer = YES)
8 Correct 0 ms 204 KB OK (n = 3, answer = YES)
9 Correct 0 ms 204 KB OK (n = 3, answer = YES)
10 Correct 0 ms 204 KB OK (n = 3, answer = YES)
11 Correct 0 ms 204 KB OK (n = 3, answer = YES)
12 Correct 0 ms 204 KB OK (n = 3, answer = YES)
13 Correct 0 ms 204 KB OK (n = 3, answer = NO)
14 Correct 0 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 1 ms 204 KB OK (n = 3, answer = NO)
17 Correct 0 ms 204 KB OK (n = 3, answer = NO)
18 Correct 0 ms 204 KB OK (n = 100, answer = NO)
19 Correct 0 ms 204 KB OK (n = 100, answer = YES)
20 Correct 0 ms 204 KB OK (n = 12, answer = YES)
21 Correct 0 ms 204 KB OK (n = 12, answer = YES)
22 Correct 0 ms 204 KB OK (n = 12, answer = NO)
23 Correct 0 ms 204 KB OK (n = 12, answer = NO)
24 Correct 0 ms 204 KB OK (n = 12, answer = YES)
25 Correct 0 ms 204 KB OK (n = 12, answer = YES)
26 Correct 0 ms 204 KB OK (n = 12, answer = YES)
27 Correct 1 ms 204 KB OK (n = 12, answer = YES)
28 Correct 0 ms 204 KB OK (n = 6, answer = YES)
29 Correct 1 ms 204 KB OK (n = 12, answer = YES)
30 Correct 1 ms 204 KB OK (n = 100, answer = NO)
31 Correct 0 ms 204 KB OK (n = 100, answer = YES)
32 Correct 1 ms 204 KB OK (n = 100, answer = NO)
33 Correct 0 ms 204 KB OK (n = 100, answer = YES)
34 Correct 0 ms 204 KB OK (n = 100, answer = YES)
35 Correct 0 ms 204 KB OK (n = 100, answer = YES)
36 Correct 0 ms 204 KB OK (n = 100, answer = YES)
37 Correct 0 ms 204 KB OK (n = 28, answer = YES)
38 Correct 0 ms 204 KB OK (n = 27, answer = YES)
39 Correct 0 ms 204 KB OK (n = 90, answer = YES)
40 Correct 0 ms 204 KB OK (n = 100, answer = YES)
41 Correct 0 ms 204 KB OK (n = 100, answer = YES)
42 Correct 0 ms 204 KB OK (n = 10, answer = YES)
43 Correct 0 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 1 ms 204 KB OK (n = 100, answer = YES)
46 Correct 0 ms 204 KB OK (n = 100, answer = YES)
47 Correct 0 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 ms 204 KB OK (n = 100, answer = NO)
49 Correct 0 ms 204 KB OK (n = 100, answer = NO)
50 Correct 0 ms 204 KB OK (n = 100, answer = YES)
51 Correct 0 ms 204 KB OK (n = 100, answer = YES)
52 Correct 0 ms 204 KB OK (n = 100, answer = YES)
53 Correct 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 204 KB OK (n = 820, answer = YES)
74 Correct 2 ms 588 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 588 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 588 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 460 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 588 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 592 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 460 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 460 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 204 KB OK (n = 1, answer = YES)
95 Correct 0 ms 204 KB OK (n = 3, answer = YES)
96 Correct 0 ms 204 KB OK (n = 3, answer = NO)
97 Correct 0 ms 204 KB OK (n = 3, answer = YES)
98 Correct 28 ms 6268 KB OK (n = 150000, answer = NO)
99 Correct 41 ms 4984 KB OK (n = 200000, answer = YES)
100 Correct 53 ms 6872 KB OK (n = 200000, answer = NO)
101 Correct 57 ms 6704 KB OK (n = 200000, answer = YES)
102 Correct 40 ms 6832 KB OK (n = 200000, answer = YES)
103 Correct 41 ms 6384 KB OK (n = 200000, answer = YES)
104 Correct 38 ms 6200 KB OK (n = 200000, answer = YES)
105 Correct 37 ms 8972 KB OK (n = 200000, answer = NO)
106 Correct 44 ms 6836 KB OK (n = 200000, answer = YES)
107 Correct 38 ms 6888 KB OK (n = 200000, answer = NO)
108 Correct 38 ms 9004 KB OK (n = 200000, answer = NO)
109 Correct 37 ms 9004 KB OK (n = 200000, answer = NO)
110 Correct 41 ms 5900 KB OK (n = 200000, answer = YES)
111 Correct 24 ms 6092 KB OK (n = 200000, answer = YES)
112 Correct 23 ms 6064 KB OK (n = 200000, answer = YES)
113 Correct 26 ms 6452 KB OK (n = 200000, answer = YES)
114 Correct 25 ms 6464 KB OK (n = 200000, answer = YES)
115 Correct 24 ms 6440 KB OK (n = 200000, answer = YES)
116 Correct 32 ms 5964 KB OK (n = 200000, answer = YES)
117 Correct 35 ms 5964 KB OK (n = 200000, answer = YES)