#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define TRACE(x) cout << #x << " :: " << x << endl;
#define _ << " " <<
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
vector<int> find_subset(int l, int u, vector<int> w) {
int N = SZ(w);
vector<int> ind(N);
iota(ALL(ind),0);
sort(ALL(ind),[=](int a, int b){ return (w[a] != w[b] ? w[a] > w[b] : a < b); });
vector<int> ans;
long long sum = 0;
for (int i : ind) {
if (sum+w[i] <= u) {
sum += w[i];
ans.push_back(i);
if (sum >= l) break;
}
}
if (sum < l) ans.clear();
return ans;
}
# |
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 |
4 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
384 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 |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 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 |
5 ms |
384 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 |
4 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
384 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 |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
5 ms |
384 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 |
4 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
384 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 |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
5 ms |
384 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 |
4 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
384 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 |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
5 ms |
384 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 |
4 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
384 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 |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
5 ms |
384 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |