oj.uz

Submission #372591

# Submission time Handle Problem Language Result Execution time Memory
372591 2021-03-01T03:44:15 Z cpp219 Detecting Molecules (IOI16_molecules) C++14
100 / 100
 63 ms 8412 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 2e5 + 9;
const ll mod = 1e9 + 7;

vector<int> kq;
void Get_kq(deque<ll> &dq){
    for (auto i : dq) kq.push_back(i);
}

vector<int> find_subset(int L,int R, vector<int> w){
    deque<ll> ans;
    vector<LL> a;
    ll cur = 0; ll n = w.size();
    for (ll i = 0;i < n;i++) a.push_back({w[i],i}); sort(a.begin(),a.end());
    if (R < a[0].fs) return kq;
    if (L <= a[0].fs&&a[0].fs <= R){
        kq.push_back(a[0].sc); return kq;
    }
    if (L <= a[n - 1].fs&&a[n - 1].fs <= R){
        kq.push_back(a[n - 1].sc); return kq;
    }
    //cout<<a[0].fs; exit(0);
    for (ll i = 0;i < n;i++){
        if (L <= cur&&cur <= R) break;
        else if (cur + a[i].fs <= R) cur += a[i].fs,ans.push_back(a[i].sc);
        else if (cur + a[i].fs > R){
            while(i < n){
                //cout<<i<<" "<<cur<<"\n";
                if (L <= cur&&cur <= R){
                    Get_kq(ans); return kq;
                }
                if (ans.empty()) break;
                ll p = ans.front(); ans.pop_front();
                ll val = a[i].fs - w[p];
                if (cur + val <= R) cur += val,ans.push_back(a[i].sc); i++;
            }
            if (L <= cur&&cur <= R) Get_kq(ans);
            return kq;
        }
    }
    if (L <= cur&&cur <= R) Get_kq(ans);
    return kq;
}

/*

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #define task "test"
    if (fopen(task".INP","r")){
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    ll L,R,n,x; vector<int> w;
    cin>>n>>L>>R;
    for (ll i = 1;i <= n;i++) cin>>x,w.push_back(x);
    vector<int> c = find_subset(L,R,w); //return 0;
    for (auto i : c) cout<<i<<" ";
}
*/

Compilation message

molecules.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
molecules.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      | 
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:24:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   24 |     for (ll i = 0;i < n;i++) a.push_back({w[i],i}); sort(a.begin(),a.end());
      |     ^~~
molecules.cpp:24:53: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   24 |     for (ll i = 0;i < n;i++) a.push_back({w[i],i}); sort(a.begin(),a.end());
      |                                                     ^~~~
molecules.cpp:45:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   45 |                 if (cur + val <= R) cur += val,ans.push_back(a[i].sc); i++;
      |                 ^~
molecules.cpp:45:72: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   45 |                 if (cur + val <= R) cur += val,ans.push_back(a[i].sc); i++;
      |                                                                        ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 0 ms 364 KB OK (n = 3, answer = YES)
12 Correct 0 ms 364 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 0 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 0 ms 364 KB OK (n = 100, answer = YES)

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB OK (n = 12, answer = YES)
2 Correct 1 ms 364 KB OK (n = 12, answer = YES)
3 Correct 0 ms 364 KB OK (n = 12, answer = NO)
4 Correct 0 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 384 KB OK (n = 100, answer = YES)
17 Correct 1 ms 364 KB OK (n = 100, answer = YES)

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 0 ms 364 KB OK (n = 3, answer = YES)
12 Correct 0 ms 364 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 0 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 0 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 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 384 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 384 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 364 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 492 KB OK (n = 100, answer = YES)

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 0 ms 364 KB OK (n = 3, answer = YES)
12 Correct 0 ms 364 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 0 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 0 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 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 384 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 384 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 364 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 492 KB OK (n = 100, answer = YES)
55 Correct 4 ms 748 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 876 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 876 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 876 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 876 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 876 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 0 ms 364 KB OK (n = 3, answer = YES)
12 Correct 0 ms 364 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 0 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 0 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 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 384 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 384 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 364 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 492 KB OK (n = 100, answer = YES)
55 Correct 4 ms 748 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 876 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 876 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 876 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 876 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 876 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 768 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 748 KB OK (n = 10000, answer = NO)
76 Correct 4 ms 748 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 748 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 748 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 1024 KB OK (n = 10000, answer = YES)
83 Correct 4 ms 876 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 876 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 876 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 876 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 876 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 876 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 876 KB OK (n = 10000, answer = YES)

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB OK (n = 1, answer = NO)
2 Correct 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 364 KB OK (n = 3, answer = YES)
9 Correct 1 ms 364 KB OK (n = 3, answer = YES)
10 Correct 1 ms 364 KB OK (n = 3, answer = YES)
11 Correct 0 ms 364 KB OK (n = 3, answer = YES)
12 Correct 0 ms 364 KB OK (n = 3, answer = YES)
13 Correct 0 ms 364 KB OK (n = 3, answer = NO)
14 Correct 0 ms 364 KB OK (n = 3, answer = YES)
15 Correct 0 ms 364 KB OK (n = 3, answer = YES)
16 Correct 0 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 364 KB OK (n = 100, answer = NO)
19 Correct 0 ms 364 KB OK (n = 100, answer = YES)
20 Correct 1 ms 364 KB OK (n = 12, answer = YES)
21 Correct 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 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 384 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 384 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 364 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 492 KB OK (n = 100, answer = YES)
55 Correct 4 ms 748 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 876 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 876 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 876 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 876 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 876 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 768 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 748 KB OK (n = 10000, answer = NO)
76 Correct 4 ms 748 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 748 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 748 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 1024 KB OK (n = 10000, answer = YES)
83 Correct 4 ms 876 KB OK (n = 10000, answer = NO)
84 Correct 4 ms 876 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 876 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 876 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 876 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 876 KB OK (n = 10000, answer = YES)
92 Correct 3 ms 876 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 876 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 39 ms 6620 KB OK (n = 150000, answer = NO)
99 Correct 55 ms 7644 KB OK (n = 200000, answer = YES)
100 Correct 63 ms 8412 KB OK (n = 200000, answer = NO)
101 Correct 61 ms 7516 KB OK (n = 200000, answer = YES)
102 Correct 56 ms 8300 KB OK (n = 200000, answer = YES)
103 Correct 55 ms 7644 KB OK (n = 200000, answer = YES)
104 Correct 54 ms 7516 KB OK (n = 200000, answer = YES)
105 Correct 52 ms 7384 KB OK (n = 200000, answer = NO)
106 Correct 59 ms 7388 KB OK (n = 200000, answer = YES)
107 Correct 57 ms 8284 KB OK (n = 200000, answer = NO)
108 Correct 52 ms 7512 KB OK (n = 200000, answer = NO)
109 Correct 50 ms 7508 KB OK (n = 200000, answer = NO)
110 Correct 45 ms 7132 KB OK (n = 200000, answer = YES)
111 Correct 38 ms 7260 KB OK (n = 200000, answer = YES)
112 Correct 38 ms 7260 KB OK (n = 200000, answer = YES)
113 Correct 40 ms 7388 KB OK (n = 200000, answer = YES)
114 Correct 40 ms 7264 KB OK (n = 200000, answer = YES)
115 Correct 39 ms 7260 KB OK (n = 200000, answer = YES)
116 Correct 48 ms 7132 KB OK (n = 200000, answer = YES)
117 Correct 50 ms 7308 KB OK (n = 200000, answer = YES)