#include <bits/stdc++.h>
using namespace std;
#define sst string
#define REP(i,x,y) for(ll i=x;i<=y;i++)
#define freeopen freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define mod 1000000007
#define pb push_back
#define mk make_pair
#define ll long long
#define foor(x,vec) for(auto x:vec ){cout<<x<<" ";}
#define fi first
#define se second
#define MAXN 1000069
#define lld long double
#define cha ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ffl fflush(stdout)
#define pii pair<ll,ll>
ll mvx[]={1,-1,0,0};
ll mvy[]={0,0,-1,1};
vector <pair<int,int>> w;
vector <int> find_subset(int l,int u,vector<int> a){
int n=(int)a.size();
vector<int> ans;
int sum=0;
int r=0;
for(int i=0;i<n;i++)w.pb({a[i], i});
sort(w.begin(),w.end());
for(int i=0;i<n;i++){
while(sum<l && r<n){
sum+=w[r].fi;
r++;
}
if(l<=sum && sum<=u ){
for(ll j=i;j<r;j++){
ans.pb(w[j].se);
}
return ans;
break;
}
sum-=a[i];
}
return {};
}
/*
---------------------------------------------------go get gold---------------------------------------------------------------------
- If u see the problem dp there's many option to iterate, u can iterate from 1- n or 1 - (possible max number)
- If u see the problem that has unexpected constraint u can divide it into 2 problem
- If u see the problem that can use binary search, then u can use binser + check condition
- in interactive problem there's many trick using binser
- kalo misal mau cari yang sama pake pernah ke visit ga bilangan itu
- kalo problem yang high itu biasanya optimisasi nya pake 2 array
- dp bisa aja kek kamu tenzing balls dimana optimisasi 2 dp
- janlup fibonacci
- kalo binser mending r = 3 * 1e18 aja
- kalo mau dibalik itu pake value nya tinggal diubah ke size
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = YES) |
2 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
3 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
6 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
7 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
9 |
Correct |
1 ms |
348 KB |
OK (n = 6, answer = YES) |
10 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
11 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
13 |
Correct |
0 ms |
344 KB |
OK (n = 100, answer = NO) |
14 |
Correct |
0 ms |
600 KB |
OK (n = 100, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
17 |
Correct |
0 ms |
344 KB |
OK (n = 100, answer = YES) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
32 |
Correct |
0 ms |
344 KB |
OK (n = 100, answer = NO) |
33 |
Correct |
0 ms |
600 KB |
OK (n = 100, answer = YES) |
34 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
35 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
36 |
Correct |
0 ms |
344 KB |
OK (n = 100, answer = YES) |
37 |
Correct |
0 ms |
344 KB |
OK (n = 28, answer = YES) |
38 |
Correct |
0 ms |
344 KB |
OK (n = 27, answer = YES) |
39 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [990..999] but it is 1018 |
40 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
32 |
Correct |
0 ms |
344 KB |
OK (n = 100, answer = NO) |
33 |
Correct |
0 ms |
600 KB |
OK (n = 100, answer = YES) |
34 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
35 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
36 |
Correct |
0 ms |
344 KB |
OK (n = 100, answer = YES) |
37 |
Correct |
0 ms |
344 KB |
OK (n = 28, answer = YES) |
38 |
Correct |
0 ms |
344 KB |
OK (n = 27, answer = YES) |
39 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [990..999] but it is 1018 |
40 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
32 |
Correct |
0 ms |
344 KB |
OK (n = 100, answer = NO) |
33 |
Correct |
0 ms |
600 KB |
OK (n = 100, answer = YES) |
34 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
35 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
36 |
Correct |
0 ms |
344 KB |
OK (n = 100, answer = YES) |
37 |
Correct |
0 ms |
344 KB |
OK (n = 28, answer = YES) |
38 |
Correct |
0 ms |
344 KB |
OK (n = 27, answer = YES) |
39 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [990..999] but it is 1018 |
40 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
OK (n = 1, answer = NO) |
2 |
Correct |
1 ms |
348 KB |
OK (n = 1, answer = NO) |
3 |
Correct |
0 ms |
344 KB |
OK (n = 1, answer = YES) |
4 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
5 |
Correct |
0 ms |
348 KB |
OK (n = 2, answer = YES) |
6 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
7 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
8 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
9 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
10 |
Correct |
1 ms |
344 KB |
OK (n = 3, answer = YES) |
11 |
Correct |
0 ms |
344 KB |
OK (n = 3, answer = YES) |
12 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
13 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
14 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
15 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = YES) |
16 |
Correct |
0 ms |
348 KB |
OK (n = 3, answer = NO) |
17 |
Correct |
1 ms |
348 KB |
OK (n = 3, answer = NO) |
18 |
Correct |
1 ms |
348 KB |
OK (n = 100, answer = NO) |
19 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
20 |
Correct |
1 ms |
344 KB |
OK (n = 12, answer = YES) |
21 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
22 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
23 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = NO) |
24 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
25 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
26 |
Correct |
1 ms |
348 KB |
OK (n = 12, answer = YES) |
27 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
28 |
Correct |
1 ms |
348 KB |
OK (n = 6, answer = YES) |
29 |
Correct |
0 ms |
348 KB |
OK (n = 12, answer = YES) |
30 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = NO) |
31 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
32 |
Correct |
0 ms |
344 KB |
OK (n = 100, answer = NO) |
33 |
Correct |
0 ms |
600 KB |
OK (n = 100, answer = YES) |
34 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
35 |
Correct |
0 ms |
348 KB |
OK (n = 100, answer = YES) |
36 |
Correct |
0 ms |
344 KB |
OK (n = 100, answer = YES) |
37 |
Correct |
0 ms |
344 KB |
OK (n = 28, answer = YES) |
38 |
Correct |
0 ms |
344 KB |
OK (n = 27, answer = YES) |
39 |
Incorrect |
0 ms |
348 KB |
sum of weights should be in [990..999] but it is 1018 |
40 |
Halted |
0 ms |
0 KB |
- |