# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75758 | 2018-09-11T04:43:03 Z | Sherazin | Detecting Molecules (IOI16_molecules) | C++14 | 2 ms | 776 KB |
#include "molecules.h" #include <bits/stdc++.h> #define pii pair<int, int> #define x first #define y second using namespace std; vector<pii> V; vector<int> ans; vector<int> find_subset(int l, int u, vector<int> w) { for(int i = 0; i < w.size(); i++) V.emplace_back(w[i], i); sort(w.begin(), w.end()); int L = 0, R = 0; long long sum = 0; while(L < w.size()) { while(R < w.size() && sum <= u) sum += (long long)w[R++]; if(l <= sum && sum <= u) { for(int i = L; i < R; i++) ans.emplace_back(i); return ans; } sum -= (long long)w[L++]; } return {}; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 480 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 516 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 604 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 604 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 604 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 644 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 644 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 652 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 688 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 688 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 772 KB | OK (n = 3, answer = YES) |
15 | Correct | 2 ms | 772 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 772 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 772 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 772 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 776 KB | OK (n = 100, answer = YES) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 776 KB | Contestant can not find answer, jury can |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 480 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 516 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 604 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 604 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 604 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 644 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 644 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 652 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 688 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 688 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 772 KB | OK (n = 3, answer = YES) |
15 | Correct | 2 ms | 772 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 772 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 772 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 772 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 776 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 776 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 480 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 516 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 604 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 604 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 604 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 644 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 644 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 652 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 688 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 688 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 772 KB | OK (n = 3, answer = YES) |
15 | Correct | 2 ms | 772 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 772 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 772 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 772 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 776 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 776 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 480 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 516 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 604 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 604 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 604 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 644 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 644 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 652 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 688 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 688 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 772 KB | OK (n = 3, answer = YES) |
15 | Correct | 2 ms | 772 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 772 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 772 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 772 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 776 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 776 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 480 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 516 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 604 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 604 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 604 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 604 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 644 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 644 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 652 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 688 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 688 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 772 KB | OK (n = 3, answer = YES) |
15 | Correct | 2 ms | 772 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 772 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 772 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 772 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 776 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 2 ms | 776 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |