#include <bits/stdc++.h>
using namespace std;
vector<int> find_subset(int l, int u, vector<int> w) {
vector<int> result;
vector<pair<int, int>> poids;
for(int i = 0; i < (int)w.size(); i++) {
poids.push_back({w[i], i});
}
sort(poids.begin(), poids.end());
long long somme = 0;
int i2 = -1;
int a(-1), b(-1);
for(int i = 0; i < (int)w.size(); i++) {
if(i2 < i) {
somme = (long long)poids[i].first;
i2 = i;
}
while(i2+1 < (int)w.size() and somme+poids[i2+1].first<=u) {
somme += (long long)poids[i2+1].first;
i2++;
}
if(l <= somme and somme <= u) {
a = i;
b = i2;
break;
}
}
if(a == -1) return result;
for(int i = a; i <= b; i++) result.push_back(poids[i].second);
return result;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
436 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
640 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
640 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
3 ms |
640 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
640 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
640 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
640 KB |
Contestant can not find answer, jury can |
2 |
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 |
376 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
436 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
640 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
640 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
3 ms |
640 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
640 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
640 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
640 KB |
Contestant can not find answer, jury can |
21 |
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 |
376 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
436 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
640 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
640 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
3 ms |
640 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
640 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
640 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
640 KB |
Contestant can not find answer, jury can |
21 |
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 |
376 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
436 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
640 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
640 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
3 ms |
640 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
640 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
640 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
640 KB |
Contestant can not find answer, jury can |
21 |
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 |
376 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
436 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
640 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
3 ms |
640 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
3 ms |
640 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
640 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
640 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
640 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
640 KB |
Contestant can not find answer, jury can |
21 |
Halted |
0 ms |
0 KB |
- |