#include <bits/stdc++.h>
#include "molecules.h"
using namespace std;
vector<int> ret;
vector<pair<int,int> > v;
void get(int l, int r) {
for(int i = l; i <= r; i++)
ret.push_back(v[i].second);
}
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
int n = w.size();
for(int i = 0; i < n; i++)
v.push_back({w[i],i});
sort(v.begin(),v.end());
if(v[0].first > u) return ret;
long long x = 0, sum = w[0];
while(x + 1 < n && sum + v[x + 1].first < l) { sum += v[x + 1].first; x++; }
if(x + 1 < n && sum + v[x + 1].first <= u && sum + v[x + 1].first >= l) {
get(0,x+1);
return ret;
}
for(int i = x + 1; i < n; i++) {
sum += v[i].first;
sum -= v[i - x - 1].first;
if(l <= sum && sum <= u) {
get(i - x, i);
return ret;
}
}
return ret;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
484 KB |
OK (n = 1, answer = NO) |
3 |
Incorrect |
2 ms |
484 KB |
Contestant can not find answer, jury can |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
484 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
2 ms |
484 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
2 ms |
484 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
2 ms |
484 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
2 ms |
484 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
2 ms |
504 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
2 ms |
548 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
2 ms |
560 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
2 ms |
560 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
2 ms |
600 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
2 ms |
600 KB |
OK (n = 100, answer = NO) |
12 |
Correct |
2 ms |
600 KB |
OK (n = 100, answer = YES) |
13 |
Correct |
2 ms |
608 KB |
OK (n = 100, answer = NO) |
14 |
Correct |
2 ms |
608 KB |
OK (n = 100, answer = YES) |
15 |
Correct |
2 ms |
608 KB |
OK (n = 100, answer = YES) |
16 |
Correct |
2 ms |
652 KB |
OK (n = 100, answer = YES) |
17 |
Correct |
2 ms |
652 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
484 KB |
OK (n = 1, answer = NO) |
3 |
Incorrect |
2 ms |
484 KB |
Contestant can not find answer, jury can |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
484 KB |
OK (n = 1, answer = NO) |
3 |
Incorrect |
2 ms |
484 KB |
Contestant can not find answer, jury can |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
484 KB |
OK (n = 1, answer = NO) |
3 |
Incorrect |
2 ms |
484 KB |
Contestant can not find answer, jury can |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
484 KB |
OK (n = 1, answer = NO) |
3 |
Incorrect |
2 ms |
484 KB |
Contestant can not find answer, jury can |
4 |
Halted |
0 ms |
0 KB |
- |