#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(w.begin(),w.end());
vector<int> ans;
int a=0;
int r=0;
int n=(int)w.size();
ll sum=0;
while(r<n&&a<n) {
sum+=w[r];
//cout<<sum<<endl;
while(sum>u) {
sum-=w[a];
a++;
}
if(sum>=l&&sum<=u) {
for(int i=a; i<=r; i++) {
ans.push_back(i);
}
goto ok;
}
r++;
}
ok: ;
if(ans.size()) return ans;
return std::vector<int>(0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 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 |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
3 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
3 ms |
384 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
384 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 |
384 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
2 ms |
256 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 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
2 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 |
2 ms |
384 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 |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
3 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
3 ms |
384 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
384 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 |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
256 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 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 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 |
2 ms |
384 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 |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
3 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
3 ms |
384 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
384 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 |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
256 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 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 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 |
2 ms |
384 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 |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
3 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
3 ms |
384 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
384 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 |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
256 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 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 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 |
2 ms |
384 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 |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
3 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
3 ms |
384 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
384 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 |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
256 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 |
Correct |
2 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 ms |
256 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |