# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161525 | 2019-11-02T20:54:40 Z | kostia244 | Detecting Molecules (IOI16_molecules) | C++14 | 9 ms | 376 KB |
#include "molecules.h" #include<bits/stdc++.h> #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define pb push_back using namespace std; using ll = long long; using vi = vector<int>; vi find_subset(int l, int u, std::vector<int> w) { vector<pair<int, int>> v; vector<ll> sum; for(int i = 0; i < w.size(); i++) v.pb({w[i], i}); sort(all(v)); sum.resize(w.size()); sum[0]=v[0].first; for(int i = 1; i < w.size(); i++) sum[i]=sum[i-1]+v[i].first; vi ans; ll cur = 0; for(int i = w.size(); i--;) { if((i?sum[i-1]:0)+cur<l) cur+=v[i].first, ans.pb(v[i].second); } if(cur<l||cur>u) return {}; return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 128 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 376 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
15 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 376 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 376 KB | OK (n = 100, answer = YES) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 9 ms | 256 KB | Contestant can not find answer, jury can |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 128 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 376 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
15 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 376 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 376 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 9 ms | 256 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 128 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 376 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
15 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 376 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 376 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 9 ms | 256 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 128 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 376 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
15 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 376 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 376 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 9 ms | 256 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
2 | Correct | 2 ms | 376 KB | OK (n = 1, answer = NO) |
3 | Correct | 2 ms | 128 KB | OK (n = 1, answer = YES) |
4 | Correct | 2 ms | 376 KB | OK (n = 2, answer = YES) |
5 | Correct | 2 ms | 256 KB | OK (n = 2, answer = YES) |
6 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
7 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
8 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
9 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
10 | Correct | 2 ms | 256 KB | OK (n = 3, answer = YES) |
11 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
12 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
13 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
14 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
15 | Correct | 2 ms | 376 KB | OK (n = 3, answer = YES) |
16 | Correct | 2 ms | 256 KB | OK (n = 3, answer = NO) |
17 | Correct | 2 ms | 376 KB | OK (n = 3, answer = NO) |
18 | Correct | 2 ms | 376 KB | OK (n = 100, answer = NO) |
19 | Correct | 2 ms | 376 KB | OK (n = 100, answer = YES) |
20 | Incorrect | 9 ms | 256 KB | Contestant can not find answer, jury can |
21 | Halted | 0 ms | 0 KB | - |