#include "molecules.h"
#include <bits/stdc++.h>
#define all(v) v.begin(),v.end()
#define eb emplace_back
using ll=long long;
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
sort(all(w));
int n=w.size();
vector<ll> sum(n+1);
for(int i=0;i<n;i++){
sum[i+1]=sum[i]+w[i];
}
for(ll k=1;k<=n;k++){
ll mi=sum[k],ma=sum[n]-sum[n-k];
if(l<=ma&&mi<=u){
ll s=mi;
for(int i=k;i<n;i++){
if(l<=s&&s<=u){
vector<int> v;
for(int j=i-k;j<i;j++)v.eb(j);
return v;
}
s+=w[i]-w[i-k];
}
if(l<=s&&s<=u){
vector<int> v;
for(int j=n-k;j<n;j++)v.eb(j);
return v;
}
}
}
return vector<int>(0);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
376 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
376 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
5 ms |
376 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
4 ms |
508 KB |
sum of weights should be in [50..51] but it is 37 |
13 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
376 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
5 ms |
376 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
4 ms |
508 KB |
sum of weights should be in [50..51] but it is 37 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
376 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
5 ms |
376 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
4 ms |
508 KB |
sum of weights should be in [50..51] but it is 37 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
376 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
5 ms |
376 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
4 ms |
508 KB |
sum of weights should be in [50..51] but it is 37 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
376 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
5 ms |
376 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
5 ms |
376 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
4 ms |
508 KB |
sum of weights should be in [50..51] but it is 37 |
32 |
Halted |
0 ms |
0 KB |
- |