#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
vector<int> find_subset(int l, int u, vector<int> w) {
sort(w.begin(), w.end());
int N = w.size();
long long sum = w[0];
int low = 0, up = 0;
while((sum < l || sum > u) && up < N){
if(low > up)break;
if(sum < l){
up++;
sum += w[up];
}else if(sum > u){
sum -= w[low];
low++;
}
// cout << low << " " << up << " " << sum << "\n";
}
if(l <= sum && sum <= u){
for(int i = low; i <= up; i++){
ans.push_back(i);
}
return ans;
}
return vector<int>(0);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
256 KB |
OK (n = 100, answer = YES) |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
2 ms |
256 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 |
376 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
2 ms |
376 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 |
376 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 |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 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 |
256 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 |
376 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
2 ms |
376 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 |
376 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 |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 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 |
256 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 |
376 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
2 ms |
376 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 |
376 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 |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 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 |
256 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 |
376 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
2 ms |
376 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 |
376 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 |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 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 |
256 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 |
376 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
2 ms |
376 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 |
376 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 |
- |