#include "molecules.h"
#include "bits/stdc++.h"
using namespace std;
const int maxn = 2e5 + 10;
bool mrk[maxn];
vector<int> find_subset(int l, int r, vector<int>w) {
vector<int>ret;
long long sum = 0;
sort(w.begin(),w.end());
int n = (int)w.size();
int j = 0;
for(int i = 0; i < n; ++i){
sum += w[i];
mrk[i] = true;
while(j < i && sum > r){
sum -= w[j];
mrk[j] = false;
++j;
}
if(l <= sum && sum <= r) break;
}
if(l <= sum && sum <= r){
for(int i = 0; i < n; ++i)
if(mrk[i])
ret.push_back(i);
}
return ret;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
2220 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
2220 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = YES) |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
0 ms |
2220 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
0 ms |
2220 KB |
sum of weights should be in [50..51] but it is 73 |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
2220 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
2220 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
2220 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
2220 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
2220 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
2220 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
2220 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
2220 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
2220 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
2220 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
2220 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
2220 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
2220 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
2220 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
2220 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
2220 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
2220 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
2220 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
2220 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
2220 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |