oj.uz

답안 #736348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736348 2023-05-05T13:24:11 Z snowman Detecting Molecules (IOI16_molecules) C++17
100 / 100
 50 ms 8680 KB 
#include <bits/stdc++.h>
#include "molecules.h"
//Soltan Cristian
#define fri(a, b) for (int i = (a); i < (b); ++i)
#define frj(a, b) for(int j = a; j < b; j++)
#define frk(a, b) for(int k = a; k < b; k++)
#define frm(a, b, i) for(int i = b; i >= a; i--)
#define ll long long
#define all(x) x.begin(), x.end()
#define mod 1000000007
#define pb push_back
#define st first
#define nd second
#define sz(x) (ll)x.size()
#define rall(x) x.rbegin(), x.rend()
#define ct(x) cout << x
#define cts(x) cout << x << ' '
#define ctn(x) cout << x << '\n'
#define Y cout << "YES" << '\n'
#define N cout << "NO" << '\n'
using namespace std;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using ml = map<ll, ll>;
using vii = vector<vector<int>>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <typename T>void read(T n, vector<T> &a){fri(0, n){cin >> a[i];}}
template<typename T>void print(T n, T m, vector<vector<T>> &dp){fri(0, n){ct('\n');frj(0, m){ct(setw(5));cts(dp[i][j]);}}}



const int mxa = 1e9 + 1;
// string __fname = "exclusiv";  
// ifstream in(__fname + ".in"); 
// ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out


vector<int> find_subset(int L, int U, vector<int> w){
    int n = w.size();
    vector<pll> a(n);
    fri(0, n){
        a[i] = {w[i], i};
    }
    sort(all(a));
    vector<ll> pre(n);
    fri(0, n){
        pre[i] = a[i].st;
        if(i) pre[i] += pre[i - 1];
    }
    ll l = 1, r = n ,rsl = -1, rsr = -1;
    while(l <= r){
        ll mid = (l + r) / 2;
        ll s;
        if(n - 1 - mid == -1){
            s = pre[n - 1];
        }
        else s = pre[n - 1] - pre[n - 1 - mid];
        if(s < L){
            l = mid + 1;
            continue;
        }
        else{
            ll i = 1;
            while(s > U && n - i - mid >= -1){
                if(n - i - mid == -1){
                    s = pre[n - i];
                }
                else s = pre[n - i] - pre[n - i - mid];
                i++;
            }
            if(i != 1) i--;
            if(s <= U && s >= L){
                rsr = n - i;
                rsl = n - i - mid + 1;
                break;
            }
            else{
                r = mid - 1;
                continue;
            }
        }
    }
    vector<int> rs;
    if(rsl == -1 || rsr == -1){
        return rs;
    }
    fri(rsl, rsr + 1){
        rs.pb(a[i].nd);
    }
    return rs;
}

// int main(){
//     vector<int> rs;
//     vector<int> w = {10};
//     rs = find_subset(1, 10 ,w);
//     for(auto i : rs){
//         cout << i << '\n';
//     }
// }

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 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 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 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 0 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 0 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 1 ms 212 KB OK (n = 12, answer = YES)
6 Correct 0 ms 212 KB OK (n = 12, answer = YES)
7 Correct 1 ms 300 KB OK (n = 12, answer = YES)
8 Correct 1 ms 304 KB OK (n = 12, answer = YES)
9 Correct 1 ms 212 KB OK (n = 6, answer = YES)
10 Correct 1 ms 212 KB OK (n = 12, answer = YES)
11 Correct 1 ms 296 KB OK (n = 100, answer = NO)
12 Correct 1 ms 212 KB OK (n = 100, answer = YES)
13 Correct 1 ms 212 KB OK (n = 100, answer = NO)
14 Correct 1 ms 212 KB OK (n = 100, answer = YES)
15 Correct 1 ms 212 KB OK (n = 100, answer = YES)
16 Correct 1 ms 304 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 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 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 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 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 0 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 0 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 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 304 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 296 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 304 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 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 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 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 340 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 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 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 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 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 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 0 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 0 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 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 304 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 296 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 304 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 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 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 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 340 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 632 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 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 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 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 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 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 0 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 0 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 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 304 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 296 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 304 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 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 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 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 340 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 632 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
74 Correct 3 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 564 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 632 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 628 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 564 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 1 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 1 ms 212 KB OK (n = 2, answer = YES)
5 Correct 1 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 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 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 0 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 0 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 1 ms 212 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 1 ms 300 KB OK (n = 12, answer = YES)
27 Correct 1 ms 304 KB OK (n = 12, answer = YES)
28 Correct 1 ms 212 KB OK (n = 6, answer = YES)
29 Correct 1 ms 212 KB OK (n = 12, answer = YES)
30 Correct 1 ms 296 KB OK (n = 100, answer = NO)
31 Correct 1 ms 212 KB OK (n = 100, answer = YES)
32 Correct 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 304 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 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 KB OK (n = 100, answer = YES)
41 Correct 1 ms 212 KB OK (n = 100, answer = YES)
42 Correct 1 ms 212 KB OK (n = 10, answer = YES)
43 Correct 1 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 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 1 ms 212 KB OK (n = 100, answer = NO)
48 Correct 1 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 KB OK (n = 100, answer = NO)
50 Correct 1 ms 212 KB OK (n = 100, answer = YES)
51 Correct 1 ms 340 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 0 ms 212 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 632 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 596 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 568 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 212 KB OK (n = 820, answer = YES)
74 Correct 3 ms 468 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 564 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 596 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 596 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 632 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 628 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 568 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 596 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 564 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 212 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 1 ms 212 KB OK (n = 3, answer = YES)
98 Correct 28 ms 5736 KB OK (n = 150000, answer = NO)
99 Correct 44 ms 8116 KB OK (n = 200000, answer = YES)
100 Correct 50 ms 8596 KB OK (n = 200000, answer = NO)
101 Correct 44 ms 8012 KB OK (n = 200000, answer = YES)
102 Correct 47 ms 8492 KB OK (n = 200000, answer = YES)
103 Correct 44 ms 8088 KB OK (n = 200000, answer = YES)
104 Correct 42 ms 7852 KB OK (n = 200000, answer = YES)
105 Correct 36 ms 7216 KB OK (n = 200000, answer = NO)
106 Correct 46 ms 7980 KB OK (n = 200000, answer = YES)
107 Correct 44 ms 8680 KB OK (n = 200000, answer = NO)
108 Correct 36 ms 7312 KB OK (n = 200000, answer = NO)
109 Correct 35 ms 7340 KB OK (n = 200000, answer = NO)
110 Correct 38 ms 7516 KB OK (n = 200000, answer = YES)
111 Correct 27 ms 7712 KB OK (n = 200000, answer = YES)
112 Correct 29 ms 7628 KB OK (n = 200000, answer = YES)
113 Correct 30 ms 7860 KB OK (n = 200000, answer = YES)
114 Correct 28 ms 7852 KB OK (n = 200000, answer = YES)
115 Correct 29 ms 7860 KB OK (n = 200000, answer = YES)
116 Correct 36 ms 7468 KB OK (n = 200000, answer = YES)
117 Correct 39 ms 7512 KB OK (n = 200000, answer = YES)