#include "molecules.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<int> v;
int n = w.size();
typedef pair<long long, long long> ii;
ii arr[n];
for(int i = 0;i < n;i++){
arr[i] = ii(w[i],i);
}
sort(arr,arr+n);
long long low = 0;
long long high = 0;
vector<int> ll;
vector<int> hh;
for(int c = 0;c < n;c++){
low += arr[c].first;
high += arr[n-c-1].first;
ll.push_back(arr[c].second);
hh.push_back(arr[n-c-1].second);
if(l <= low && low <= u){
return ll;
}
else if(l <= high && high <= u){
return hh;
}
else if(low < l && high > u){
}
}
return v;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
356 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
332 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
324 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
304 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
356 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
356 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
332 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
324 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
304 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
356 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
356 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
332 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
324 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
304 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
356 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
356 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
332 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
324 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
304 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
356 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
384 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
384 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
356 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
332 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
324 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
304 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
384 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
356 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
384 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
256 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |