#include <iostream>
#include "molecules.h"
#include <vector>
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w){
long long n=w.size();
long long tot=1<<n;
vector<int> res;
bool ja=false;
for(int i=0;i<tot;i++){
long long sum=0;
res.clear();
for(int j=0;j<n;j++){
if(i&(1<<j)){
sum+=w[j];
res.push_back(j);
}
}
if(sum>=l and sum<=u){ ja=true; break; }
}
if(!ja){ res.clear(); }
return res;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 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 |
4 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 |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
4 ms |
256 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
5 ms |
256 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
5 ms |
256 KB |
Contestant can not find answer, jury can |
13 |
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 |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 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 |
4 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 |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
# |
결과 |
실행 시간 |
메모리 |
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 |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 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 |
4 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 |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
# |
결과 |
실행 시간 |
메모리 |
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 |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 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 |
4 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 |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
# |
결과 |
실행 시간 |
메모리 |
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 |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
5 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
5 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 |
4 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 |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
4 ms |
256 KB |
OK (n = 100, answer = NO) |
19 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |