#include <bits/stdc++.h>
#include "molecules.h"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long
vector<int> find_subset(int l, int r, vector<int> w) {
int n = w.size();
array<int, 2> a[n];
for (int i = 0; i < n; i++) {
a[i][0] = w[i];
a[i][1] = i;
}
sort(a, a + n);
ll prf[n + 1]{};
for (int i = 0; i < n; i++) {
prf[i + 1] = prf[i] + a[i][0];
}
ll s = 0;
for (int i = n; i >= 0; i--) {
int p = lower_bound(prf, prf + n + 1, l - s) - prf;
if (l <= prf[p] + s && prf[p] + s <= r) {
vector<int> ans;
for (int j = 0; j < p; j++) {
ans.push_back(a[j][1]);
}
for (int j = i; j < n; j++) {
ans.push_back(a[j][1]);
}
return ans;
}
if (i - 1 >= 0) s += a[i - 1][0];
}
return {};
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
508 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Incorrect |
1 ms |
348 KB |
Integer 4 violates the range [0, 3] |
18 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
1 ms |
500 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
0 ms |
432 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
1 ms |
432 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
1 ms |
348 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
0 ms |
436 KB |
OK (n = 12, answer = YES) |
11 |
Incorrect |
1 ms |
348 KB |
Integer 150 violates the range [0, 100] |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
508 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Incorrect |
1 ms |
348 KB |
Integer 4 violates the range [0, 3] |
18 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
508 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Incorrect |
1 ms |
348 KB |
Integer 4 violates the range [0, 3] |
18 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
508 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Incorrect |
1 ms |
348 KB |
Integer 4 violates the range [0, 3] |
18 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
508 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Incorrect |
1 ms |
348 KB |
Integer 4 violates the range [0, 3] |
18 |
Halted |
0 ms |
0 KB |
- |