oj.uz

답안 #319894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
319894 2020-11-06T16:56:57 Z tjdgus4384 Detecting Molecules (IOI16_molecules) C++14
100 / 100
 59 ms 6236 KB 
#include<bits/stdc++.h>
#include "molecules.h"
using namespace std;

vector<int> find_subset(int l, int u, vector<int> w) {
    long long sum1, sum2;
    vector<pair<int, int> > v;
    for(int i = 0;i < w.size();i++){
        v.push_back({w[i], i});
    }
    sort(v.begin(), v.end());
    for(int i = 0;i < v.size();i++){
        sum1 += (long long)v[i].first; sum2 += (long long)v[v.size()-1-i].first;
        if(sum1 > u) return vector<int>(0);
        if(sum2 < l) continue;
        else{
            for(int j = i+1;j < v.size();j++){
                if(sum1 >= l){
                    vector<int> ans;
                    for(int k = j-i-1;k <= j-1;k++) ans.push_back(v[k].second);
                    sort(ans.begin(), ans.end());
                    return ans;
                }
                sum1 += (long long)(v[j].first - v[j-i-1].first);
            }
            if(sum1 >= l){
                vector<int> ans;
                for(int k = v.size()-i-1;k <= v.size()-1;k++) ans.push_back(v[k].second);
                sort(ans.begin(), ans.end());
                return ans;
            }
        }
    }
    return vector<int>(0);
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:8:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for(int i = 0;i < w.size();i++){
      |                   ~~^~~~~~~~~~
molecules.cpp:12:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(int i = 0;i < v.size();i++){
      |                   ~~^~~~~~~~~~
molecules.cpp:17:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |             for(int j = i+1;j < v.size();j++){
      |                             ~~^~~~~~~~~~
molecules.cpp:28:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |                 for(int k = v.size()-i-1;k <= v.size()-1;k++) ans.push_back(v[k].second);
      |                                          ~~^~~~~~~~~~~~~
molecules.cpp:13:14: warning: 'sum1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   13 |         sum1 += (long long)v[i].first; sum2 += (long long)v[v.size()-1-i].first;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
molecules.cpp:13:45: warning: 'sum2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   13 |         sum1 += (long long)v[i].first; sum2 += (long long)v[v.size()-1-i].first;
      |                                        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 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 492 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 492 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 1 ms 236 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 492 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 268 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 1 ms 364 KB OK (n = 12, answer = YES)
3 Correct 1 ms 364 KB OK (n = 12, answer = NO)
4 Correct 1 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 384 KB OK (n = 12, answer = YES)
8 Correct 1 ms 364 KB OK (n = 12, answer = YES)
9 Correct 1 ms 492 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 492 KB OK (n = 100, answer = NO)
14 Correct 1 ms 492 KB OK (n = 100, answer = YES)
15 Correct 1 ms 364 KB OK (n = 100, answer = YES)
16 Correct 1 ms 512 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 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 492 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 492 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 1 ms 236 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 492 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 268 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 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 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 384 KB OK (n = 12, answer = YES)
27 Correct 1 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 492 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 492 KB OK (n = 100, answer = NO)
33 Correct 1 ms 492 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 512 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 364 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 492 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 396 KB OK (n = 100, answer = NO)
49 Correct 1 ms 492 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 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 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 492 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 492 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 1 ms 236 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 492 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 268 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 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 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 384 KB OK (n = 12, answer = YES)
27 Correct 1 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 492 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 492 KB OK (n = 100, answer = NO)
33 Correct 1 ms 492 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 512 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 364 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 492 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 396 KB OK (n = 100, answer = NO)
49 Correct 1 ms 492 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 364 KB OK (n = 100, answer = YES)
55 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 620 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 748 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 748 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 748 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 748 KB OK (n = 10000, answer = YES)
67 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 652 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 512 KB OK (n = 865, answer = YES)
73 Correct 1 ms 492 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 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 492 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 492 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 1 ms 236 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 492 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 268 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 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 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 384 KB OK (n = 12, answer = YES)
27 Correct 1 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 492 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 492 KB OK (n = 100, answer = NO)
33 Correct 1 ms 492 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 512 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 364 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 492 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 396 KB OK (n = 100, answer = NO)
49 Correct 1 ms 492 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 364 KB OK (n = 100, answer = YES)
55 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 620 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 748 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 748 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 748 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 748 KB OK (n = 10000, answer = YES)
67 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 652 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 512 KB OK (n = 865, answer = YES)
73 Correct 1 ms 492 KB OK (n = 820, answer = YES)
74 Correct 2 ms 492 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 620 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 744 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 796 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 876 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 748 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 620 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
93 Correct 2 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 1 ms 364 KB OK (n = 1, answer = NO)
3 Correct 1 ms 364 KB OK (n = 1, answer = YES)
4 Correct 1 ms 492 KB OK (n = 2, answer = YES)
5 Correct 1 ms 364 KB OK (n = 2, answer = YES)
6 Correct 1 ms 364 KB OK (n = 3, answer = YES)
7 Correct 1 ms 364 KB OK (n = 3, answer = YES)
8 Correct 1 ms 492 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 1 ms 236 KB OK (n = 3, answer = YES)
12 Correct 1 ms 364 KB OK (n = 3, answer = YES)
13 Correct 1 ms 492 KB OK (n = 3, answer = NO)
14 Correct 1 ms 364 KB OK (n = 3, answer = YES)
15 Correct 1 ms 364 KB OK (n = 3, answer = YES)
16 Correct 1 ms 364 KB OK (n = 3, answer = NO)
17 Correct 1 ms 364 KB OK (n = 3, answer = NO)
18 Correct 1 ms 268 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 1 ms 364 KB OK (n = 12, answer = YES)
22 Correct 1 ms 364 KB OK (n = 12, answer = NO)
23 Correct 1 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 384 KB OK (n = 12, answer = YES)
27 Correct 1 ms 364 KB OK (n = 12, answer = YES)
28 Correct 1 ms 492 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 492 KB OK (n = 100, answer = NO)
33 Correct 1 ms 492 KB OK (n = 100, answer = YES)
34 Correct 1 ms 364 KB OK (n = 100, answer = YES)
35 Correct 1 ms 512 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 364 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 492 KB OK (n = 100, answer = YES)
47 Correct 1 ms 364 KB OK (n = 100, answer = NO)
48 Correct 1 ms 396 KB OK (n = 100, answer = NO)
49 Correct 1 ms 492 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 364 KB OK (n = 100, answer = YES)
55 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 620 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 748 KB OK (n = 10000, answer = YES)
60 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
61 Correct 4 ms 748 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 748 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 748 KB OK (n = 10000, answer = YES)
67 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 652 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
70 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 512 KB OK (n = 865, answer = YES)
73 Correct 1 ms 492 KB OK (n = 820, answer = YES)
74 Correct 2 ms 492 KB OK (n = 7500, answer = NO)
75 Correct 4 ms 620 KB OK (n = 10000, answer = NO)
76 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 744 KB OK (n = 10000, answer = NO)
78 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 796 KB OK (n = 10000, answer = YES)
80 Correct 5 ms 876 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 748 KB OK (n = 10000, answer = YES)
85 Correct 3 ms 620 KB OK (n = 10000, answer = NO)
86 Correct 4 ms 620 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
88 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
89 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 620 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 748 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 748 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 620 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 512 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 37 ms 4448 KB OK (n = 150000, answer = NO)
99 Correct 56 ms 5592 KB OK (n = 200000, answer = YES)
100 Correct 59 ms 6236 KB OK (n = 200000, answer = NO)
101 Correct 59 ms 5472 KB OK (n = 200000, answer = YES)
102 Correct 55 ms 6104 KB OK (n = 200000, answer = YES)
103 Correct 54 ms 5592 KB OK (n = 200000, answer = YES)
104 Correct 55 ms 5472 KB OK (n = 200000, answer = YES)
105 Correct 51 ms 4824 KB OK (n = 200000, answer = NO)
106 Correct 59 ms 5376 KB OK (n = 200000, answer = YES)
107 Correct 53 ms 6232 KB OK (n = 200000, answer = NO)
108 Correct 52 ms 4960 KB OK (n = 200000, answer = NO)
109 Correct 49 ms 4824 KB OK (n = 200000, answer = NO)
110 Correct 44 ms 5084 KB OK (n = 200000, answer = YES)
111 Correct 36 ms 5216 KB OK (n = 200000, answer = YES)
112 Correct 36 ms 5216 KB OK (n = 200000, answer = YES)
113 Correct 38 ms 5208 KB OK (n = 200000, answer = YES)
114 Correct 38 ms 5216 KB OK (n = 200000, answer = YES)
115 Correct 50 ms 5212 KB OK (n = 200000, answer = YES)
116 Correct 43 ms 5080 KB OK (n = 200000, answer = YES)
117 Correct 45 ms 5216 KB OK (n = 200000, answer = YES)