oj.uz

답안 #251713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251713 2020-07-22T08:41:05 Z tutis Detecting Molecules (IOI16_molecules) C++17
100 / 100
 77 ms 7832 KB 
/*input
4 15 17
6 8 8 7
*/
#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w)
{
	int a = u - l;
	int n = w.size();
	vector<int>v(n);
	for (int i = 0; i < n; i++)
		v[i] = i;
	sort(v.begin(), v.end(), [&](int a, int b) {return w[a] < w[b];});
	long long w_mn = *min_element(w.begin(), w.end());
	vector<int>x(n);
	for (int i = 0; i < n; i++)
		x[i] = w[i] - w_mn;
	vector<long long>suma;
	suma.push_back(0);
	for (int i = 0; i < n; i++)
		suma.push_back(suma.back() + x[v[i]]);
	for (long long k = 1; k <= n; k++)
	{
		long long mini = w_mn * k + suma[k];
		long long maxi = w_mn * k + suma[n] - suma[n - k];
		if (mini < l && maxi < l)
			continue;
		if (mini > u && maxi > u)
			continue;
		if (u <= mini && mini <= l)
		{
			vector<int>ans;
			for (int i = 0; i < k; i++)
				ans.push_back(v[i]);
			return ans;
		}
		if (u <= maxi && maxi <= l)
		{
			vector<int>ans;
			for (int i = n - 1; i >= n - k; i--)
				ans.push_back(v[i]);
			return ans;
		}
		long long suma = 0;
		int j = k;
		int t = 0;
		for (int i = 0; i < k; i++)
			suma += w[v[i]];
		while (suma < l)
		{
			suma -= w[v[t]];
			suma += w[v[j]];
			t++;
			j++;
		}
		vector<int>ans;
		for (int i = t; i < j; i++)
			ans.push_back(v[i]);
		return ans;
	}
	return {};
}/*
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:78:1: warning: "/*" within comment [-Wcomment]
 /**/
  
molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:10:6: warning: unused variable 'a' [-Wunused-variable]
  int a = u - l;
      ^

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 1 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 1 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 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 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 0 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 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 1 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 0 ms 256 KB OK (n = 12, answer = YES)
8 Correct 1 ms 256 KB OK (n = 12, answer = YES)
9 Correct 0 ms 256 KB OK (n = 6, answer = YES)
10 Correct 1 ms 256 KB OK (n = 12, answer = YES)
11 Correct 0 ms 256 KB OK (n = 100, answer = NO)
12 Correct 0 ms 384 KB OK (n = 100, answer = YES)
13 Correct 0 ms 256 KB OK (n = 100, answer = NO)
14 Correct 1 ms 256 KB OK (n = 100, answer = YES)
15 Correct 0 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 1 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 1 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 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 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 0 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 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 1 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 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 1 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 0 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 1 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 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 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 0 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 1 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 372 KB OK (n = 10, answer = YES)
43 Correct 1 ms 384 KB OK (n = 100, answer = YES)
44 Correct 1 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 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 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 1 ms 384 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 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 1 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 1 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 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 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 0 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 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 1 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 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 1 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 0 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 1 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 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 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 0 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 1 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 372 KB OK (n = 10, answer = YES)
43 Correct 1 ms 384 KB OK (n = 100, answer = YES)
44 Correct 1 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 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 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 1 ms 384 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 768 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 768 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 1 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 1 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 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 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 0 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 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 1 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 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 1 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 0 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 1 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 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 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 0 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 1 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 372 KB OK (n = 10, answer = YES)
43 Correct 1 ms 384 KB OK (n = 100, answer = YES)
44 Correct 1 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 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 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 1 ms 384 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 768 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 768 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 2 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 768 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 688 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 768 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
85 Correct 4 ms 768 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 760 KB OK (n = 10000, answer = YES)

