oj.uz

답안 #348757

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
348757 2021-01-15T16:16:06 Z NachoLibre Detecting Molecules (IOI16_molecules) C++14
100 / 100
 105 ms 13660 KB 
#include <bits/stdc++.h>
using namespace std;
#ifndef wambule
#include "molecules.h"
#endif

vector<int> find_subset(int l, int u, vector<int> wi) {
    int n = wi.size();
    vector<pair<int, int> > w;
    for(int i = 0; i < n; ++i) {
        w.push_back({wi[i], i});
    }
    sort(w.begin(), w.end());
    vector<int> dr;
    multiset<int> s;
    unsigned int sm = 0;
    int fl = -1, fr;
    for(int i = n - 1; i >= 0; --i) {
        sm += w[i].first;
        if(sm >= l) {
            if(sm <= u) {
                fl = 0;
                fr = sm;
            }
            break;
        }
        s.insert(sm);
    }
    sm = 0;
    for(int i = 0; i < n; ++i) {
        if(i + (int)s.size() == n) s.erase(--s.end());
        sm += w[i].first;
        if(sm >= l) {
            if(sm <= u) {
                fl = sm;
                fr = 0;
            }
            break;
        }
        auto it = s.lower_bound(l - sm);
        if(it != s.end() && sm + *it <= u) {
            fl = sm;
            fr = *it;
            break;
        }
    }
    if(fl != -1) {
        sm = 0;
        for(int i = 0; i < n; ++i) {
            sm += w[i].first;
            if(sm > fl) break;
            dr.push_back(w[i].second);
        }
        sm = 0;
        for(int i = n - 1; i >= 0; --i) {
            sm += w[i].first;
            if(sm > fr) break;
            dr.push_back(w[i].second);
        }
    }
    assert((int)dr.size() <= n && (dr.size() || fl == -1));
    return dr;
}

#ifdef wambule
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	return 0;
}
#endif

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:20:15: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   20 |         if(sm >= l) {
      |            ~~~^~~~
molecules.cpp:21:19: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   21 |             if(sm <= u) {
      |                ~~~^~~~
molecules.cpp:33:15: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   33 |         if(sm >= l) {
      |            ~~~^~~~
molecules.cpp:34:19: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   34 |             if(sm <= u) {
      |                ~~~^~~~
molecules.cpp:41:38: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   41 |         if(it != s.end() && sm + *it <= u) {
      |                             ~~~~~~~~~^~~~
molecules.cpp:51:19: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   51 |             if(sm > fl) break;
      |                ~~~^~~~
molecules.cpp:57:19: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   57 |             if(sm > fr) break;
      |                ~~~^~~~

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 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 0 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 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 0 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 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 0 ms 364 KB OK (n = 12, answer = NO)
4 Correct 0 ms 364 KB OK (n = 12, answer = NO)
5 Correct 0 ms 364 KB OK (n = 12, answer = YES)
6 Correct 0 ms 364 KB OK (n = 12, answer = YES)
7 Correct 0 ms 364 KB OK (n = 12, answer = YES)
8 Correct 0 ms 364 KB OK (n = 12, answer = YES)
9 Correct 0 ms 364 KB OK (n = 6, answer = YES)
10 Correct 0 ms 364 KB OK (n = 12, answer = YES)
11 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
16 Correct 0 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 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 0 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 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 0 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 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 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 ms 364 KB OK (n = 12, answer = NO)
24 Correct 0 ms 364 KB OK (n = 12, answer = YES)
25 Correct 0 ms 364 KB OK (n = 12, answer = YES)
26 Correct 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 0 ms 364 KB OK (n = 12, answer = YES)
28 Correct 0 ms 364 KB OK (n = 6, answer = YES)
29 Correct 0 ms 364 KB OK (n = 12, answer = YES)
30 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
35 Correct 0 ms 364 KB OK (n = 100, answer = YES)
36 Correct 1 ms 364 KB OK (n = 100, answer = YES)
37 Correct 0 ms 364 KB OK (n = 28, answer = YES)
38 Correct 0 ms 364 KB OK (n = 27, answer = YES)
39 Correct 0 ms 364 KB OK (n = 90, answer = YES)
40 Correct 0 ms 364 KB OK (n = 100, answer = YES)
41 Correct 0 ms 364 KB OK (n = 100, answer = YES)
42 Correct 0 ms 364 KB OK (n = 10, answer = YES)
43 Correct 1 ms 364 KB OK (n = 100, answer = YES)
44 Correct 0 ms 364 KB OK (n = 100, answer = YES)
45 Correct 0 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 35 ms 384 KB OK (n = 100, answer = YES)
53 Correct 22 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 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 0 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 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 0 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 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 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 ms 364 KB OK (n = 12, answer = NO)
24 Correct 0 ms 364 KB OK (n = 12, answer = YES)
25 Correct 0 ms 364 KB OK (n = 12, answer = YES)
26 Correct 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 0 ms 364 KB OK (n = 12, answer = YES)
28 Correct 0 ms 364 KB OK (n = 6, answer = YES)
29 Correct 0 ms 364 KB OK (n = 12, answer = YES)
30 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
35 Correct 0 ms 364 KB OK (n = 100, answer = YES)
36 Correct 1 ms 364 KB OK (n = 100, answer = YES)
37 Correct 0 ms 364 KB OK (n = 28, answer = YES)
38 Correct 0 ms 364 KB OK (n = 27, answer = YES)
39 Correct 0 ms 364 KB OK (n = 90, answer = YES)
40 Correct 0 ms 364 KB OK (n = 100, answer = YES)
41 Correct 0 ms 364 KB OK (n = 100, answer = YES)
42 Correct 0 ms 364 KB OK (n = 10, answer = YES)
43 Correct 1 ms 364 KB OK (n = 100, answer = YES)
44 Correct 0 ms 364 KB OK (n = 100, answer = YES)
45 Correct 0 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 35 ms 384 KB OK (n = 100, answer = YES)
53 Correct 22 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 100 ms 684 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 640 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 620 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 640 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 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 0 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 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 0 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 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 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 ms 364 KB OK (n = 12, answer = NO)
24 Correct 0 ms 364 KB OK (n = 12, answer = YES)
25 Correct 0 ms 364 KB OK (n = 12, answer = YES)
26 Correct 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 0 ms 364 KB OK (n = 12, answer = YES)
28 Correct 0 ms 364 KB OK (n = 6, answer = YES)
29 Correct 0 ms 364 KB OK (n = 12, answer = YES)
30 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
35 Correct 0 ms 364 KB OK (n = 100, answer = YES)
36 Correct 1 ms 364 KB OK (n = 100, answer = YES)
37 Correct 0 ms 364 KB OK (n = 28, answer = YES)
38 Correct 0 ms 364 KB OK (n = 27, answer = YES)
39 Correct 0 ms 364 KB OK (n = 90, answer = YES)
40 Correct 0 ms 364 KB OK (n = 100, answer = YES)
41 Correct 0 ms 364 KB OK (n = 100, answer = YES)
42 Correct 0 ms 364 KB OK (n = 10, answer = YES)
43 Correct 1 ms 364 KB OK (n = 100, answer = YES)
44 Correct 0 ms 364 KB OK (n = 100, answer = YES)
45 Correct 0 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 35 ms 384 KB OK (n = 100, answer = YES)
53 Correct 22 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 100 ms 684 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 640 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 620 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 640 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 748 KB OK (n = 7500, answer = NO)
75 Correct 6 ms 1004 KB OK (n = 10000, answer = NO)
76 Correct 5 ms 1004 KB OK (n = 10000, answer = NO)
77 Correct 5 ms 1004 KB OK (n = 10000, answer = NO)
78 Correct 4 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 620 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 748 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 69 ms 620 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
92 Correct 69 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 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 0 ms 364 KB OK (n = 2, answer = YES)
5 Correct 0 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 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 0 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 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 0 ms 364 KB OK (n = 12, answer = NO)
23 Correct 0 ms 364 KB OK (n = 12, answer = NO)
24 Correct 0 ms 364 KB OK (n = 12, answer = YES)
25 Correct 0 ms 364 KB OK (n = 12, answer = YES)
26 Correct 0 ms 364 KB OK (n = 12, answer = YES)
27 Correct 0 ms 364 KB OK (n = 12, answer = YES)
28 Correct 0 ms 364 KB OK (n = 6, answer = YES)
29 Correct 0 ms 364 KB OK (n = 12, answer = YES)
30 Correct 0 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 0 ms 364 KB OK (n = 100, answer = YES)
35 Correct 0 ms 364 KB OK (n = 100, answer = YES)
36 Correct 1 ms 364 KB OK (n = 100, answer = YES)
37 Correct 0 ms 364 KB OK (n = 28, answer = YES)
38 Correct 0 ms 364 KB OK (n = 27, answer = YES)
39 Correct 0 ms 364 KB OK (n = 90, answer = YES)
40 Correct 0 ms 364 KB OK (n = 100, answer = YES)
41 Correct 0 ms 364 KB OK (n = 100, answer = YES)
42 Correct 0 ms 364 KB OK (n = 10, answer = YES)
43 Correct 1 ms 364 KB OK (n = 100, answer = YES)
44 Correct 0 ms 364 KB OK (n = 100, answer = YES)
45 Correct 0 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 35 ms 384 KB OK (n = 100, answer = YES)
53 Correct 22 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 100 ms 684 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 640 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 620 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 640 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 748 KB OK (n = 7500, answer = NO)
75 Correct 6 ms 1004 KB OK (n = 10000, answer = NO)
76 Correct 5 ms 1004 KB OK (n = 10000, answer = NO)
77 Correct 5 ms 1004 KB OK (n = 10000, answer = NO)
78 Correct 4 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 620 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 748 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 69 ms 620 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 640 KB OK (n = 10000, answer = YES)
91 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
92 Correct 69 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 77 ms 10588 KB OK (n = 150000, answer = NO)
99 Correct 53 ms 5600 KB OK (n = 200000, answer = YES)
100 Correct 58 ms 6240 KB OK (n = 200000, answer = NO)
101 Correct 60 ms 6108 KB OK (n = 200000, answer = YES)
102 Correct 56 ms 6112 KB OK (n = 200000, answer = YES)
103 Correct 53 ms 5600 KB OK (n = 200000, answer = YES)
104 Correct 51 ms 5472 KB OK (n = 200000, answer = YES)
105 Correct 105 ms 13660 KB OK (n = 200000, answer = NO)
106 Correct 56 ms 5724 KB OK (n = 200000, answer = YES)
107 Correct 55 ms 6240 KB OK (n = 200000, answer = NO)
108 Correct 105 ms 13660 KB OK (n = 200000, answer = NO)
109 Correct 103 ms 13660 KB OK (n = 200000, answer = NO)
110 Correct 43 ms 5088 KB OK (n = 200000, answer = YES)
111 Correct 35 ms 5216 KB OK (n = 200000, answer = YES)
112 Correct 34 ms 5216 KB OK (n = 200000, answer = YES)
113 Correct 40 ms 5468 KB OK (n = 200000, answer = YES)
114 Correct 41 ms 5468 KB OK (n = 200000, answer = YES)
115 Correct 39 ms 5468 KB OK (n = 200000, answer = YES)
116 Correct 42 ms 5088 KB OK (n = 200000, answer = YES)
117 Correct 43 ms 5232 KB OK (n = 200000, answer = YES)