# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492101 | 2021-12-05T12:41:34 Z | Zeriont | Detecting Molecules (IOI16_molecules) | C++14 | 1 ms | 204 KB |
#include <iostream> #include <vector> #include <algorithm> #include <functional> #include <stack> #include <queue> #include <string> #include <list> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<bool> vb; typedef vector<vi> vvi; typedef pair<int, int> pi; typedef pair<int, pi> ppi; vector<int> find_subset(int l, int u, std::vector<int> w) { int sum = 0; vi ans; for (int i = 0; i < w.size(); i++) { sum += w[i]; ans.push_back(i); if (sum >= l) break; } if (sum < l || sum > u) return vi(0); else return ans; }
Compilation message
# | Verdict | Execution time | Memory | 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 | 1 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) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Contestant can not find answer, jury can |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | 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 | 1 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 | Incorrect | 0 ms | 204 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | 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 | 1 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 | Incorrect | 0 ms | 204 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | 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 | 1 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 | Incorrect | 0 ms | 204 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | 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 | 1 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 | Incorrect | 0 ms | 204 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |