oj.uz

답안 #951154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951154 2024-03-21T09:16:50 Z thieunguyenhuy Detecting Molecules (IOI16_molecules) C++17
100 / 100
 36 ms 4792 KB 
#include <bits/stdc++.h>
using namespace std;

#define popcount(n) __builtin_popcountll((n))
#define clz(n) __builtin_clzll((n))
#define ctz(n) __builtin_ctzll((n))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

vector<int> find_subset(int lo, int hi, vector<int> w) {
	int n = w.size();
	vector<int> id(n); iota(id.begin(), id.end(), 0);
	sort (id.begin(), id.end(), [&](int x, int y) {
		return w[x] < w[y];
	});
	// for (int i = 0; i < n; ++i)
	// 	cout << id[i] << ' ';
	// cout << '\n';
	int j = 0; unsigned int sum = 0;
	for (int i = 0; i < n; ++i) {
		while (j < n && sum < lo) sum += w[id[j++]];
		// cout << i << ' ' << j << ' ' << sum << '\n';
		if (lo <= sum && sum <= hi) {
			vector<int> ans(j - i);
			for (int x = i; x < j; ++x)
				ans[x - i] = id[x];
			return ans;
		}
		sum -= w[id[i]];
	}
	return vector<int>();
}

#ifdef hwe
int w[N], result[N];

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    cerr << '\n'; return 0;
}
#endif

Compilation message

molecules.cpp: In function 'std::vector<int> find_subset(int, int, std::vector<int>)':
molecules.cpp:71:23: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   71 |   while (j < n && sum < lo) sum += w[id[j++]];
      |                   ~~~~^~~~
