oj.uz

답안 #586922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
586922 2022-07-01T04:22:55 Z tranxuanbach Detecting Molecules (IOI16_molecules) C++17
100 / 100
 43 ms 7116 KB 
#ifndef FEXT

#include "molecules.h"

#endif

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define endl '\n'
#define fi first
#define se second
#define For(i, l, r) for (auto i = l; i < r; i++)
#define ForE(i, l, r) for (auto i = l; i <= r; i++)
#define FordE(i, l, r) for (auto i = l; i >= r; i--)
#define Fora(v, a) for (auto v: a)
#define bend(a) a.begin(), a.end()
#define isz(a) ((signed)a.size())

using ll = long long;
using ld = long double;
using pii = pair <int, int>;
using vi = vector <int>;
using vpii = vector <pair <int, int>>;
using vvi = vector <vector <int>>;

const int N = 2e5 + 5;

vi find_subset(int losum, int hisum, vi a){
    int n = isz(a);

    vpii b(n);
    For(i, 0, n){
        b[i] = make_pair(a[i], i);
    }
    sort(bend(b));
    vector <ll> pb(n, 0);
    For(i, 0, n){
        pb[i] = (i ? pb[i - 1] : 0) + b[i].fi;
    }

    ForE(len, 1, n){
        ll sumlo = pb[len - 1], sumhi = pb[n - 1] - (n - len ? pb[n - len - 1] : 0);
        if (hisum < sumlo or sumhi < losum){
            continue;
        }
        ll sum = sumlo;
        int idxl = len - 1, idxr = n;
        while (hisum < sum or sum < losum){
            sum -= b[idxl].fi;
            idxl--;
            idxr--;
            sum += b[idxr].fi;
        }
        vi vans;
        ForE(i, 0, idxl){
            vans.emplace_back(b[i].se);
        }
        For(i, idxr, n){
            vans.emplace_back(b[i].se);
        }
        return vans;
    }
    return {};
}

#ifdef FEXT

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    freopen("KEK.inp", "r", stdin);
    freopen("KEK.out", "w", stdout);
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);
    
    
    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}

#endif

