oj.uz

답안 #290721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
290721 2020-09-04T11:03:02 Z aymanrs Detecting Molecules (IOI16_molecules) C++14
69 / 100
 1000 ms 4600 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w){
	vector<pair<int, int>> c(w.size());
	for(int i = 0;i < w.size();i++) c[i] = {w[i], i};
	sort(c.begin(), c.end());
	long long pre[w.size()];
	pre[0] = c[0].first;
	for(int i = 1;i < c.size();i++) pre[i] = pre[i-1] + c[i].first;
	for(int window = 0;window < c.size();window++){
		for(int i = 0;i+window < c.size();i++){
			if(i > 0){
				if(pre[i + window] - pre[i-1] >= l && pre[i + window] - pre[i-1] <= u){
					vector<int> ans(window+1);
					for(int j = i;j <= i+window;j++) ans[j-i] = c[j].second;
					return ans;
				}
			}
			if(i == 0){
				if(pre[i + window] >= l && pre[i + window]<= u){
					vector<int> ans(window+1);
					for(int j = i;j <= i+window;j++) ans[j-i] = c[j].second;
					return ans;
				}
			}
		}
	}
	return {};
}

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:5:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 |  for(int i = 0;i < w.size();i++) c[i] = {w[i], i};
      |                ~~^~~~~~~~~~
molecules.cpp:9:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for(int i = 1;i < c.size();i++) pre[i] = pre[i-1] + c[i].first;
      |                ~~^~~~~~~~~~
molecules.cpp:10:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |  for(int window = 0;window < c.size();window++){
      |                     ~~~~~~~^~~~~~~~~~
molecules.cpp:11:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |   for(int i = 0;i+window < c.size();i++){
      |                 ~~~~~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
0 / 31.0

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