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