#include<bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
int n=w.size();
vector<pair<long long,int> >r;
vector<int> rr;
for(int i=0;i<n;i++){
r.push_back(make_pair(w[i],i));
}
sort(r.begin(),r.end());
long long rt=0;
int p1=0,p2=n-1;bool x=false;
while(rt<=u && p2>=p1){
if(rt+r[p2].first<=u){
rr.push_back(r[p2].second);
rt=rt+r[p2].first;
p2--;
}
else {
rr.push_back(r[p1].second);
rt=rt+r[p1].first;
p1++;
}
if(rt>=l && rt<=u){x=true;
break;
}
}
sort(rr.begin(),rr.end());
if(!x)rr.clear();
return rr;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
4 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
6 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
512 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
384 KB |
OK (n = 100, answer = YES) |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
4 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
6 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
512 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
4 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
6 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
512 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
4 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
6 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
512 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
5 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
4 ms |
384 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
4 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
6 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
4 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
4 ms |
256 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
5 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
5 ms |
384 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
5 ms |
512 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
5 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
4 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |