#include "molecules.h"
#include <algorithm>
#include <vector>
using namespace std;
vector<int> find_subset(int L, int R, vector<int> A) {
int N = A.size();
sort(A.begin(), A.end());
int i = 0, j = -1;
int sum = 0;
while(j < N && sum < L) {
sum += A[++j];
if(sum >= L) {
if(sum <= R) break;
while(sum > R && i <= j) {
sum -= A[i++];
}
}
}
vector<int> ans;
if(sum >= L && sum <= R) {
while(i <= j) {
ans.push_back(i);
i++;
}
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
1936 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
1936 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = YES) |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
0 ms |
1936 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
0 ms |
1936 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 |
1936 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
1936 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
1936 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
1936 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
1936 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 |
1936 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
1936 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
1936 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
1936 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
1936 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 |
1936 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
1936 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
1936 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
1936 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
1936 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 |
1936 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
1936 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
1936 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
1936 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
0 ms |
1936 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
0 ms |
1936 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
1936 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
1936 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
0 ms |
1936 KB |
sum of weights should be in [50..51] but it is 73 |
32 |
Halted |
0 ms |
0 KB |
- |