#include "molecules.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<int> find_subset(int l, int u, vector<int> w){
int n = w.size();
sort(w.begin(), w.end());
ll ls = 0, rs = 0;
int cur = 0;
while (!(ls <= u && rs >= l)){
if (cur == n) return vector<int>(0);
ls += (ll) w[cur];
rs += (ll) w[n-cur-1];
cur++;
}
int next = cur;
while (!(l <= ls && ls <= u)){
ls += (ll) w[next]-(ll) w[next-cur];
next++;
}
vector<int> res(cur);
for (int i=0; i<cur; i++) res[i] = next-cur+i;
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
0 ms |
360 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [50..51] but it is 37 |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
360 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [50..51] but it is 37 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
360 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [50..51] but it is 37 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
360 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [50..51] but it is 37 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
360 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
604 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [50..51] but it is 37 |
32 |
Halted |
0 ms |
0 KB |
- |