#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
map<int,int> mp;
vector<int> idx;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n = w.size();
idx.push_back(0);
bool ok = true;
int k = -1;
for (int i = 0 ; i < n ; i++){
int sz = idx.size();
for (int j = 0 ; j < sz ; j++){
idx.push_back(idx[j] + w[i]);
if (mp[idx[j] + w[i]] > 0)continue;
mp[idx[j] + w[i]] = i + 2;
if ((idx[j] + w[i] >= l)&&( idx[j] + w[i] <= u)){ok = false; k = idx[j] + w[i]; break;}
}
if (!ok)break;
}
vector<int> ans;
if (k == -1)return ans;
while(k){
ans.push_back(mp[k] - 2);
k-= w[mp[k] - 2];
}
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
384 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 |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
384 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 |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 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 |
Runtime error |
168 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
19 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
5 ms |
384 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 |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
5 ms |
384 KB |
OK (n = 12, answer = YES) |
11 |
Runtime error |
164 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
384 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 |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
384 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 |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 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 |
Runtime error |
168 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
19 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
384 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 |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
384 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 |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 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 |
Runtime error |
168 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
19 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
384 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 |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
384 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 |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 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 |
Runtime error |
168 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
19 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
5 ms |
384 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 |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
384 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 |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 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 |
Runtime error |
168 ms |
65540 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
19 |
Halted |
0 ms |
0 KB |
- |