#include<bits/stdc++.h>
#ifdef LOCAL_DEFINE
#include<conio.h>
#endif
using namespace std;
void io();
void end();
vector<int> find_subset(int l, int u, vector<int> v){
int n = v.size();
vector<pair<int, int>> p(n);
vector<int> ans(0), pref(n+1, 0);
for(int i = 0; i < n; i++){
p[i] = {v[i], i};
pref[i+1]=pref[i]+v[i];
if(v[i]>=l and v[i]<=u){ ans.push_back(i); return ans; }
}
int ll = -1, r = -1;
sort(p.begin(), p.end());
for(int i = 0, j = 1; j<=n;){
if((pref[j]-pref[i])>=l and (pref[j]-pref[i])<=u){ ll = i; r = j-1; break; }
if((pref[j]-pref[i])>u) i++;
else if((pref[j]-pref[i])<l) j++;
}
if(ll==-1) for(int i = n-1, j = n; i>=0;){
if((pref[j]-pref[i])>=l and (pref[j]-pref[i])<=u){ ll = i; r = j-1; break; }
if((pref[j]-pref[i])>u){ j--; if(i==j) i--; }
else if((pref[j]-pref[i])<l) i--;
}
if(ll!=-1) for(int i = ll; i <= r; i++) ans.push_back(p[i].second);
return ans;
}
/*
int main(){
io();
int l, u, n;
cin >> l >> u >> n;
vector<int> v(n);
for(int& i: v) cin >> i;
vector<int> z = find_subset(l, u, v);
for(auto i: z) cout << i << ' ';
end();
}
*/
void io(){
#ifdef LOCAL_DEFINE
ios_base::sync_with_stdio(0); cin.tie(0);
freopen("input.txt", "rt", stdin);
#endif
}
void end(){
#ifdef LOCAL_DEFINE
cerr << "\nTime Elapsed: " << 1.0 * clock()/CLOCKS_PER_SEC << " s.\n";
getch();
#endif
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
2 ms |
376 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 |
376 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
376 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 |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
2 ms |
252 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
2 ms |
380 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
12 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [50..51] but it is 32 |
13 |
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 |
376 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 |
376 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
376 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 |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
252 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
380 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [50..51] but it is 32 |
32 |
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 |
376 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 |
376 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
376 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 |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
252 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
380 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [50..51] but it is 32 |
32 |
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 |
376 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 |
376 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
376 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 |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
252 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
380 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [50..51] but it is 32 |
32 |
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 |
376 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 |
376 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
2 ms |
380 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
2 ms |
376 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
2 ms |
376 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 |
256 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
2 ms |
252 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
2 ms |
380 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
2 ms |
256 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
2 ms |
256 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
2 ms |
376 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
2 ms |
376 KB |
OK (n = 100, answer = NO) |
31 |
Incorrect |
2 ms |
376 KB |
sum of weights should be in [50..51] but it is 32 |
32 |
Halted |
0 ms |
0 KB |
- |