# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
28946 | 2017-07-18T01:48:20 Z | h0ngjun7 | Detecting Molecules (IOI16_molecules) | C++14 | 3 ms | 3652 KB |
#include "molecules.h" #include <algorithm> using namespace std; typedef long long ll; int n; struct PT { int x, i; } c[200005]; inline bool cmp(const PT &a, const PT &b) { return a.x < b.x; } vector<int> find_subset(int l, int u, vector<int> w) { vector <int> ans = {}; for (auto &t : w) c[n] = { t, n }, n++; sort(c, c + n, cmp); ll s = 0; int left = 0, right = 0; for (int i = 0; i < n; i++) { if (s + c[i].x > u) break; s += c[i].x; right = i; } if (right == n - 1 && s < l) return ans; while (right <= n - 1 && s < l) { s -= c[left].x; left++; right++; s += c[right].x; } if (l <= s && s <= u) { for (int i = left; i <= right; i++) ans.push_back(c[i].i); } return ans; }
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 3496 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 3496 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
2 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
3 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = NO) |
4 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = NO) |
5 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
6 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
7 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
8 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
9 | Correct | 0 ms | 3496 KB | OK (n = 6, answer = YES) |
10 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
11 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
12 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
13 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
14 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
15 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
16 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
17 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 3496 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 3496 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
20 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
21 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
22 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = NO) |
23 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = NO) |
24 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
25 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
26 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
27 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
28 | Correct | 0 ms | 3496 KB | OK (n = 6, answer = YES) |
29 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
30 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
31 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
32 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
33 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
34 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
35 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
36 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
37 | Correct | 0 ms | 3496 KB | OK (n = 28, answer = YES) |
38 | Correct | 0 ms | 3496 KB | OK (n = 27, answer = YES) |
39 | Correct | 0 ms | 3496 KB | OK (n = 90, answer = YES) |
40 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
41 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
42 | Correct | 0 ms | 3496 KB | OK (n = 10, answer = YES) |
43 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
44 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
45 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
46 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
47 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
48 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
49 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
50 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
51 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
52 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
53 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
54 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 3496 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 3496 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
20 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
21 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
22 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = NO) |
23 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = NO) |
24 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
25 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
26 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
27 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
28 | Correct | 0 ms | 3496 KB | OK (n = 6, answer = YES) |
29 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
30 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
31 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
32 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
33 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
34 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
35 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
36 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
37 | Correct | 0 ms | 3496 KB | OK (n = 28, answer = YES) |
38 | Correct | 0 ms | 3496 KB | OK (n = 27, answer = YES) |
39 | Correct | 0 ms | 3496 KB | OK (n = 90, answer = YES) |
40 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
41 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
42 | Correct | 0 ms | 3496 KB | OK (n = 10, answer = YES) |
43 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
44 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
45 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
46 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
47 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
48 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
49 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
50 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
51 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
52 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
53 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
54 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
55 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
56 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
57 | Correct | 3 ms | 3652 KB | OK (n = 10000, answer = YES) |
58 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
59 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
60 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
61 | Correct | 3 ms | 3652 KB | OK (n = 10000, answer = NO) |
62 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
63 | Incorrect | 0 ms | 3652 KB | sum of weights should be in [1..5000] but it is 5011 |
64 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 3496 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 3496 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
20 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
21 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
22 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = NO) |
23 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = NO) |
24 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
25 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
26 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
27 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
28 | Correct | 0 ms | 3496 KB | OK (n = 6, answer = YES) |
29 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
30 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
31 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
32 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
33 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
34 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
35 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
36 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
37 | Correct | 0 ms | 3496 KB | OK (n = 28, answer = YES) |
38 | Correct | 0 ms | 3496 KB | OK (n = 27, answer = YES) |
39 | Correct | 0 ms | 3496 KB | OK (n = 90, answer = YES) |
40 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
41 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
42 | Correct | 0 ms | 3496 KB | OK (n = 10, answer = YES) |
43 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
44 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
45 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
46 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
47 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
48 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
49 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
50 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
51 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
52 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
53 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
54 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
55 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
56 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
57 | Correct | 3 ms | 3652 KB | OK (n = 10000, answer = YES) |
58 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
59 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
60 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
61 | Correct | 3 ms | 3652 KB | OK (n = 10000, answer = NO) |
62 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
63 | Incorrect | 0 ms | 3652 KB | sum of weights should be in [1..5000] but it is 5011 |
64 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = NO) |
3 | Correct | 0 ms | 3496 KB | OK (n = 1, answer = YES) |
4 | Correct | 0 ms | 3496 KB | OK (n = 2, answer = YES) |
5 | Correct | 0 ms | 3496 KB | OK (n = 2, answer = YES) |
6 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
7 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
8 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
9 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
10 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
11 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
12 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
13 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
14 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
15 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = YES) |
16 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
17 | Correct | 0 ms | 3496 KB | OK (n = 3, answer = NO) |
18 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
19 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
20 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
21 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
22 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = NO) |
23 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = NO) |
24 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
25 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
26 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
27 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
28 | Correct | 0 ms | 3496 KB | OK (n = 6, answer = YES) |
29 | Correct | 0 ms | 3496 KB | OK (n = 12, answer = YES) |
30 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
31 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
32 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
33 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
34 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
35 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
36 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
37 | Correct | 0 ms | 3496 KB | OK (n = 28, answer = YES) |
38 | Correct | 0 ms | 3496 KB | OK (n = 27, answer = YES) |
39 | Correct | 0 ms | 3496 KB | OK (n = 90, answer = YES) |
40 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
41 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
42 | Correct | 0 ms | 3496 KB | OK (n = 10, answer = YES) |
43 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
44 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
45 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
46 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
47 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
48 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
49 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = NO) |
50 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
51 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
52 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
53 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
54 | Correct | 0 ms | 3496 KB | OK (n = 100, answer = YES) |
55 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
56 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
57 | Correct | 3 ms | 3652 KB | OK (n = 10000, answer = YES) |
58 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
59 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
60 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
61 | Correct | 3 ms | 3652 KB | OK (n = 10000, answer = NO) |
62 | Correct | 0 ms | 3652 KB | OK (n = 10000, answer = YES) |
63 | Incorrect | 0 ms | 3652 KB | sum of weights should be in [1..5000] but it is 5011 |
64 | Halted | 0 ms | 0 KB | - |