#include "molecules.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int N = w.size();
sort(w.begin(), w.end());
ll taken = 0;
vector<int> v;
for(int i = N - 1; i >= 0; --i){
if(taken < l && taken + w[i] <= u){
taken += w[i];
v.push_back(i);
}
}
sort(v.begin(), v.end());
if(taken < l or taken > u)v.clear();
return v;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |