oj.uz

답안 #196942

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
196942 2020-01-17T18:30:36 Z Swan Detecting Molecules (IOI16_molecules) C++14
100 / 100
 88 ms 6376 KB 
#include <bits/stdc++.h>
//#include "molecules.h"
#define stop system("pause")
#define stop2 char o; cin >> o
#define INP freopen("cowrect.in","r",stdin)
#define OUTP freopen ("cowrect.out","w",stdout)
using namespace std;



vector<int> find_subset(int l, int u, vector<int> w) {
    vector<pair<int,int> > start;
    for(int i(0); i < w.size();i++){
        start.push_back({w[i],i});
    }
    sort(start.begin(),start.end());
    sort(w.begin(),w.end());
    if(w[0] > u)return {};
    long long res = 0;
    for(int i(0); i < w.size();i++){
        res+=w[i];
    }
    if(res < l)return {};
    if(res>=l && res<=u){
        vector<int> ans;
        for(int i(0); i < start.size();i++)ans.push_back(start[i].second);
        return ans;
    }
    res = 0;
    set<pair<int,int> > s;
    int cnt = 0;
    int pnt = 0;
    int kek = -1;
    for(int i(0); i < w.size();i++){
        if(res + w[i] > u)break;
        res+=w[i];
        cnt++;
        s.insert({w[i],i});
        kek++;
    }
    //cout << res << ' ' << cnt << endl;
    vector<int> v;
    if(res>=l && res <=u){
        int pnt = 0;
        for(auto& a: s)v.push_back(start[a.second].second);
        return v;
    }
    //return {w.size()};
    pnt = w.size()-1;
    while(cnt){
        int now = s.begin()->first;
        res-=now;
        res+=w[pnt];
        s.erase(s.begin());
        s.insert({w[pnt],pnt});
        pnt--;
        cnt--;
        //cout << res << ' ' << l << ' ' << u << endl;
        if(res>=l && res <=u){
            int pnt = 0;
            for(auto& a: s)v.push_back(start[a.second].second);
            return v;
        }
        if(pnt == kek)break;
    }
    //cout << res << endl;
    return {};
}

/*
main(){
    ios_base::sync_with_stdio(0);
    int l,u,n; cin >> l >> u >> n;
    vector<int> v;
    for(int i(0); i < n;i++){
        int x; cin >> x;
        v.push_back(x);
    }
    vector<int> ans = find_subset(l,u,v);
    for(int i(0); i < ans.size();i++)cout << ans[i] << ' ';
    return 0;
}
*/
/*
15 17 4
6 8 8 7
14 15 4
5 5 6 6
10 20 4
15 17 16 18
0 0 5
10 10 10 10 10
9 10 6
5 5 5 6 6 6
*/

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:13:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i(0); i < w.size();i++){
                   ~~^~~~~~~~~~
molecules.cpp:20:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i(0); i < w.size();i++){
                   ~~^~~~~~~~~~
molecules.cpp:26:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i(0); i < start.size();i++)ans.push_back(start[i].second);
                       ~~^~~~~~~~~~~~~~
