oj.uz

답안 #489732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489732 2021-11-24T04:49:50 Z Evang Detecting Molecules (IOI16_molecules) C++17
46 / 100
 1000 ms 2380 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef _DEBUG
#define dout(x) clog << "Line " << __LINE__ << ": " << #x << "=" << (x) << el
#else
#define dout(x)
#endif

#define mp(a, b) make_pair(a, b)
#define mt(args...) make_tuple(args)
#define pb(x) push_back(x)
#define eb(args...) emplace_back(args)
#define ff first
#define ss second
#define DIE exit(0)

template<typename T>
using vc = vector<T>;
template<typename T>
using uset = unordered_set<T>;
template<typename A, typename B>
using umap = unordered_map<A, B>;
template<typename T, typename Comp>
using pq = std::priority_queue<T, vc<T>, Comp>;
template<typename T>
using maxpq = pq<T, less<T>>;
template<typename T>
using minpq = pq<T, greater<T>>;

using db = double;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vc<int>;
using vll = vc<ll>;
using vpi = vc<pi>;
using vpll = vc<pll>;
using str = string;

constexpr char el = '\n';
constexpr char sp = ' ';
constexpr int inf = 0x3f3f3f3f;
constexpr ll llinf = 0x3f3f3f3f3f3f3f3fLL;

#include "molecules.h"

vi find_subset(int l, int u, vi w){
	vc<bool> pos(u+1);
	vi a(u+1);
	pos[0] = 1;
	for(int i = 0; i < w.size(); ++i)
		for(int j = u - w[i]; j >= 0; --j)
			if(pos[j]&&!pos[j+w[i]]){
				pos[j+w[i]] = 1;
				a[j+w[i]] = i;
				if(l <= j + w[i] && j + w[i] <= u){
					vi ans;
					int cur = j + w[i];
					while(cur>0){
						ans.pb(a[cur]);
						cur -= w[a[cur]];
					}
					return ans;
				}
			}
	return vi();
}

Compilation message

molecules.cpp: In function 'vi find_subset(int, int, vi)':
molecules.cpp:54:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for(int i = 0; i < w.size(); ++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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 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 0 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 288 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 1 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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 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 0 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 288 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 1 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 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 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 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 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 0 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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 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 0 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 288 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 1 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 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 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 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 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 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 10 ms 332 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
58 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 332 KB OK (n = 10000, answer = YES)
60 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
61 Correct 36 ms 332 KB OK (n = 10000, answer = NO)
62 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 376 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 364 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
70 Correct 35 ms 332 KB OK (n = 10000, answer = YES)
71 Correct 34 ms 332 KB OK (n = 10000, answer = YES)
72 Correct 3 ms 296 KB OK (n = 865, answer = YES)
73 Correct 6 ms 332 KB OK (n = 820, answer = YES)

Subtask #5
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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 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 0 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 288 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 1 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 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 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 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 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 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 10 ms 332 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
58 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 332 KB OK (n = 10000, answer = YES)
60 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
61 Correct 36 ms 332 KB OK (n = 10000, answer = NO)
62 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 376 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 364 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
70 Correct 35 ms 332 KB OK (n = 10000, answer = YES)
71 Correct 34 ms 332 KB OK (n = 10000, answer = YES)
72 Correct 3 ms 296 KB OK (n = 865, answer = YES)
73 Correct 6 ms 332 KB OK (n = 820, answer = YES)
74 Correct 779 ms 716 KB OK (n = 7500, answer = NO)
75 Execution timed out 1094 ms 2380 KB Time limit exceeded
76 Halted 0 ms 0 KB -

Subtask #6
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 0 ms 204 KB OK (n = 2, answer = YES)
5 Correct 0 ms 204 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 0 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 288 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 1 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 1 ms 204 KB OK (n = 90, answer = YES)
40 Correct 1 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 1 ms 204 KB OK (n = 100, answer = NO)
48 Correct 0 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 0 ms 204 KB OK (n = 100, answer = YES)
54 Correct 0 ms 204 KB OK (n = 100, answer = YES)
55 Correct 10 ms 332 KB OK (n = 10000, answer = YES)
56 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
57 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
58 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
59 Correct 3 ms 332 KB OK (n = 10000, answer = YES)
60 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
61 Correct 36 ms 332 KB OK (n = 10000, answer = NO)
62 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
63 Correct 1 ms 376 KB OK (n = 10000, answer = NO)
64 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
65 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
66 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
67 Correct 2 ms 364 KB OK (n = 10000, answer = YES)
68 Correct 1 ms 332 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 332 KB OK (n = 10000, answer = YES)
70 Correct 35 ms 332 KB OK (n = 10000, answer = YES)
71 Correct 34 ms 332 KB OK (n = 10000, answer = YES)
72 Correct 3 ms 296 KB OK (n = 865, answer = YES)
73 Correct 6 ms 332 KB OK (n = 820, answer = YES)
74 Correct 779 ms 716 KB OK (n = 7500, answer = NO)
75 Execution timed out 1094 ms 2380 KB Time limit exceeded
76 Halted 0 ms 0 KB -