oj.uz

답안 #521719

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521719 2022-02-02T19:55:22 Z MateGiorbelidze Detecting Molecules (IOI16_molecules) C++14
100 / 100
 48 ms 8608 KB 
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;

#define ll unsigned long long
#define ff first
#define sc second
#define pb push_back

vector<int> find_subset(int l, int r, vector<int> b) {
    vector <int> ans(0);
    
    ll n = b.size() , p [n + 1] , cnt  = 0 , j = 0;
    
    vector < pair<int,int> > a(n) , used(n);
    
    for (int i = 0 ; i < n; i++){
    	a[i].ff = b[i];
    	a[i].sc = i;
	}
    	
    
    sort(a.begin(),a.end());
    
    p[0] = a[0].ff; 
	if (a[0].ff >= l && a[0].ff <= r) {
    	
    	ans.pb(0);
    	
    	return ans;
    	
	}
    
    for (int i = 1; i < n; i++) {
    	
    	p[i] = p[i - 1] + a[i].ff;
    	
    	if (p[i] >= l && p[i] <= r) {
    		
    		j = i; break;
    		
		}
		
		if (p[i] > r) {
    		
	    	cnt = i ;
			
			break;
			
		}
    	
	}
	
	if (j == 0 && cnt == 0) return ans;
	
	if (cnt == 0) {
		
		for (int i = 0; i <= j; i++) {
			
			ans.pb(a[i].sc);
			
		}
		
	}
	else {
	
		ll s = p[cnt - 1];
		
		for (int i = 0; i < cnt; i++) {
			
			s -= a[i].ff;
			
			s += a[n - i - 1].ff;
			
			if (s >= l && s <= r) {
    		
	    		j = i + 1;
	    		
	    		break;
	    		
			}	 
			
		}
		
		if (j == 0) return ans;
		
		for (int i = j; i < cnt; i++) {
			
			ans.pb(a[i].sc);
			
		}
		
		for (int i = n - j; i < n; i++) {
			
			ans.pb(a[i].sc);
			
		}
		
	}
	
	
	sort(ans.begin(),ans.end());
	
	
	return ans;
	
    
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:17:24: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   17 |     for (int i = 0 ; i < n; i++){
      |                      ~~^~~
molecules.cpp:34:23: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   34 |     for (int i = 1; i < n; i++) {
      |                     ~~^~~
molecules.cpp:38:15: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'int' [-Wsign-compare]
   38 |      if (p[i] >= l && p[i] <= r) {
      |          ~~~~~^~~~
molecules.cpp:38:28: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'int' [-Wsign-compare]
   38 |      if (p[i] >= l && p[i] <= r) {
      |                       ~~~~~^~~~
molecules.cpp:44:12: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'int' [-Wsign-compare]
   44 |   if (p[i] > r) {
      |       ~~~~~^~~
molecules.cpp:58:21: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   58 |   for (int i = 0; i <= j; i++) {
      |                   ~~^~~~
molecules.cpp:69:21: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   69 |   for (int i = 0; i < cnt; i++) {
      |                   ~~^~~~~
molecules.cpp:75:10: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'int' [-Wsign-compare]
   75 |    if (s >= l && s <= r) {
      |        ~~^~~~
molecules.cpp:75:20: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'int' [-Wsign-compare]
   75 |    if (s >= l && s <= r) {
      |                  ~~^~~~
molecules.cpp:87:21: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   87 |   for (int i = j; i < cnt; i++) {
      |                   ~~^~~~~
molecules.cpp:93:25: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   93 |   for (int i = n - j; i < n; i++) {
      |                       ~~^~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

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