#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n = w.size();
vector<int> p(n);
for (int i = 0; i < n; ++i) {
p[i] = i;
}
sort(p.begin(), p.end(), [&](const int &x, const int &y) {
return w[x] < w[y];
});
long long prefix = 0, suffix = 0;
for (int i = 0; i < n; ++i) {
suffix += w[p[i]];
}
for (int i = 0, j = 0; i < n; ++i) {
if (prefix > u) {
break;
}
while (prefix + suffix > u || j < i) {
suffix -= w[p[j++]];
}
if (prefix + suffix >= l) {
vector<int> ans;
for (int k = 0; k < i; ++k) {
ans.push_back(p[k]);
}
for (int k = j; k < n; ++k) {
ans.push_back(p[k]);
}
return ans;
}
}
return vector<int>();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
396 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 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 |
504 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 |
376 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 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 |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
396 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 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 |
504 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 |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 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 |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
396 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 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 |
504 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 |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 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 |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
396 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 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 |
504 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 |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 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 |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
396 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 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 |
504 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 |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |