#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
v.emplace_back(w[i], i);
}
sort(v.begin(), v.end());
int s = 0, h = 0, t = 0;
while (t < n) {
while (t < n && s < l) {
s += v[t].first;
t++;
}
if (l <= s && s <= u) {
vector<int> ans;
for (int i = h; i < t; i++) ans.emplace_back(i);
return ans;
}
while (h < t && s >= l) {
s -= w[h];
h++;
}
}
return vector<int>();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 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 |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 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 |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
6 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 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 |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 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 |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
26 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 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 |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 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 |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
26 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 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 |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 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 |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
26 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 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 |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 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 |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
26 |
Halted |
0 ms |
0 KB |
- |