#include "molecules.h"
#include <bits/stdc++.h>
#define ll long long
#define st first
#define nd second
using namespace std;
vector<int> find_subset(int L, int U, vector<int> W) {
ll l = L;
ll u = U;
vector<pair<ll, int>> w;
for(int i=0; i<(int)W.size(); ++i) {
w.push_back({W[i], i});
}
sort(w.begin(), w.end());
ll sum=0;
int n = w.size(), i = 0;
vector<int> ans;
while(i<n && sum+w[i].st<=u) {
sum+=w[i].st;
ans.push_back(w[i].nd);
i++;
}
i = n-1;
vector<int> added;
while(ans.size() && sum+w[i].st-w[ans.back()].st<=u) {
sum+=w[i].st-w[ans.back()].st;
added.push_back(w[i].nd);
i--;
ans.pop_back();
}
if(sum>=l && sum<=u) {
for(int k: added) {
ans.push_back(k);
}
return ans;
}
else {
return vector<int>();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
512 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
6 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
384 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = YES) |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
5 ms |
308 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
4 ms |
384 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
5 ms |
384 KB |
sum of weights should be in [50..51] but it is 71 |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
512 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
6 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
384 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
5 ms |
308 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
4 ms |
384 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
5 ms |
384 KB |
sum of weights should be in [50..51] but it is 71 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
512 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
6 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
384 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
5 ms |
308 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
4 ms |
384 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
5 ms |
384 KB |
sum of weights should be in [50..51] but it is 71 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
512 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
6 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
384 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
5 ms |
308 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
4 ms |
384 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
5 ms |
384 KB |
sum of weights should be in [50..51] but it is 71 |
32 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
5 ms |
512 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
6 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
384 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
5 ms |
308 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
4 ms |
384 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
5 ms |
256 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
5 ms |
384 KB |
sum of weights should be in [50..51] but it is 71 |
32 |
Halted |
0 ms |
0 KB |
- |