oj.uz

답안 #431085

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
431085 2021-06-17T09:23:48 Z davi_bart Detecting Molecules (IOI16_molecules) C++17
100 / 100
 59 ms 6796 KB 
#include "molecules.h"
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define ld long double
#define pb push_back
std::vector<int> find_subset(int l, int u, std::vector<int> p) {
    vector<pair<ll,ll> > w;
    for(ll i=0;i<p.size();i++)w.pb({p[i],i});
    vector<int> ans;
    ll tot=0;
    sort(w.begin(),w.end());
    reverse(w.begin(),w.end());
    for(ll i=0;i<w.size();i++){
        ans.pb(w[i].se);
        tot+=w[i].fi;
        if(tot>=l)break;
    }

    if(tot>=l && tot<=u)return ans;
    ll pos=0;
    for(ll i=w.size()-1;i>=ans.size();i--){
        tot-=p[ans[pos]];
        ans[pos]=w[i].se;
        tot+=p[ans[pos]];
        pos++;
        if(pos>=ans.size())break;
        if(tot<=u)break;
    }
    
    if(tot>=l && tot<=u)return ans;
    ans.clear();
    return ans;
    /*tot=0;
    sort(w.begin(),w.end());
    for(int i=0;i<w.size();i++){
        ans.pb(i);
        tot+=w[i];
        if(tot>=l)break;
    }

    if(tot>=l && tot<=u)return ans;
    tot-=w[ans.back()];
    ans.pop_back();

    pos=0;
    for(int i=w.size()-1;i>=ans.size();i++){
        tot-=w[ans[pos]];
        ans[pos]=i;
        tot+=w[ans[pos]];
        pos++;
        if(pos>=ans.size())break;
        if(tot>=l && tot<=u)break;
    }
    if(tot>=l && tot<=u)return ans;
    ans.clear();
    return ans;*/
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:12:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(ll i=0;i<p.size();i++)w.pb({p[i],i});
      |                ~^~~~~~~~~
molecules.cpp:17:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for(ll i=0;i<w.size();i++){
      |                ~^~~~~~~~~
molecules.cpp:25:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for(ll i=w.size()-1;i>=ans.size();i--){
      |                         ~^~~~~~~~~~~~
molecules.cpp:30:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         if(pos>=ans.size())break;
      |            ~~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB OK (n = 1, answer = NO)
2 Correct 0 ms 268 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 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 1 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 1 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 0 ms 204 KB OK (n = 12, answer = YES)
9 Correct 1 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 1 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 268 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 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 1 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 1 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 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 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 1 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 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 1 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 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 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 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 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 268 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 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 1 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 1 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 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 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 1 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 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 1 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 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 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 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 204 KB OK (n = 100, answer = YES)
55 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
58 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 708 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 756 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 332 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 268 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 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 1 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 1 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 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 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 1 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 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 1 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 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 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 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 204 KB OK (n = 100, answer = YES)
55 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
58 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 708 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 756 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 332 KB OK (n = 820, answer = YES)
74 Correct 2 ms 588 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
78 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 716 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 268 KB OK (n = 1, answer = NO)
3 Correct 0 ms 204 KB OK (n = 1, answer = YES)
4 Correct 1 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 1 ms 204 KB OK (n = 3, answer = YES)
15 Correct 0 ms 204 KB OK (n = 3, answer = YES)
16 Correct 0 ms 204 KB OK (n = 3, answer = NO)
17 Correct 1 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 1 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 1 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 0 ms 204 KB OK (n = 12, answer = YES)
28 Correct 1 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 1 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 1 ms 204 KB OK (n = 27, answer = YES)
39 Correct 1 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 1 ms 204 KB OK (n = 100, answer = YES)
44 Correct 0 ms 204 KB OK (n = 100, answer = YES)
45 Correct 0 ms 204 KB OK (n = 100, answer = YES)
46 Correct 1 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 1 ms 204 KB OK (n = 100, answer = NO)
50 Correct 1 ms 204 KB OK (n = 100, answer = YES)
51 Correct 1 ms 204 KB OK (n = 100, answer = YES)
52 Correct 1 ms 204 KB OK (n = 100, answer = YES)
53 Correct 1 ms 204 KB OK (n = 100, answer = YES)
54 Correct 1 ms 204 KB OK (n = 100, answer = YES)
55 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
58 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
62 Correct 4 ms 716 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 708 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 756 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 204 KB OK (n = 865, answer = YES)
73 Correct 1 ms 332 KB OK (n = 820, answer = YES)
74 Correct 2 ms 588 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
78 Correct 4 ms 716 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 716 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 716 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 716 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 716 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 38 ms 5640 KB OK (n = 150000, answer = NO)
99 Correct 59 ms 6064 KB OK (n = 200000, answer = YES)
100 Correct 59 ms 6068 KB OK (n = 200000, answer = NO)
101 Correct 57 ms 6056 KB OK (n = 200000, answer = YES)
102 Correct 57 ms 6052 KB OK (n = 200000, answer = YES)
103 Correct 57 ms 6056 KB OK (n = 200000, answer = YES)
104 Correct 53 ms 6060 KB OK (n = 200000, answer = YES)
105 Correct 52 ms 6780 KB OK (n = 200000, answer = NO)
106 Correct 57 ms 6060 KB OK (n = 200000, answer = YES)
107 Correct 56 ms 6056 KB OK (n = 200000, answer = NO)
108 Correct 53 ms 6784 KB OK (n = 200000, answer = NO)
109 Correct 51 ms 6796 KB OK (n = 200000, answer = NO)
110 Correct 46 ms 6068 KB OK (n = 200000, answer = YES)
111 Correct 35 ms 6056 KB OK (n = 200000, answer = YES)
112 Correct 35 ms 6080 KB OK (n = 200000, answer = YES)
113 Correct 39 ms 6068 KB OK (n = 200000, answer = YES)
114 Correct 38 ms 6048 KB OK (n = 200000, answer = YES)
115 Correct 39 ms 6068 KB OK (n = 200000, answer = YES)
116 Correct 44 ms 6052 KB OK (n = 200000, answer = YES)
117 Correct 48 ms 6056 KB OK (n = 200000, answer = YES)