oj.uz

답안 #341910

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
341910 2020-12-31T12:55:35 Z DrearyJoke Detecting Molecules (IOI16_molecules) C++17
100 / 100
 149 ms 15212 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include "molecules.h"
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.x << ' ' << p.y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}

#define deb(x) cout << '>' << #x << ':' << x << endl;
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define END '\n'
#define inf 9e18
#define ff first
#define ss second
#define pb push_back

std::vector<int> find_subset(int l, int u, std::vector<int> w) {
    int n = w.size();
    vector<pair<ll, int>> A(n);
    for (int i = 0; i < n; ++i) A[i] = {w[i], i};
    sort(all(A));
    auto it = lower_bound(all(A), pair<ll, int>(l, 0));
    vi ans;
    if (it != A.end() && it->ff >= l && it->ff <= u) {
        ans.pb(it->ss);
        return ans;
    }
    int lo = 0, hi;
    // if (it == A.end() || it->ff > u) hi = (it - A.begin());
    hi = n;
    // cout << hi << END;
    ll sum = 0;
    set<int> s;
    for (int i = 0; i < hi; ++i) {
        sum += A[i].ff;
        s.insert(A[i].ss);
        if (sum >= l && sum <= u) {
            for (auto u: s) ans.pb(u);
            return ans;
        }
        // cout << sum << END;
        if (sum > u) {
            sum -= A[lo].ff;
            s.erase(A[lo++].ss);
        }
        if (sum >= l && sum <= u) {
            for (auto u: s) ans.pb(u);
            return ans;
        }
        // cout << "WOW: " << sum << END;
    }
    return ans;
}


// void solve(){

// }
// int main()
// {
//     ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
//     int t = 1;
//     cin >> t;
//     while(t--){
//         solve();
//     }
//     return 0;
// }

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 0 ms 364 KB OK (n = 1, answer = NO)
3 Correct 0 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 0 ms 364 KB OK (n = 3, answer = YES)
7 Correct 0 ms 364 KB OK (n = 3, answer = YES)
8 Correct 0 ms 364 KB OK (n = 3, answer = YES)
9 Correct 0 ms 364 KB OK (n = 3, answer = YES)
10 Correct 0 ms 364 KB OK (n = 3, answer = YES)
11 Correct 1 ms 364 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 0 ms 384 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 0 ms 364 KB OK (n = 100, answer = NO)
19 Correct 1 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 364 KB OK (n = 12, answer = YES)
21 Correct 0 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 ms 364 KB OK (n = 12, answer = NO)
24 Correct 1 ms 364 KB OK (n = 12, answer = YES)
25 Correct 1 ms 364 KB OK (n = 12, answer = YES)
26 Correct 1 ms 364 KB OK (n = 12, answer = YES)
27 Correct 1 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 364 KB OK (n = 6, answer = YES)
29 Correct 1 ms 364 KB OK (n = 12, answer = YES)
30 Correct 1 ms 364 KB OK (n = 100, answer = NO)
31 Correct 1 ms 364 KB OK (n = 100, answer = YES)
32 Correct 1 ms 364 KB OK (n = 100, answer = NO)
33 Correct 1 ms 364 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 364 KB OK (n = 100, answer = YES)
36 Correct 1 ms 364 KB OK (n = 100, answer = YES)
37 Correct 1 ms 364 KB OK (n = 28, answer = YES)
38 Correct 1 ms 364 KB OK (n = 27, answer = YES)
39 Correct 1 ms 364 KB OK (n = 90, answer = YES)
40 Correct 1 ms 364 KB OK (n = 100, answer = YES)
41 Correct 1 ms 364 KB OK (n = 100, answer = YES)
42 Correct 1 ms 364 KB OK (n = 10, answer = YES)
43 Correct 1 ms 364 KB OK (n = 100, answer = YES)
44 Correct 1 ms 364 KB OK (n = 100, answer = YES)
45 Correct 1 ms 364 KB OK (n = 100, answer = YES)
46 Correct 1 ms 364 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 364 KB OK (n = 100, answer = NO)
49 Correct 1 ms 364 KB OK (n = 100, answer = NO)
50 Correct 1 ms 364 KB OK (n = 100, answer = YES)
51 Correct 1 ms 384 KB OK (n = 100, answer = YES)
52 Correct 1 ms 364 KB OK (n = 100, answer = YES)
53 Correct 1 ms 364 KB OK (n = 100, answer = YES)
54 Correct 1 ms 364 KB OK (n = 100, answer = YES)
55 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 364 KB OK (n = 865, answer = YES)
73 Correct 1 ms 364 KB OK (n = 820, answer = YES)
74 Correct 3 ms 876 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 1004 KB OK (n = 10000, answer = NO)
76 Correct 4 ms 1004 KB OK (n = 10000, answer = NO)
77 Correct 5 ms 1004 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 1004 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 876 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
83 Correct 4 ms 620 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 748 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
86 Correct 5 ms 876 KB OK (n = 10000, answer = YES)
87 Correct 4 ms 748 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
93 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 364 KB OK (n = 1, answer = YES)
95 Correct 1 ms 364 KB OK (n = 3, answer = YES)
96 Correct 1 ms 364 KB OK (n = 3, answer = NO)
97 Correct 1 ms 364 KB OK (n = 3, answer = YES)
98 Correct 66 ms 11744 KB OK (n = 150000, answer = NO)
99 Correct 65 ms 6764 KB OK (n = 200000, answer = YES)
100 Correct 68 ms 7276 KB OK (n = 200000, answer = NO)
101 Correct 64 ms 7660 KB OK (n = 200000, answer = YES)
102 Correct 54 ms 7020 KB OK (n = 200000, answer = YES)
103 Correct 54 ms 6636 KB OK (n = 200000, answer = YES)
104 Correct 73 ms 6508 KB OK (n = 200000, answer = YES)
105 Correct 149 ms 15212 KB OK (n = 200000, answer = NO)
106 Correct 66 ms 7916 KB OK (n = 200000, answer = YES)
107 Correct 58 ms 7148 KB OK (n = 200000, answer = NO)
108 Correct 123 ms 15212 KB OK (n = 200000, answer = NO)
109 Correct 116 ms 15212 KB OK (n = 200000, answer = NO)
110 Correct 44 ms 5996 KB OK (n = 200000, answer = YES)
111 Correct 40 ms 6252 KB OK (n = 200000, answer = YES)
112 Correct 58 ms 6124 KB OK (n = 200000, answer = YES)
113 Correct 45 ms 7148 KB OK (n = 200000, answer = YES)
114 Correct 60 ms 7020 KB OK (n = 200000, answer = YES)
115 Correct 59 ms 7020 KB OK (n = 200000, answer = YES)
116 Correct 59 ms 5996 KB OK (n = 200000, answer = YES)
117 Correct 48 ms 6124 KB OK (n = 200000, answer = YES)