oj.uz

답안 #770653

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770653 2023-07-01T15:12:44 Z Benmath Detecting Molecules (IOI16_molecules) C++14
100 / 100
 45 ms 8228 KB 


#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
   long long int sum=0;
   vector<int>ans;
   vector<pair<long long int,int> >arr;
   int n=w.size();
   for(int i=0;i<w.size();i++){
    arr.push_back({w[i],i});
   }
   sort(arr.begin(),arr.end());
   if(arr[0].first>u){
    return ans;
   }else if(arr[0].first>=l and arr[0].first<=u){
   ans.push_back(arr[0].second);
   return ans;
   }else{
   if(arr[n-1].first>=l and arr[n-1].first<=u){
    ans.push_back(arr[n-1].second);
    return ans;
   }else{
   int ti1=0;
   int ti2=-1;
   long long int sum=0;
   for(int i=0;i<n;i++){
    sum=sum+arr[i].first;
    if(sum<l){
        ti1=i;
    }else if(sum>=l and sum<=u){
        for(int j=0;j<=i;j++){
            ans.push_back(arr[j].second);
        }
        return ans;
    }else{
        ti2=i;
        break;
    }
   }
if(ti2==-1){
    return ans;
}else{
long long int sum1=0;
for(int i=n-1;i>=(n-ti1-1);i--){
    sum1=sum1+arr[i].first;
}
if(sum1<l){
    return ans;
}
int j=n-1;
sum=sum-arr[ti2].first;
for(int i=ti1;i>=0;i--){
    sum=sum+arr[j].first-arr[i].first;
    if(sum>=l and sum<=u){
        for(int k=0;k<i;k++){
            ans.push_back(arr[k].second);
        }
        for(int k=j;k<=(n-1);k++){
            ans.push_back(arr[k].second);
        }
        return ans;
    }
    j--;
}
}
   }
   }
   for(int i=0;i<w.size();i++){
    if(w[i]<=u){
        sum=sum+w[i];
        ans.push_back(i);
    }
    if(sum>=l and sum<=u){
        break;
    }
   }
   if(sum>=l and sum<=u){
    return ans;
   }else{
   ans.clear();
   return ans;}
}
/*
int main() {
    int n, l, u;
    assert(3 == scanf("%d %d %d", &n, &l, &u));
    std::vector<int> w(n);
    for (int i = 0; i < n; i++)
        assert(1 == scanf("%d", &w[i]));
    std::vector<int> result = find_subset(l, u, w);


    printf("%d\n", (int)result.size());
    for (int i = 0; i < (int)result.size(); i++)
        printf("%d%c", result[i], " \n"[i == (int)result.size() - 1]);
}
*/

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: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |    for(int i=0;i<w.size();i++){
      |                ~^~~~~~~~~
molecules.cpp:71:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |    for(int i=0;i<w.size();i++){
      |                ~^~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB OK (n = 1, answer = NO)
2 Correct 0 ms 212 KB OK (n = 1, answer = NO)
3 Correct 0 ms 212 KB OK (n = 1, answer = YES)
4 Correct 0 ms 212 KB OK (n = 2, answer = YES)
5 Correct 0 ms 212 KB OK (n = 2, answer = YES)
6 Correct 0 ms 212 KB OK (n = 3, answer = YES)
7 Correct 0 ms 212 KB OK (n = 3, answer = YES)
8 Correct 0 ms 212 KB OK (n = 3, answer = YES)
9 Correct 0 ms 212 KB OK (n = 3, answer = YES)
10 Correct 0 ms 212 KB OK (n = 3, answer = YES)
11 Correct 0 ms 212 KB OK (n = 3, answer = YES)
12 Correct 0 ms 212 KB OK (n = 3, answer = YES)
13 Correct 0 ms 212 KB OK (n = 3, answer = NO)
14 Correct 0 ms 212 KB OK (n = 3, answer = YES)
15 Correct 0 ms 212 KB OK (n = 3, answer = YES)
16 Correct 0 ms 212 KB OK (n = 3, answer = NO)
17 Correct 0 ms 212 KB OK (n = 3, answer = NO)
18 Correct 0 ms 212 KB OK (n = 100, answer = NO)
19 Correct 0 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 1 ms 212 KB OK (n = 12, answer = YES)
22 Correct 1 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 296 KB OK (n = 12, answer = YES)
25 Correct 0 ms 212 KB OK (n = 12, answer = YES)
26 Correct 0 ms 212 KB OK (n = 12, answer = YES)
27 Correct 0 ms 212 KB OK (n = 12, answer = YES)
28 Correct 0 ms 212 KB OK (n = 6, answer = YES)
29 Correct 0 ms 212 KB OK (n = 12, answer = YES)
30 Correct 0 ms 212 KB OK (n = 100, answer = NO)
31 Correct 0 ms 212 KB OK (n = 100, answer = YES)
32 Correct 0 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 1 ms 212 KB OK (n = 100, answer = YES)
35 Correct 1 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 ms 212 KB OK (n = 100, answer = YES)
37 Correct 1 ms 212 KB OK (n = 28, answer = YES)
38 Correct 1 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 292 KB OK (n = 90, answer = YES)
40 Correct 0 ms 300 KB OK (n = 100, answer = YES)
41 Correct 0 ms 212 KB OK (n = 100, answer = YES)
42 Correct 0 ms 212 KB OK (n = 10, answer = YES)
43 Correct 0 ms 212 KB OK (n = 100, answer = YES)
44 Correct 0 ms 212 KB OK (n = 100, answer = YES)
45 Correct 0 ms 292 KB OK (n = 100, answer = YES)
46 Correct 1 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 296 KB OK (n = 100, answer = NO)
48 Correct 0 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 304 KB OK (n = 100, answer = NO)
50 Correct 0 ms 212 KB OK (n = 100, answer = YES)
51 Correct 0 ms 212 KB OK (n = 100, answer = YES)
52 Correct 1 ms 212 KB OK (n = 100, answer = YES)
53 Correct 1 ms 340 KB OK (n = 100, answer = YES)
54 Correct 1 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 772 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 696 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
69 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 296 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 KB OK (n = 820, answer = YES)
74 Correct 1 ms 596 KB OK (n = 7500, answer = NO)
75 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 724 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 696 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 692 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 700 KB OK (n = 10000, answer = YES)
80 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
82 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 824 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 852 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 824 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 824 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
90 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
94 Correct 0 ms 212 KB OK (n = 1, answer = YES)
95 Correct 0 ms 212 KB OK (n = 3, answer = YES)
96 Correct 0 ms 212 KB OK (n = 3, answer = NO)
97 Correct 1 ms 300 KB OK (n = 3, answer = YES)
98 Correct 25 ms 6488 KB OK (n = 150000, answer = NO)
99 Correct 36 ms 7584 KB OK (n = 200000, answer = YES)
100 Correct 45 ms 8228 KB OK (n = 200000, answer = NO)
101 Correct 38 ms 7456 KB OK (n = 200000, answer = YES)
102 Correct 35 ms 8084 KB OK (n = 200000, answer = YES)
103 Correct 36 ms 7616 KB OK (n = 200000, answer = YES)
104 Correct 36 ms 7456 KB OK (n = 200000, answer = YES)
105 Correct 35 ms 6816 KB OK (n = 200000, answer = NO)
106 Correct 40 ms 7336 KB OK (n = 200000, answer = YES)
107 Correct 36 ms 8228 KB OK (n = 200000, answer = NO)
108 Correct 40 ms 6816 KB OK (n = 200000, answer = NO)
109 Correct 34 ms 6820 KB OK (n = 200000, answer = NO)
110 Correct 31 ms 7072 KB OK (n = 200000, answer = YES)
111 Correct 25 ms 7220 KB OK (n = 200000, answer = YES)
112 Correct 23 ms 7092 KB OK (n = 200000, answer = YES)
113 Correct 24 ms 7232 KB OK (n = 200000, answer = YES)
114 Correct 24 ms 7228 KB OK (n = 200000, answer = YES)
115 Correct 25 ms 7240 KB OK (n = 200000, answer = YES)
116 Correct 31 ms 7072 KB OK (n = 200000, answer = YES)
117 Correct 33 ms 7108 KB OK (n = 200000, answer = YES)