oj.uz

답안 #829677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829677 2023-08-18T14:03:13 Z Boas Detecting Molecules (IOI16_molecules) C++17
100 / 100
 39 ms 8232 KB 
#include "molecules.h"

using namespace std;
#include <bits/stdc++.h>

#define MAX_N 200001
#define ALL(x) x.begin(), x.end()
#define loop(x, i) for (int i = 0; i < (x); i++)
typedef int64_t in64;
typedef pair<in64, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef set<int> si;

in64 diff(in64 i, in64 l, in64 u)
{
	if (i < l)
		return l - i;
	if (i > u)
		return i - u;
	return 0;
}

vi find_subset(int l, int u, vi w)
{
	in64 alles = accumulate(ALL(w), (in64)0);
	if (alles < l)
		return {};
	if (alles <= u)
	{
		vi ret;
		loop(w.size(), i) ret.push_back(i);
		return ret;
	}
	vii sortedMolecules; // first weight, second real index
	loop(w.size(), i)
	{
		if (w[i] > u)
			continue;
		if (w[i] >= l)
			return {i};
		sortedMolecules.push_back({w[i], i});
	}
	sort(ALL(sortedMolecules));
	int n = sortedMolecules.size();
	in64 minSum = 0;
	in64 maxSum = 0;
	vi mols;
	for (int k = 1; k <= n; k++)
	{
		maxSum += sortedMolecules[n - k].first;
		minSum += sortedMolecules[k - 1].first;
		mols.push_back(sortedMolecules[k - 1].second);
		if (maxSum < l)
			continue;
		if (minSum > u)
			break;
		if (minSum >= l)
			return mols;
		if (maxSum <= u)
		{
			mols.resize(k);
			loop(k, j) mols[j] = (sortedMolecules[n - j - 1].second);
			return mols;
		}
		in64 sum = minSum;
		int startIndex = 0;
		while (sum < l)
		{
			sum -= sortedMolecules[startIndex].first;
			sum += sortedMolecules[k + startIndex].first;
			startIndex++;
			if (startIndex >= n)
				break;
			if (startIndex + k >= n)
				break;
		}
		if (sum < l || sum > u)
			return {};
		vi ret(k);
		for (int i = 0; i < k; i++)
		{
			ret[i] = sortedMolecules[i + startIndex].second;
		}
		return ret;
	}
	return {};
}

Compilation message

molecules.cpp: In function 'vi find_subset(int, int, vi)':
molecules.cpp:8:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define loop(x, i) for (int i = 0; i < (x); i++)
      |                                      ^
molecules.cpp:32:3: note: in expansion of macro 'loop'
   32 |   loop(w.size(), i) ret.push_back(i);
      |   ^~~~
molecules.cpp:8:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define loop(x, i) for (int i = 0; i < (x); i++)
      |                                      ^
