#include "molecules.h"
//#include "grader.cpp"
#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>> a;
for(int i=0;i<n;i++){
a.push_back({w[i], i});
}
sort(a.begin(), a.end());
vector<int> ans;
int sum = 0;
for(auto x : w)sum += x;
if(sum < l)return ans;
sum = 0;
int m=0;
for(int i=0;i<n;i++){
sum += a[i].first;
while(sum > u)sum -= a[m].first, m++;
if(sum >= l && sum <= u){
for(int j=m;j<=i;j++)ans.push_back(j);
break;
}
}
// cout << sum << ' ';
return ans;
}
/*
4 15 17
6 8 8 7
4 14 15
5 5 6 6
4 10 20
15 17 16 18
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
128 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
1 ms |
384 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
1 ms |
256 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
1 ms |
256 KB |
sum of weights should be in [50..51] but it is 73 |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
128 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
384 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
1 ms |
256 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
128 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
384 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
1 ms |
256 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
128 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
384 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
1 ms |
256 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
128 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
384 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
1 ms |
256 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |