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