#include "molecules.h"
#include "bits/stdc++.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 sum = 0;
int r = 0,n = w.size();
for(int i=0;i<n;i++){
sum += w[i];
while(r < i && sum > u){
sum-=w[r++];
}
if(sum >= l && sum <= u){
vector<int> ans;
for(int j=r;j<=i;j++){
ans.push_back(j);
}
return ans;
}
}
return vector<int>();
}
/*
int main(){
vector<int> x ={6,8,8,7},v = find_subset(15,17,x);
for(auto i:v)cout<<i<<" ";
cout<<endl;
return 0;
}*/
# |
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 |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 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 |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 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 |
0 ms |
256 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
0 ms |
256 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
1 ms |
256 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 |
0 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 |
0 ms |
256 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
0 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 |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 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 |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
256 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 |
0 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 |
0 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 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 |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 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 |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
256 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 |
0 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 |
0 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 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 |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 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 |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
256 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 |
0 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 |
0 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 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 |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 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 |
0 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
1 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
1 ms |
256 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 |
0 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 |
0 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
256 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |