#include <bits/stdc++.h>
#define ll long long
using namespace std;
std::vector<int> find_subset(int l, int u, std::vector<int> w) {
ll s = 0, L = l, R = u;
int n = w.size();
vector < int > ans;
vector < pair < int, int > > a;
for(int i = 0; i < n; i++) a.push_back({w[i], i});
sort(a.begin(), a.end());
for(int i = 0; i < n; i++){
s += a[i].first;
if(L <= s && s <= R){
for(int j = 0; j <= i; j++) ans.push_back(a[j].second);
// for(int it : ans) cout << it << ' ';
// cout << '\n';
return ans;
}
}
s = 0;
reverse(a.begin(), a.end());
for(int i = 0; i < n; i++){
s += a[i].first;
if(L <= s && s <= R){
for(int j = 0; j <= i; j++) ans.push_back(a[j].second);
// for(int it : ans) cout << it << ' ';
// cout << '\n';
return ans;
}
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
340 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
340 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
508 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
340 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
340 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Contestant can not find answer, jury can |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
340 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
340 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
508 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
340 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
340 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
1 ms |
340 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
340 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
340 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
508 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
340 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
340 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
1 ms |
340 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
340 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
340 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
508 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
340 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
340 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
1 ms |
340 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
1 ms |
340 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
1 ms |
340 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
1 ms |
340 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
1 ms |
508 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
340 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
340 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
340 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
1 ms |
340 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |