oj.uz

답안 #114702

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
114702 2019-06-02T11:26:39 Z kimbj0709 Detecting Molecules (IOI16_molecules) C++17
100 / 100
 55 ms 4176 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int minimum, int maximum, vector<int> w) {
  vector<pair<int,int> > vect1;
  for(int i=0;i<w.size();i++){
    vect1.push_back(make_pair(w[i],i));
  }
  vector<int> vect2;
  int pos1=0,pos2=0;
  sort(vect1.begin(),vect1.end());
  reverse(vect1.begin(),vect1.end());
  unsigned long long int count = 0;
  while(true){
     if(count>=minimum&&count<=maximum){  
        
        break;
     }
    if(pos1>pos2){

      break;
    }
    if(pos2>=vect1.size()){
      
      break;
    }
    else if(count<minimum){
      count += vect1[pos2].first;
      pos2++;
    }
    else if(count>maximum){
      count -= vect1[pos1].first;
      pos1++;
    }
    if(count>=minimum&&count<=maximum){  
        
        break;
     }

  }
  if(count>=minimum&&count<=maximum){  
        for(int i=pos1;i<pos2;i++){
          vect2.push_back(vect1[i].second);
        }
     }
  return vect2;

}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:6:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<w.size();i++){
               ~^~~~~~~~~
molecules.cpp:15:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if(count>=minimum&&count<=maximum){  
         ~~~~~^~~~~~~~~
molecules.cpp:15:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if(count>=minimum&&count<=maximum){  
                         ~~~~~^~~~~~~~~
molecules.cpp:23:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(pos2>=vect1.size()){
        ~~~~^~~~~~~~~~~~~~
molecules.cpp:27:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     else if(count<minimum){
             ~~~~~^~~~~~~~
molecules.cpp:31:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     else if(count>maximum){
             ~~~~~^~~~~~~~
molecules.cpp:35:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(count>=minimum&&count<=maximum){  
        ~~~~~^~~~~~~~~
molecules.cpp:35:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(count>=minimum&&count<=maximum){  
                        ~~~~~^~~~~~~~~
molecules.cpp:41:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(count>=minimum&&count<=maximum){  
      ~~~~~^~~~~~~~~
molecules.cpp:41:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(count>=minimum&&count<=maximum){  
                      ~~~~~^~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

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