molecules.cpp:73:10: warning: comparison of integer expressions of different signedness: 'int' and 'unsigned int' [-Wsign-compare]
   73 |   if (lo <= sum && sum <= hi) {
      |       ~~~^~~~~~
molecules.cpp:73:24: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare]
   73 |   if (lo <= sum && sum <= hi) {
      |                    ~~~~^~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
23.0 / 23.0

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

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB OK (n = 1, answer = NO)
2 Correct 0 ms 348 KB OK (n = 1, answer = NO)
3 Correct 0 ms 348 KB OK (n = 1, answer = YES)
4 Correct 0 ms 348 KB OK (n = 2, answer = YES)
5 Correct 0 ms 348 KB OK (n = 2, answer = YES)
6 Correct 0 ms 348 KB OK (n = 3, answer = YES)
7 Correct 0 ms 348 KB OK (n = 3, answer = YES)
8 Correct 0 ms 348 KB OK (n = 3, answer = YES)
9 Correct 1 ms 348 KB OK (n = 3, answer = YES)
10 Correct 1 ms 348 KB OK (n = 3, answer = YES)
11 Correct 0 ms 344 KB OK (n = 3, answer = YES)
12 Correct 0 ms 344 KB OK (n = 3, answer = YES)
13 Correct 0 ms 348 KB OK (n = 3, answer = NO)
14 Correct 0 ms 348 KB OK (n = 3, answer = YES)
15 Correct 0 ms 348 KB OK (n = 3, answer = YES)
16 Correct 0 ms 348 KB OK (n = 3, answer = NO)
17 Correct 0 ms 348 KB OK (n = 3, answer = NO)
18 Correct 0 ms 348 KB OK (n = 100, answer = NO)
19 Correct 0 ms 348 KB OK (n = 100, answer = YES)
20 Correct 0 ms 600 KB OK (n = 12, answer = YES)
21 Correct 1 ms 348 KB OK (n = 12, answer = YES)
22 Correct 0 ms 348 KB OK (n = 12, answer = NO)
23 Correct 1 ms 348 KB OK (n = 12, answer = NO)
24 Correct 0 ms 348 KB OK (n = 12, answer = YES)
25 Correct 1 ms 348 KB OK (n = 12, answer = YES)
26 Correct 0 ms 348 KB OK (n = 12, answer = YES)
27 Correct 1 ms 348 KB OK (n = 12, answer = YES)
28 Correct 0 ms 348 KB OK (n = 6, answer = YES)
29 Correct 1 ms 348 KB OK (n = 12, answer = YES)
30 Correct 0 ms 348 KB OK (n = 100, answer = NO)
31 Correct 0 ms 348 KB OK (n = 100, answer = YES)
32 Correct 0 ms 348 KB OK (n = 100, answer = NO)
33 Correct 0 ms 348 KB OK (n = 100, answer = YES)
34 Correct 0 ms 348 KB OK (n = 100, answer = YES)
35 Correct 1 ms 348 KB OK (n = 100, answer = YES)
36 Correct 1 ms 348 KB OK (n = 100, answer = YES)
37 Correct 0 ms 348 KB OK (n = 28, answer = YES)
38 Correct 1 ms 348 KB OK (n = 27, answer = YES)
39 Correct 0 ms 348 KB OK (n = 90, answer = YES)
40 Correct 0 ms 348 KB OK (n = 100, answer = YES)
41 Correct 1 ms 348 KB OK (n = 100, answer = YES)
42 Correct 0 ms 348 KB OK (n = 10, answer = YES)
43 Correct 1 ms 348 KB OK (n = 100, answer = YES)
44 Correct 0 ms 348 KB OK (n = 100, answer = YES)
45 Correct 1 ms 348 KB OK (n = 100, answer = YES)
46 Correct 0 ms 348 KB OK (n = 100, answer = YES)
47 Correct 1 ms 348 KB OK (n = 100, answer = NO)
48 Correct 0 ms 348 KB OK (n = 100, answer = NO)
49 Correct 1 ms 348 KB OK (n = 100, answer = NO)
50 Correct 0 ms 348 KB OK (n = 100, answer = YES)
51 Correct 0 ms 348 KB OK (n = 100, answer = YES)
52 Correct 1 ms 348 KB OK (n = 100, answer = YES)
53 Correct 0 ms 348 KB OK (n = 100, answer = YES)
54 Correct 0 ms 348 KB OK (n = 100, answer = YES)
55 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
56 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
57 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
58 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
59 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
60 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
61 Correct 2 ms 348 KB OK (n = 10000, answer = NO)
62 Correct 2 ms 348 KB OK (n = 10000, answer = YES)
63 Correct 2 ms 348 KB OK (n = 10000, answer = NO)
64 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
65 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
66 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
67 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
68 Correct 2 ms 344 KB OK (n = 10000, answer = YES)
69 Correct 2 ms 500 KB OK (n = 10000, answer = YES)
70 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
71 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
72 Correct 1 ms 348 KB OK (n = 865, answer = YES)
73 Correct 0 ms 348 KB OK (n = 820, answer = YES)
74 Correct 1 ms 344 KB OK (n = 7500, answer = NO)
75 Correct 1 ms 600 KB OK (n = 10000, answer = NO)
76 Correct 1 ms 348 KB OK (n = 10000, answer = NO)
77 Correct 2 ms 344 KB OK (n = 10000, answer = NO)
78 Correct 1 ms 348 KB OK (n = 10000, answer = NO)
79 Correct 2 ms 348 KB OK (n = 10000, answer = YES)
80 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
81 Correct 2 ms 348 KB OK (n = 10000, answer = YES)
82 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
83 Correct 2 ms 348 KB OK (n = 10000, answer = NO)
84 Correct 2 ms 348 KB OK (n = 10000, answer = YES)
85 Correct 2 ms 428 KB OK (n = 10000, answer = NO)
86 Correct 2 ms 348 KB OK (n = 10000, answer = YES)
87 Correct 2 ms 348 KB OK (n = 10000, answer = YES)
88 Correct 1 ms 552 KB OK (n = 10000, answer = YES)
89 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
90 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
91 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
92 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
93 Correct 1 ms 348 KB OK (n = 10000, answer = YES)
94 Correct 1 ms 348 KB OK (n = 1, answer = YES)
95 Correct 0 ms 348 KB OK (n = 3, answer = YES)
96 Correct 0 ms 348 KB OK (n = 3, answer = NO)
97 Correct 1 ms 348 KB OK (n = 3, answer = YES)
98 Correct 16 ms 2140 KB OK (n = 150000, answer = NO)
99 Correct 27 ms 2652 KB OK (n = 200000, answer = YES)
100 Correct 31 ms 4700 KB OK (n = 200000, answer = NO)
101 Correct 28 ms 4168 KB OK (n = 200000, answer = YES)
102 Correct 36 ms 4792 KB OK (n = 200000, answer = YES)
103 Correct 21 ms 4332 KB OK (n = 200000, answer = YES)
104 Correct 23 ms 4188 KB OK (n = 200000, answer = YES)
105 Correct 25 ms 3416 KB OK (n = 200000, answer = NO)
106 Correct 35 ms 3924 KB OK (n = 200000, answer = YES)
107 Correct 36 ms 4700 KB OK (n = 200000, answer = NO)
108 Correct 22 ms 3420 KB OK (n = 200000, answer = NO)
109 Correct 22 ms 3416 KB OK (n = 200000, answer = NO)
110 Correct 19 ms 3676 KB OK (n = 200000, answer = YES)
111 Correct 16 ms 3932 KB OK (n = 200000, answer = YES)
112 Correct 17 ms 3672 KB OK (n = 200000, answer = YES)
113 Correct 18 ms 3932 KB OK (n = 200000, answer = YES)
114 Correct 18 ms 3928 KB OK (n = 200000, answer = YES)
115 Correct 23 ms 3932 KB OK (n = 200000, answer = YES)
116 Correct 18 ms 3672 KB OK (n = 200000, answer = YES)
117 Correct 16 ms 3676 KB OK (n = 200000, answer = YES)