/*
==================================================+
INPUT:                                            |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
OUTPUT:                                           |
--------------------------------------------------|

--------------------------------------------------|
==================================================+
*/

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 260 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 ms 296 KB OK (n = 2, answer = YES)
6 Correct 1 ms 300 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 300 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 296 KB OK (n = 3, answer = YES)
12 Correct 1 ms 304 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 ms 296 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 212 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 1 ms 212 KB OK (n = 12, answer = YES)
2 Correct 1 ms 212 KB OK (n = 12, answer = YES)
3 Correct 1 ms 212 KB OK (n = 12, answer = NO)
4 Correct 1 ms 212 KB OK (n = 12, answer = NO)
5 Correct 1 ms 212 KB OK (n = 12, answer = YES)
6 Correct 1 ms 212 KB OK (n = 12, answer = YES)
7 Correct 1 ms 304 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 0 ms 212 KB OK (n = 12, answer = YES)
11 Correct 1 ms 212 KB OK (n = 100, answer = NO)
12 Correct 1 ms 212 KB OK (n = 100, answer = YES)
13 Correct 0 ms 212 KB OK (n = 100, answer = NO)
14 Correct 0 ms 212 KB OK (n = 100, answer = YES)
15 Correct 0 ms 212 KB OK (n = 100, answer = YES)
16 Correct 0 ms 212 KB OK (n = 100, answer = YES)
17 Correct 0 ms 212 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 260 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 ms 296 KB OK (n = 2, answer = YES)
6 Correct 1 ms 300 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 300 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 296 KB OK (n = 3, answer = YES)
12 Correct 1 ms 304 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 ms 296 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 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 304 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 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 212 KB OK (n = 100, answer = NO)
33 Correct 0 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 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 300 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 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 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 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 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 296 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 296 KB OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 260 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 ms 296 KB OK (n = 2, answer = YES)
6 Correct 1 ms 300 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 300 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 296 KB OK (n = 3, answer = YES)
12 Correct 1 ms 304 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 ms 296 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 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 304 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 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 212 KB OK (n = 100, answer = NO)
33 Correct 0 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 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 300 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 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 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 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 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 296 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 296 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 472 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 516 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 536 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 476 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 220 KB OK (n = 865, answer = YES)
73 Correct 1 ms 216 KB OK (n = 820, answer = YES)

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 260 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 ms 296 KB OK (n = 2, answer = YES)
6 Correct 1 ms 300 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 300 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 296 KB OK (n = 3, answer = YES)
12 Correct 1 ms 304 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 ms 296 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 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 304 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 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 212 KB OK (n = 100, answer = NO)
33 Correct 0 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 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 300 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 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 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 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 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 296 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 296 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 472 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 516 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 536 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 476 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 220 KB OK (n = 865, answer = YES)
73 Correct 1 ms 216 KB OK (n = 820, answer = YES)
74 Correct 2 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 472 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 468 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 440 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 516 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 600 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
85 Correct 4 ms 596 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 576 KB OK (n = 10000, answer = YES)
91 Correct 5 ms 572 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 480 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 260 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 1 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 ms 296 KB OK (n = 2, answer = YES)
6 Correct 1 ms 300 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 1 ms 212 KB OK (n = 3, answer = YES)
9 Correct 1 ms 300 KB OK (n = 3, answer = YES)
10 Correct 1 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 296 KB OK (n = 3, answer = YES)
12 Correct 1 ms 304 KB OK (n = 3, answer = YES)
13 Correct 1 ms 212 KB OK (n = 3, answer = NO)
14 Correct 1 ms 212 KB OK (n = 3, answer = YES)
15 Correct 1 ms 296 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 212 KB OK (n = 100, answer = NO)
19 Correct 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 1 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 1 ms 212 KB OK (n = 12, answer = NO)
24 Correct 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 1 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 304 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 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 212 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 212 KB OK (n = 100, answer = NO)
33 Correct 0 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 0 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 300 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 300 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 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 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 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 212 KB OK (n = 100, answer = YES)
52 Correct 0 ms 296 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 296 KB OK (n = 100, answer = YES)
55 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
60 Correct 4 ms 468 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 472 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 516 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 468 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 536 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 476 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 220 KB OK (n = 865, answer = YES)
73 Correct 1 ms 216 KB OK (n = 820, answer = YES)
74 Correct 2 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 468 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 472 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 468 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 440 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 564 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 516 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 600 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
85 Correct 4 ms 596 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 576 KB OK (n = 10000, answer = YES)
91 Correct 5 ms 572 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 468 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 480 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 212 KB OK (n = 1, answer = YES)
95 Correct 0 ms 212 KB OK (n = 3, answer = YES)
96 Correct 1 ms 296 KB OK (n = 3, answer = NO)
97 Correct 1 ms 300 KB OK (n = 3, answer = YES)
98 Correct 26 ms 4556 KB OK (n = 150000, answer = NO)
99 Correct 40 ms 6528 KB OK (n = 200000, answer = YES)
100 Correct 42 ms 7116 KB OK (n = 200000, answer = NO)
101 Correct 39 ms 6460 KB OK (n = 200000, answer = YES)
102 Correct 43 ms 6952 KB OK (n = 200000, answer = YES)
103 Correct 41 ms 6528 KB OK (n = 200000, answer = YES)
104 Correct 37 ms 6348 KB OK (n = 200000, answer = YES)
105 Correct 41 ms 5724 KB OK (n = 200000, answer = NO)
106 Correct 40 ms 6376 KB OK (n = 200000, answer = YES)
107 Correct 41 ms 7084 KB OK (n = 200000, answer = NO)
108 Correct 37 ms 5728 KB OK (n = 200000, answer = NO)
109 Correct 36 ms 5704 KB OK (n = 200000, answer = NO)
110 Correct 31 ms 5928 KB OK (n = 200000, answer = YES)
111 Correct 29 ms 6124 KB OK (n = 200000, answer = YES)
112 Correct 22 ms 6056 KB OK (n = 200000, answer = YES)
113 Correct 25 ms 6196 KB OK (n = 200000, answer = YES)
114 Correct 33 ms 6220 KB OK (n = 200000, answer = YES)
115 Correct 25 ms 6188 KB OK (n = 200000, answer = YES)
116 Correct 33 ms 5964 KB OK (n = 200000, answer = YES)
117 Correct 34 ms 5936 KB OK (n = 200000, answer = YES)