molecules.cpp:34:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i(0); i < w.size();i++){
                   ~~^~~~~~~~~~
molecules.cpp:44:13: warning: unused variable 'pnt' [-Wunused-variable]
         int pnt = 0;
             ^~~
molecules.cpp:60:17: warning: unused variable 'pnt' [-Wunused-variable]
             int pnt = 0;
                 ^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB OK (n = 1, answer = NO)
2 Correct 2 ms 256 KB OK (n = 1, answer = NO)
3 Correct 2 ms 376 KB OK (n = 1, answer = YES)
4 Correct 2 ms 376 KB OK (n = 2, answer = YES)
5 Correct 2 ms 256 KB OK (n = 2, answer = YES)
6 Correct 2 ms 376 KB OK (n = 3, answer = YES)
7 Correct 2 ms 376 KB OK (n = 3, answer = YES)
8 Correct 2 ms 376 KB OK (n = 3, answer = YES)
9 Correct 2 ms 376 KB OK (n = 3, answer = YES)
10 Correct 2 ms 376 KB OK (n = 3, answer = YES)
11 Correct 2 ms 376 KB OK (n = 3, answer = YES)
12 Correct 2 ms 376 KB OK (n = 3, answer = YES)
13 Correct 2 ms 376 KB OK (n = 3, answer = NO)
14 Correct 2 ms 376 KB OK (n = 3, answer = YES)
15 Correct 2 ms 256 KB OK (n = 3, answer = YES)
16 Correct 2 ms 376 KB OK (n = 3, answer = NO)
17 Correct 2 ms 256 KB OK (n = 3, answer = NO)
18 Correct 2 ms 376 KB OK (n = 100, answer = NO)
19 Correct 2 ms 376 KB OK (n = 100, answer = YES)
20 Correct 2 ms 256 KB OK (n = 12, answer = YES)
21 Correct 2 ms 256 KB OK (n = 12, answer = YES)
22 Correct 2 ms 376 KB OK (n = 12, answer = NO)
23 Correct 2 ms 256 KB OK (n = 12, answer = NO)
24 Correct 2 ms 256 KB OK (n = 12, answer = YES)
25 Correct 2 ms 376 KB OK (n = 12, answer = YES)
26 Correct 2 ms 376 KB OK (n = 12, answer = YES)
27 Correct 2 ms 376 KB OK (n = 12, answer = YES)
28 Correct 2 ms 376 KB OK (n = 6, answer = YES)
29 Correct 2 ms 376 KB OK (n = 12, answer = YES)
30 Correct 2 ms 380 KB OK (n = 100, answer = NO)
31 Correct 2 ms 376 KB OK (n = 100, answer = YES)
32 Correct 2 ms 256 KB OK (n = 100, answer = NO)
33 Correct 2 ms 376 KB OK (n = 100, answer = YES)
34 Correct 9 ms 376 KB OK (n = 100, answer = YES)
35 Correct 2 ms 376 KB OK (n = 100, answer = YES)
36 Correct 2 ms 376 KB OK (n = 100, answer = YES)
37 Correct 2 ms 380 KB OK (n = 28, answer = YES)
38 Correct 2 ms 376 KB OK (n = 27, answer = YES)
39 Correct 2 ms 256 KB OK (n = 90, answer = YES)
40 Correct 2 ms 376 KB OK (n = 100, answer = YES)
41 Correct 2 ms 256 KB OK (n = 100, answer = YES)
42 Correct 2 ms 256 KB OK (n = 10, answer = YES)
43 Correct 2 ms 376 KB OK (n = 100, answer = YES)
44 Correct 2 ms 376 KB OK (n = 100, answer = YES)
45 Correct 2 ms 380 KB OK (n = 100, answer = YES)
46 Correct 3 ms 504 KB OK (n = 100, answer = YES)
47 Correct 2 ms 376 KB OK (n = 100, answer = NO)
48 Correct 2 ms 256 KB OK (n = 100, answer = NO)
49 Correct 2 ms 376 KB OK (n = 100, answer = NO)
50 Correct 2 ms 256 KB OK (n = 100, answer = YES)
51 Correct 2 ms 380 KB OK (n = 100, answer = YES)
52 Correct 3 ms 256 KB OK (n = 100, answer = YES)
53 Correct 2 ms 376 KB OK (n = 100, answer = YES)
54 Correct 2 ms 376 KB OK (n = 100, answer = YES)
55 Correct 5 ms 632 KB OK (n = 10000, answer = YES)
56 Correct 5 ms 632 KB OK (n = 10000, answer = YES)
57 Correct 5 ms 632 KB OK (n = 10000, answer = YES)
58 Correct 5 ms 632 KB OK (n = 10000, answer = YES)
59 Correct 6 ms 604 KB OK (n = 10000, answer = YES)
60 Correct 5 ms 632 KB OK (n = 10000, answer = YES)
61 Correct 6 ms 632 KB OK (n = 10000, answer = NO)
62 Correct 5 ms 632 KB OK (n = 10000, answer = YES)
63 Correct 5 ms 632 KB OK (n = 10000, answer = NO)
64 Correct 5 ms 632 KB OK (n = 10000, answer = YES)
65 Correct 5 ms 632 KB OK (n = 10000, answer = YES)
66 Correct 5 ms 636 KB OK (n = 10000, answer = YES)
67 Correct 4 ms 632 KB OK (n = 10000, answer = YES)
68 Correct 4 ms 632 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 632 KB OK (n = 10000, answer = YES)
70 Correct 4 ms 632 KB OK (n = 10000, answer = YES)
71 Correct 4 ms 632 KB OK (n = 10000, answer = YES)
72 Correct 3 ms 376 KB OK (n = 865, answer = YES)
73 Correct 2 ms 376 KB OK (n = 820, answer = YES)
74 Correct 4 ms 476 KB OK (n = 7500, answer = NO)
75 Correct 5 ms 632 KB OK (n = 10000, answer = NO)
76 Correct 5 ms 656 KB OK (n = 10000, answer = NO)
77 Correct 5 ms 632 KB OK (n = 10000, answer = NO)
78 Correct 5 ms 632 KB OK (n = 10000, answer = NO)
79 Correct 6 ms 760 KB OK (n = 10000, answer = YES)
80 Correct 6 ms 632 KB OK (n = 10000, answer = YES)
81 Correct 5 ms 632 KB OK (n = 10000, answer = YES)
82 Correct 5 ms 672 KB OK (n = 10000, answer = YES)
83 Correct 5 ms 636 KB OK (n = 10000, answer = NO)
84 Correct 6 ms 632 KB OK (n = 10000, answer = YES)
85 Correct 6 ms 760 KB OK (n = 10000, answer = NO)
86 Correct 7 ms 760 KB OK (n = 10000, answer = YES)
87 Correct 6 ms 668 KB OK (n = 10000, answer = YES)
88 Correct 7 ms 632 KB OK (n = 10000, answer = YES)
89 Correct 10 ms 632 KB OK (n = 10000, answer = YES)
90 Correct 4 ms 760 KB OK (n = 10000, answer = YES)
91 Correct 4 ms 632 KB OK (n = 10000, answer = YES)
92 Correct 4 ms 632 KB OK (n = 10000, answer = YES)
93 Correct 4 ms 632 KB OK (n = 10000, answer = YES)
94 Correct 2 ms 256 KB OK (n = 1, answer = YES)
95 Correct 2 ms 376 KB OK (n = 3, answer = YES)
96 Correct 3 ms 256 KB OK (n = 3, answer = NO)
97 Correct 2 ms 376 KB OK (n = 3, answer = YES)
98 Correct 42 ms 4460 KB OK (n = 150000, answer = NO)
99 Correct 72 ms 5612 KB OK (n = 200000, answer = YES)
100 Correct 75 ms 6252 KB OK (n = 200000, answer = NO)
101 Correct 78 ms 6096 KB OK (n = 200000, answer = YES)
102 Correct 85 ms 6252 KB OK (n = 200000, answer = YES)
103 Correct 62 ms 5612 KB OK (n = 200000, answer = YES)
104 Correct 63 ms 5484 KB OK (n = 200000, answer = YES)
105 Correct 74 ms 4844 KB OK (n = 200000, answer = NO)
106 Correct 88 ms 6376 KB OK (n = 200000, answer = YES)
107 Correct 80 ms 6224 KB OK (n = 200000, answer = NO)
108 Correct 61 ms 4844 KB OK (n = 200000, answer = NO)
109 Correct 62 ms 4844 KB OK (n = 200000, answer = NO)
110 Correct 54 ms 5100 KB OK (n = 200000, answer = YES)
111 Correct 39 ms 5228 KB OK (n = 200000, answer = YES)
112 Correct 39 ms 5228 KB OK (n = 200000, answer = YES)
113 Correct 44 ms 5480 KB OK (n = 200000, answer = YES)
114 Correct 48 ms 5480 KB OK (n = 200000, answer = YES)
115 Correct 46 ms 5484 KB OK (n = 200000, answer = YES)
116 Correct 49 ms 5100 KB OK (n = 200000, answer = YES)
117 Correct 51 ms 5100 KB OK (n = 200000, answer = YES)