Subtask #6
31.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 1 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 1 ms 256 KB OK (n = 3, answer = YES)
12 Correct 0 ms 256 KB OK (n = 3, answer = YES)
13 Correct 0 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 0 ms 256 KB OK (n = 3, answer = NO)
17 Correct 0 ms 256 KB OK (n = 3, answer = NO)
18 Correct 0 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 1 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 0 ms 256 KB OK (n = 12, answer = YES)
27 Correct 1 ms 256 KB OK (n = 12, answer = YES)
28 Correct 0 ms 256 KB OK (n = 6, answer = YES)
29 Correct 1 ms 256 KB OK (n = 12, answer = YES)
30 Correct 0 ms 256 KB OK (n = 100, answer = NO)
31 Correct 0 ms 384 KB OK (n = 100, answer = YES)
32 Correct 0 ms 256 KB OK (n = 100, answer = NO)
33 Correct 1 ms 256 KB OK (n = 100, answer = YES)
34 Correct 0 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 0 ms 256 KB OK (n = 27, answer = YES)
39 Correct 0 ms 256 KB OK (n = 90, answer = YES)
40 Correct 0 ms 256 KB OK (n = 100, answer = YES)
41 Correct 1 ms 256 KB OK (n = 100, answer = YES)
42 Correct 1 ms 372 KB OK (n = 10, answer = YES)
43 Correct 1 ms 384 KB OK (n = 100, answer = YES)
44 Correct 1 ms 256 KB OK (n = 100, answer = YES)
45 Correct 1 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 0 ms 256 KB OK (n = 100, answer = NO)
49 Correct 1 ms 256 KB OK (n = 100, answer = NO)
50 Correct 0 ms 256 KB OK (n = 100, answer = YES)
51 Correct 1 ms 384 KB OK (n = 100, answer = YES)
52 Correct 0 ms 256 KB OK (n = 100, answer = YES)
53 Correct 0 ms 256 KB OK (n = 100, answer = YES)
54 Correct 0 ms 256 KB OK (n = 100, answer = YES)
55 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
56 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
58 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
59 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
60 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 768 KB OK (n = 10000, answer = NO)
62 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
63 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
70 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
71 Correct 2 ms 768 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 2 ms 512 KB OK (n = 7500, answer = NO)
75 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 768 KB OK (n = 10000, answer = NO)
77 Correct 3 ms 688 KB OK (n = 10000, answer = NO)
78 Correct 2 ms 768 KB OK (n = 10000, answer = NO)
79 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
80 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
82 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
83 Correct 3 ms 768 KB OK (n = 10000, answer = NO)
84 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
85 Correct 4 ms 768 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
87 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
89 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
90 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
91 Correct 3 ms 768 KB OK (n = 10000, answer = YES)
92 Correct 2 ms 768 KB OK (n = 10000, answer = YES)
93 Correct 2 ms 760 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 308 KB OK (n = 3, answer = NO)
97 Correct 0 ms 256 KB OK (n = 3, answer = YES)
98 Correct 32 ms 5740 KB OK (n = 150000, answer = NO)
99 Correct 52 ms 7276 KB OK (n = 200000, answer = YES)
100 Correct 62 ms 7792 KB OK (n = 200000, answer = NO)
101 Correct 60 ms 7020 KB OK (n = 200000, answer = YES)
102 Correct 75 ms 7832 KB OK (n = 200000, answer = YES)
103 Correct 43 ms 7276 KB OK (n = 200000, answer = YES)
104 Correct 43 ms 7020 KB OK (n = 200000, answer = YES)
105 Correct 46 ms 6380 KB OK (n = 200000, answer = NO)
106 Correct 63 ms 7020 KB OK (n = 200000, answer = YES)
107 Correct 77 ms 7788 KB OK (n = 200000, answer = NO)
108 Correct 40 ms 6380 KB OK (n = 200000, answer = NO)
109 Correct 39 ms 6380 KB OK (n = 200000, answer = NO)
110 Correct 42 ms 6636 KB OK (n = 200000, answer = YES)
111 Correct 37 ms 6764 KB OK (n = 200000, answer = YES)
112 Correct 36 ms 6768 KB OK (n = 200000, answer = YES)
113 Correct 38 ms 6892 KB OK (n = 200000, answer = YES)
114 Correct 38 ms 6892 KB OK (n = 200000, answer = YES)
115 Correct 39 ms 6892 KB OK (n = 200000, answer = YES)
116 Correct 37 ms 6636 KB OK (n = 200000, answer = YES)
117 Correct 35 ms 6636 KB OK (n = 200000, answer = YES)