# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
425888 | 2021-06-13T12:13:42 Z | vincentpikachu20 | Detecting Molecules (IOI16_molecules) | C++17 | 1 ms | 204 KB |
#include "molecules.h" #include <bits/stdc++.h> #define int long long using namespace std; vector<signed> find_subset(signed _l, signed _u, vector<signed> _w) { int l = _l, u = _u; vector<int> w(_w.begin(), _w.end()); sort(w.begin(), w.end()); u = min(u,accumulate(w.begin(), w.end(), (int)0)); int n = w.size(); // int k = (l+w[0]-1)/w[0]; if(k*w[0] > u) return vector<signed>(); else{ vector<signed> a(k); for(int i = 0; i < k; i ++) a[i] = i; return a; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 204 KB | OK (n = 1, answer = NO) |
3 | Correct | 1 ms | 204 KB | OK (n = 1, answer = YES) |
4 | Correct | 1 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 | 1 ms | 204 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 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 | 1 ms | 204 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 204 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 204 KB | OK (n = 3, answer = YES) |
16 | Correct | 1 ms | 204 KB | OK (n = 3, answer = NO) |
17 | Correct | 1 ms | 204 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 204 KB | OK (n = 100, answer = NO) |
19 | Correct | 1 ms | 204 KB | OK (n = 100, answer = YES) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Contestant can not find answer, jury can |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 204 KB | OK (n = 1, answer = NO) |
3 | Correct | 1 ms | 204 KB | OK (n = 1, answer = YES) |
4 | Correct | 1 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 | 1 ms | 204 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 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 | 1 ms | 204 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 204 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 204 KB | OK (n = 3, answer = YES) |
16 | Correct | 1 ms | 204 KB | OK (n = 3, answer = NO) |
17 | Correct | 1 ms | 204 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 204 KB | OK (n = 100, answer = NO) |
19 | Correct | 1 ms | 204 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 204 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 204 KB | OK (n = 1, answer = NO) |
3 | Correct | 1 ms | 204 KB | OK (n = 1, answer = YES) |
4 | Correct | 1 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 | 1 ms | 204 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 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 | 1 ms | 204 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 204 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 204 KB | OK (n = 3, answer = YES) |
16 | Correct | 1 ms | 204 KB | OK (n = 3, answer = NO) |
17 | Correct | 1 ms | 204 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 204 KB | OK (n = 100, answer = NO) |
19 | Correct | 1 ms | 204 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 204 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 204 KB | OK (n = 1, answer = NO) |
3 | Correct | 1 ms | 204 KB | OK (n = 1, answer = YES) |
4 | Correct | 1 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 | 1 ms | 204 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 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 | 1 ms | 204 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 204 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 204 KB | OK (n = 3, answer = YES) |
16 | Correct | 1 ms | 204 KB | OK (n = 3, answer = NO) |
17 | Correct | 1 ms | 204 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 204 KB | OK (n = 100, answer = NO) |
19 | Correct | 1 ms | 204 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 204 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | OK (n = 1, answer = NO) |
2 | Correct | 0 ms | 204 KB | OK (n = 1, answer = NO) |
3 | Correct | 1 ms | 204 KB | OK (n = 1, answer = YES) |
4 | Correct | 1 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 | 1 ms | 204 KB | OK (n = 3, answer = YES) |
10 | Correct | 1 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 | 1 ms | 204 KB | OK (n = 3, answer = NO) |
14 | Correct | 1 ms | 204 KB | OK (n = 3, answer = YES) |
15 | Correct | 1 ms | 204 KB | OK (n = 3, answer = YES) |
16 | Correct | 1 ms | 204 KB | OK (n = 3, answer = NO) |
17 | Correct | 1 ms | 204 KB | OK (n = 3, answer = NO) |
18 | Correct | 1 ms | 204 KB | OK (n = 100, answer = NO) |
19 | Correct | 1 ms | 204 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 1 ms | 204 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |