#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
#define all(x) x.begin(), x.end()
#define rep(i,a,b) for(int i = a; i < b; i++)
vi find_subset(int l, int u, vi wi) {
int N = (int)wi.size();
vpii w(N);
rep(n,0,N) w[n] = make_pair(wi[n], n);
sort(all(w));
int bot = 0;
int top = 0;
int K = 0;
for(int k = 0; k <= N; k++) {
K = k;
if(l <= bot && bot <= u) {
vi ans(0);
rep(i,0,k) ans.push_back(w[i].second);
return ans;
}
if(l <= top && top <= u) {
vi ans(0);
rep(i,0,k) ans.push_back(w[N-1-i].second);
return ans;
}
if(bot < l && u < top)
break;
if(k == N) return vi(0);
bot += w[k].first;
top += w[N-1-k].first;
}
int k2 = 0;
rep(k,0,K) {
k2++;
bot -= w[K-1-k].first;
bot += w[N-1-k].second;
if(bot >= l) break;
}
vi ans(0);
rep(i,0,K-k2) ans.push_back(w[i].second);
rep(i,N-k2,N) ans.push_back(w[i].second);
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
376 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [302..304] but it is 306 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [302..304] but it is 306 |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [302..304] but it is 306 |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [302..304] but it is 306 |
21 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
2 ms |
256 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
2 ms |
256 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
2 ms |
256 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
1 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [302..304] but it is 306 |
21 |
Halted |
0 ms |
0 KB |
- |