답안 #295776

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
295776 2020-09-09T23:03:42 Z aZvezda Detecting Molecules (IOI16_molecules) C++14
100 / 100
62 ms 8296 KB
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
template<class T> inline void fix(T &x) {if(x >= mod | x <= -mod) {x %= mod;} if(x < 0) {x += mod;}}
#define out(x) cout << __LINE__ << ": " << (#x) << " = " << (x) << endl

#include "molecules.h"

std::vector<int> find_subset(int d, int u, std::vector<int> nt) {
    vector<pair<ll, int> > w;
    for(int i = 0; i < nt.size(); i ++) {
        w.push_back({nt[i], i});
    }
    sort(w.begin(), w.end());
    ll sum = 0, l = 0;
    for(int r = 0; r < w.size(); r ++) {
        sum += (ll)w[r].first;
        while(sum > u) {
            sum -= (ll)w[l].first;
            l ++;
        }
        if(d <= sum && sum <= u) {
            vector<int> ret;
            for(int i = l; i <= r; i ++) {
                ret.push_back(w[i].second);
            }
            return ret;
        }
    }
    return std::vector<int>(0);
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:19:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(int i = 0; i < nt.size(); i ++) {
      |                    ~~^~~~~~~~~~~
molecules.cpp:24:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int r = 0; r < w.size(); r ++) {
      |                    ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 1 ms 256 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 256 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB OK (n = 12, answer = YES)
2 Correct 0 ms 256 KB OK (n = 12, answer = YES)
3 Correct 0 ms 256 KB OK (n = 12, answer = NO)
4 Correct 0 ms 256 KB OK (n = 12, answer = NO)
5 Correct 0 ms 256 KB OK (n = 12, answer = YES)
6 Correct 0 ms 256 KB OK (n = 12, answer = YES)
7 Correct 0 ms 256 KB OK (n = 12, answer = YES)
8 Correct 0 ms 256 KB OK (n = 12, answer = YES)
9 Correct 0 ms 256 KB OK (n = 6, answer = YES)
10 Correct 0 ms 256 KB OK (n = 12, answer = YES)
11 Correct 1 ms 256 KB OK (n = 100, answer = NO)
12 Correct 0 ms 256 KB OK (n = 100, answer = YES)
13 Correct 0 ms 256 KB OK (n = 100, answer = NO)
14 Correct 0 ms 256 KB OK (n = 100, answer = YES)
15 Correct 0 ms 256 KB OK (n = 100, answer = YES)
16 Correct 0 ms 256 KB OK (n = 100, answer = YES)
17 Correct 0 ms 256 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 1 ms 256 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 256 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 256 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 0 ms 256 KB OK (n = 100, answer = YES)
36 Correct 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 0 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 ms 256 KB OK (n = 100, answer = YES)
46 Correct 0 ms 256 KB OK (n = 100, answer = YES)
47 Correct 1 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 0 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 1 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 1 ms 256 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 256 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 256 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 0 ms 256 KB OK (n = 100, answer = YES)
36 Correct 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 0 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 ms 256 KB OK (n = 100, answer = YES)
46 Correct 0 ms 256 KB OK (n = 100, answer = YES)
47 Correct 1 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 0 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 1 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 896 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 896 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
71 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 1 ms 256 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 256 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 256 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 0 ms 256 KB OK (n = 100, answer = YES)
36 Correct 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 0 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 ms 256 KB OK (n = 100, answer = YES)
46 Correct 0 ms 256 KB OK (n = 100, answer = YES)
47 Correct 1 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 0 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 1 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 896 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 896 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
71 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
74 Correct 2 ms 640 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 768 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 896 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 896 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 896 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 896 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB OK (n = 1, answer = NO)
2 Correct 1 ms 256 KB OK (n = 1, answer = NO)
3 Correct 1 ms 256 KB OK (n = 1, answer = YES)
4 Correct 0 ms 256 KB OK (n = 2, answer = YES)
5 Correct 0 ms 256 KB OK (n = 2, answer = YES)
6 Correct 1 ms 256 KB OK (n = 3, answer = YES)
7 Correct 0 ms 256 KB OK (n = 3, answer = YES)
8 Correct 1 ms 256 KB OK (n = 3, answer = YES)
9 Correct 0 ms 256 KB OK (n = 3, answer = YES)
10 Correct 0 ms 256 KB OK (n = 3, answer = YES)
11 Correct 0 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 ms 256 KB OK (n = 3, answer = NO)
14 Correct 0 ms 256 KB OK (n = 3, answer = YES)
15 Correct 0 ms 256 KB OK (n = 3, answer = YES)
16 Correct 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 1 ms 256 KB OK (n = 3, answer = NO)
18 Correct 1 ms 256 KB OK (n = 100, answer = NO)
19 Correct 1 ms 256 KB OK (n = 100, answer = YES)
20 Correct 0 ms 256 KB OK (n = 12, answer = YES)
21 Correct 0 ms 256 KB OK (n = 12, answer = YES)
22 Correct 0 ms 256 KB OK (n = 12, answer = NO)
23 Correct 0 ms 256 KB OK (n = 12, answer = NO)
24 Correct 0 ms 256 KB OK (n = 12, answer = YES)
25 Correct 0 ms 256 KB OK (n = 12, answer = YES)
26 Correct 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 0 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 0 ms 256 KB OK (n = 12, answer = YES)
30 Correct 1 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 256 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 0 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 ms 256 KB OK (n = 100, answer = YES)
35 Correct 0 ms 256 KB OK (n = 100, answer = YES)
36 Correct 0 ms 256 KB OK (n = 100, answer = YES)
37 Correct 0 ms 256 KB OK (n = 28, answer = YES)
38 Correct 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 1 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 0 ms 256 KB OK (n = 100, answer = YES)
42 Correct 0 ms 256 KB OK (n = 10, answer = YES)
43 Correct 0 ms 256 KB OK (n = 100, answer = YES)
44 Correct 0 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 ms 256 KB OK (n = 100, answer = YES)
46 Correct 0 ms 256 KB OK (n = 100, answer = YES)
47 Correct 1 ms 256 KB OK (n = 100, answer = NO)
48 Correct 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 0 ms 256 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 1 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
57 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
58 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
61 Correct 3 ms 896 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 896 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
66 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
71 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 384 KB OK (n = 865, answer = YES)
73 Correct 1 ms 384 KB OK (n = 820, answer = YES)
74 Correct 2 ms 640 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
77 Correct 4 ms 768 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
81 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 896 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 896 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 896 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 896 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 896 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 256 KB OK (n = 1, answer = YES)
95 Correct 1 ms 256 KB OK (n = 3, answer = YES)
96 Correct 0 ms 256 KB OK (n = 3, answer = NO)
97 Correct 0 ms 256 KB OK (n = 3, answer = YES)
98 Correct 44 ms 6632 KB OK (n = 150000, answer = NO)
99 Correct 57 ms 7656 KB OK (n = 200000, answer = YES)
100 Correct 60 ms 8296 KB OK (n = 200000, answer = NO)
101 Correct 58 ms 7536 KB OK (n = 200000, answer = YES)
102 Correct 62 ms 8168 KB OK (n = 200000, answer = YES)
103 Correct 56 ms 7656 KB OK (n = 200000, answer = YES)
104 Correct 54 ms 7528 KB OK (n = 200000, answer = YES)
105 Correct 52 ms 6888 KB OK (n = 200000, answer = NO)
106 Correct 59 ms 7408 KB OK (n = 200000, answer = YES)
107 Correct 62 ms 8296 KB OK (n = 200000, answer = NO)
108 Correct 51 ms 6888 KB OK (n = 200000, answer = NO)
109 Correct 51 ms 6896 KB OK (n = 200000, answer = NO)
110 Correct 45 ms 7144 KB OK (n = 200000, answer = YES)
111 Correct 38 ms 7272 KB OK (n = 200000, answer = YES)
112 Correct 39 ms 7272 KB OK (n = 200000, answer = YES)
113 Correct 39 ms 7272 KB OK (n = 200000, answer = YES)
114 Correct 40 ms 7272 KB OK (n = 200000, answer = YES)
115 Correct 40 ms 7272 KB OK (n = 200000, answer = YES)
116 Correct 46 ms 7144 KB OK (n = 200000, answer = YES)
117 Correct 47 ms 7144 KB OK (n = 200000, answer = YES)