#include "prize.h"
// author : sentheta aka vanwij
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<random>
#include<chrono>
#include<cmath>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))
#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define dbg(x) if(1) cout << "?" << #x << " : " << (x) << endl << flush;
const int N = 2e5+5;
V<int> memo[N];
pii query(int i){
if(memo[i].empty()) memo[i] = ask(i);
return {memo[i][0], memo[i][1]};
}
int n;
#define mid (tl+tr)/2
#define lc (v+1)
#define rc (v+2*(mid-tl+1))
struct Segtree{
int cnt[2*N];
void upd(int i,int v=0,int tl=0,int tr=n-1){
if(tl==tr){
cnt[i] = 1; return;
}
if(i<=mid) upd(i, lc,tl,mid);
else upd(i, rc,mid+1,tr);
cnt[v] = cnt[lc] + cnt[rc];
}
int qry(int l,int r,int v=0,int tl=0,int tr=n-1){
if(r<tl || tr<l) return 0;
if(l<=tl && tr<=r) return cnt[v];
return qry(l,r, lc,tl,mid) + qry(l,r, rc,mid+1,tr);
}
} segtree;
#undef mid
int mx = 0;
int dnc(int lout=0,int rout=0,int l=0,int r=n-1){
if(l > r) return -1;
int midcnt = 0;
for(int m=(l+r)/2; m<=r; m++){
auto[lcnt,rcnt] = query(m);
if(lcnt+rcnt==0) return m;
if(lcnt+rcnt < mx){
midcnt++; continue;
}
if(lcnt > lout+midcnt){
int i = dnc(lout,midcnt+rcnt, l,(l+r)/2-1);
if(i!=-1) return i;
}
if(rcnt > rout){
int i = dnc(lcnt,rout, m+1,r);
if(i!=-1) return i;
}
return -1;
}
for(int m=(l+r)/2-1; m>=l; m--){
auto[lcnt,rcnt] = query(m);
if(lcnt+rcnt==0) return m;
if(lcnt+rcnt < mx){
midcnt++; continue;
}
// assert(rcnt == midcnt + rout);
if(lcnt > lout){
int i = dnc(lout,rcnt, l,m-1);
if(i!=-1) return i;
}
return -1;
}
return -1;
}
int find_best(int _n){
n = _n;
// map<int,V<int>> mp;
rep(i,0,480){
auto[lcnt,rcnt] = query(i);
if(lcnt+rcnt==0) return i;
// mp[lcnt+rcnt].push_back(i);
mx = max(mx, lcnt+rcnt);
}
// assert((int)mp.size()<=5);
// for(auto&[x,v] : mp){
// if(x==mx){
// }
// else{
// // for(int i : v){
// // segtree.upd(i);
// // }
// }
// }
int ans = dnc();
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
4988 KB |
Output is correct |
2 |
Correct |
9 ms |
5000 KB |
Output is correct |
3 |
Correct |
6 ms |
5004 KB |
Output is correct |
4 |
Correct |
7 ms |
4984 KB |
Output is correct |
5 |
Correct |
9 ms |
4992 KB |
Output is correct |
6 |
Correct |
4 ms |
4992 KB |
Output is correct |
7 |
Correct |
6 ms |
4988 KB |
Output is correct |
8 |
Correct |
5 ms |
5000 KB |
Output is correct |
9 |
Correct |
6 ms |
4992 KB |
Output is correct |
10 |
Correct |
6 ms |
4944 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
5000 KB |
Output is correct |
2 |
Correct |
10 ms |
4996 KB |
Output is correct |
3 |
Correct |
7 ms |
5192 KB |
Output is correct |
4 |
Correct |
8 ms |
4976 KB |
Output is correct |
5 |
Correct |
7 ms |
4988 KB |
Output is correct |
6 |
Correct |
3 ms |
4988 KB |
Output is correct |
7 |
Correct |
11 ms |
4944 KB |
Output is correct |
8 |
Correct |
8 ms |
4944 KB |
Output is correct |
9 |
Correct |
6 ms |
4944 KB |
Output is correct |
10 |
Correct |
6 ms |
4944 KB |
Output is correct |
11 |
Correct |
8 ms |
4996 KB |
Output is correct |
12 |
Correct |
6 ms |
4996 KB |
Output is correct |
13 |
Correct |
12 ms |
5072 KB |
Output is correct |
14 |
Correct |
5 ms |
5008 KB |
Output is correct |
15 |
Correct |
14 ms |
4944 KB |
Output is correct |
16 |
Correct |
34 ms |
5064 KB |
Output is correct |
17 |
Correct |
7 ms |
4984 KB |
Output is correct |
18 |
Correct |
44 ms |
5136 KB |
Output is correct |
19 |
Correct |
7 ms |
4944 KB |
Output is correct |
20 |
Correct |
16 ms |
5020 KB |
Output is correct |
21 |
Correct |
11 ms |
5048 KB |
Output is correct |
22 |
Correct |
8 ms |
4944 KB |
Output is correct |
23 |
Correct |
8 ms |
4996 KB |
Output is correct |
24 |
Correct |
6 ms |
4944 KB |
Output is correct |
25 |
Correct |
35 ms |
4980 KB |
Output is correct |
26 |
Correct |
29 ms |
4992 KB |
Output is correct |
27 |
Correct |
9 ms |
4944 KB |
Output is correct |
28 |
Correct |
51 ms |
5040 KB |
Output is correct |
29 |
Correct |
33 ms |
5080 KB |
Output is correct |
30 |
Correct |
39 ms |
5020 KB |
Output is correct |
31 |
Correct |
8 ms |
4944 KB |
Output is correct |
32 |
Correct |
12 ms |
4992 KB |
Output is correct |
33 |
Correct |
3 ms |
4944 KB |
Output is correct |
34 |
Correct |
23 ms |
5012 KB |
Output is correct |
35 |
Correct |
9 ms |
4992 KB |
Output is correct |
36 |
Correct |
16 ms |
5024 KB |
Output is correct |
37 |
Correct |
9 ms |
4944 KB |
Output is correct |
38 |
Correct |
8 ms |
4984 KB |
Output is correct |
39 |
Correct |
26 ms |
4992 KB |
Output is correct |
40 |
Correct |
24 ms |
5116 KB |
Output is correct |
41 |
Correct |
37 ms |
5072 KB |
Output is correct |
42 |
Correct |
34 ms |
5052 KB |
Output is correct |
43 |
Correct |
31 ms |
5068 KB |
Output is correct |
44 |
Correct |
28 ms |
5016 KB |
Output is correct |
45 |
Correct |
21 ms |
4944 KB |
Output is correct |
46 |
Correct |
6 ms |
4988 KB |
Output is correct |
47 |
Correct |
20 ms |
5052 KB |
Output is correct |
48 |
Correct |
41 ms |
5128 KB |
Output is correct |
49 |
Correct |
12 ms |
5000 KB |
Output is correct |
50 |
Correct |
55 ms |
5244 KB |
Output is correct |
51 |
Correct |
27 ms |
5020 KB |
Output is correct |
52 |
Correct |
7 ms |
4988 KB |
Output is correct |
53 |
Correct |
7 ms |
5012 KB |
Output is correct |
54 |
Correct |
29 ms |
5044 KB |
Output is correct |
55 |
Correct |
7 ms |
4988 KB |
Output is correct |
56 |
Correct |
42 ms |
5068 KB |
Output is correct |
57 |
Correct |
42 ms |
5144 KB |
Output is correct |
58 |
Correct |
41 ms |
5124 KB |
Output is correct |
59 |
Correct |
33 ms |
5016 KB |
Output is correct |
60 |
Correct |
25 ms |
5032 KB |
Output is correct |
61 |
Correct |
8 ms |
5000 KB |
Output is correct |
62 |
Correct |
6 ms |
4944 KB |
Output is correct |
63 |
Correct |
8 ms |
4996 KB |
Output is correct |
64 |
Correct |
9 ms |
4944 KB |
Output is correct |
65 |
Correct |
6 ms |
5004 KB |
Output is correct |
66 |
Correct |
9 ms |
4976 KB |
Output is correct |
67 |
Correct |
13 ms |
4992 KB |
Output is correct |
68 |
Correct |
6 ms |
4944 KB |
Output is correct |
69 |
Correct |
12 ms |
4988 KB |
Output is correct |
70 |
Correct |
10 ms |
4944 KB |
Output is correct |
71 |
Partially correct |
57 ms |
5244 KB |
Partially correct - number of queries: 5238 |
72 |
Correct |
11 ms |
5008 KB |
Output is correct |
73 |
Partially correct |
42 ms |
5160 KB |
Partially correct - number of queries: 5175 |
74 |
Partially correct |
49 ms |
5140 KB |
Partially correct - number of queries: 5202 |
75 |
Correct |
10 ms |
5064 KB |
Output is correct |
76 |
Correct |
37 ms |
5020 KB |
Output is correct |
77 |
Correct |
40 ms |
5064 KB |
Output is correct |
78 |
Correct |
15 ms |
4996 KB |
Output is correct |
79 |
Correct |
25 ms |
5064 KB |
Output is correct |
80 |
Correct |
30 ms |
5148 KB |
Output is correct |
81 |
Correct |
55 ms |
5064 KB |
Output is correct |
82 |
Correct |
41 ms |
5040 KB |
Output is correct |
83 |
Correct |
8 ms |
4992 KB |
Output is correct |
84 |
Correct |
37 ms |
5068 KB |
Output is correct |
85 |
Correct |
50 ms |
5064 KB |
Output is correct |
86 |
Correct |
9 ms |
4944 KB |
Output is correct |
87 |
Correct |
6 ms |
4944 KB |
Output is correct |
88 |
Correct |
8 ms |
5008 KB |
Output is correct |
89 |
Correct |
8 ms |
4944 KB |
Output is correct |
90 |
Correct |
7 ms |
5012 KB |
Output is correct |
91 |
Correct |
7 ms |
4936 KB |
Output is correct |
92 |
Correct |
9 ms |
4944 KB |
Output is correct |
93 |
Correct |
10 ms |
5008 KB |
Output is correct |
94 |
Correct |
7 ms |
5020 KB |
Output is correct |
95 |
Correct |
10 ms |
5012 KB |
Output is correct |
96 |
Correct |
7 ms |
4944 KB |
Output is correct |
97 |
Correct |
6 ms |
5020 KB |
Output is correct |