molecules.cpp:36:2: note: in expansion of macro 'loop'
   36 |  loop(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 1 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 0 ms 212 KB OK (n = 12, answer = YES)
3 Correct 0 ms 212 KB OK (n = 12, answer = NO)
4 Correct 0 ms 212 KB OK (n = 12, answer = NO)
5 Correct 0 ms 212 KB OK (n = 12, answer = YES)
6 Correct 1 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 1 ms 212 KB OK (n = 100, answer = NO)
14 Correct 1 ms 212 KB OK (n = 100, answer = YES)
15 Correct 0 ms 212 KB OK (n = 100, answer = YES)
16 Correct 0 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 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 1 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 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 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 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 0 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 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 212 KB OK (n = 100, answer = YES)
54 Correct 0 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 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 1 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 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 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 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 0 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 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 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
56 Correct 3 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 3 ms 724 KB OK (n = 10000, answer = NO)
62 Correct 1 ms 340 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 720 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 724 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 0 ms 212 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 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 1 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 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 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 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 0 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 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 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
56 Correct 3 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 3 ms 724 KB OK (n = 10000, answer = NO)
62 Correct 1 ms 340 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 720 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 724 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 0 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 KB OK (n = 820, answer = YES)
74 Correct 1 ms 340 KB OK (n = 7500, answer = NO)
75 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
78 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 724 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 724 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
85 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 720 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
93 Correct 1 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 1 ms 212 KB OK (n = 100, answer = YES)
20 Correct 0 ms 212 KB OK (n = 12, answer = YES)
21 Correct 0 ms 212 KB OK (n = 12, answer = YES)
22 Correct 0 ms 212 KB OK (n = 12, answer = NO)
23 Correct 0 ms 212 KB OK (n = 12, answer = NO)
24 Correct 0 ms 212 KB OK (n = 12, answer = YES)
25 Correct 1 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 1 ms 212 KB OK (n = 100, answer = NO)
33 Correct 1 ms 212 KB OK (n = 100, answer = YES)
34 Correct 0 ms 212 KB OK (n = 100, answer = YES)
35 Correct 0 ms 212 KB OK (n = 100, answer = YES)
36 Correct 1 ms 212 KB OK (n = 100, answer = YES)
37 Correct 0 ms 212 KB OK (n = 28, answer = YES)
38 Correct 0 ms 212 KB OK (n = 27, answer = YES)
39 Correct 0 ms 212 KB OK (n = 90, answer = YES)
40 Correct 0 ms 212 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 212 KB OK (n = 100, answer = YES)
46 Correct 0 ms 212 KB OK (n = 100, answer = YES)
47 Correct 0 ms 212 KB OK (n = 100, answer = NO)
48 Correct 0 ms 212 KB OK (n = 100, answer = NO)
49 Correct 0 ms 212 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 212 KB OK (n = 100, answer = YES)
54 Correct 0 ms 212 KB OK (n = 100, answer = YES)
55 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
56 Correct 3 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 3 ms 724 KB OK (n = 10000, answer = NO)
62 Correct 1 ms 340 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
64 Correct 3 ms 720 KB OK (n = 10000, answer = YES)
65 Correct 3 ms 724 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 0 ms 212 KB OK (n = 865, answer = YES)
73 Correct 1 ms 340 KB OK (n = 820, answer = YES)
74 Correct 1 ms 340 KB OK (n = 7500, answer = NO)
75 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
76 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 340 KB OK (n = 10000, answer = NO)
78 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
79 Correct 4 ms 724 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 724 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
85 Correct 1 ms 340 KB OK (n = 10000, answer = NO)
86 Correct 3 ms 724 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
88 Correct 2 ms 724 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 720 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 724 KB OK (n = 10000, answer = YES)
94 Correct 1 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 0 ms 212 KB OK (n = 3, answer = YES)
98 Correct 11 ms 1408 KB OK (n = 150000, answer = NO)
99 Correct 36 ms 6068 KB OK (n = 200000, answer = YES)
100 Correct 39 ms 8232 KB OK (n = 200000, answer = NO)
101 Correct 38 ms 7464 KB OK (n = 200000, answer = YES)
102 Correct 18 ms 3880 KB OK (n = 200000, answer = YES)
103 Correct 38 ms 7596 KB OK (n = 200000, answer = YES)
104 Correct 36 ms 7464 KB OK (n = 200000, answer = YES)
105 Correct 14 ms 2616 KB OK (n = 200000, answer = NO)
106 Correct 38 ms 7316 KB OK (n = 200000, answer = YES)
107 Correct 18 ms 4020 KB OK (n = 200000, answer = NO)
108 Correct 14 ms 2644 KB OK (n = 200000, answer = NO)
109 Correct 14 ms 2644 KB OK (n = 200000, answer = NO)
110 Correct 33 ms 7072 KB OK (n = 200000, answer = YES)
111 Correct 23 ms 7236 KB OK (n = 200000, answer = YES)
112 Correct 23 ms 7068 KB OK (n = 200000, answer = YES)
113 Correct 24 ms 7200 KB OK (n = 200000, answer = YES)
114 Correct 24 ms 7260 KB OK (n = 200000, answer = YES)
115 Correct 24 ms 7236 KB OK (n = 200000, answer = YES)
116 Correct 31 ms 6972 KB OK (n = 200000, answer = YES)
117 Correct 32 ms 7108 KB OK (n = 200000, answer = YES)