#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int K = 450;
const int L = 5000;
const int mod = 1e9 + 7;
set <int> s;
int cnt = 0;
int mx = 0;
int qcount = 0;
int ans = -1;
int seed = 37;
int f(){
seed = 1ll*seed*seed%mod;
return seed;
}
void solve(int l,int r,int dl,int dr){
if(dl + dr >= mx)return;
if(l > r)return;
//cout<<l<<' '<<r<<' '<<dl<<' '<<dr<<'\n';
int mij = (l + r)/2;
for(int i = mij;i <= r;i++){
auto x = ask(i);
if(x[0] + x[1] == mx){
x[0]-=dl;
x[1]-=dr;
solve(i + 1,r,x[0] + dl,dr);
if(ans != -1)return;
solve(l,mij - 1,dl,dr + x[1] + i - mij);
return;
}else{
if(x[0] + x[1] == 0){
ans = i;
return;
}
}
}
solve(l,mij - 1,dl,dr);
return;
}
int find_best(int n) {
for(int i = 0;i < min(n,K);i++){
auto x = ask(i);
//qcount++;
//if(qcount >= L)break;
int nr = x[0] + x[1];
if(nr == 0)return i;
if(nr > mx){
mx = nr;
cnt = 1;
}else if(nr == mx){
cnt++;
}
}
solve(min(n,K),n - 1,min(n,K) - cnt,0);
return ans;
}
/**
8
3 3 3 3 2 2 2 1
**/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
344 KB |
Output is correct |
2 |
Correct |
2 ms |
344 KB |
Output is correct |
3 |
Correct |
2 ms |
344 KB |
Output is correct |
4 |
Correct |
2 ms |
344 KB |
Output is correct |
5 |
Correct |
2 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
2 ms |
344 KB |
Output is correct |
8 |
Correct |
2 ms |
344 KB |
Output is correct |
9 |
Correct |
2 ms |
344 KB |
Output is correct |
10 |
Correct |
3 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
344 KB |
Output is correct |
2 |
Correct |
2 ms |
344 KB |
Output is correct |
3 |
Correct |
2 ms |
344 KB |
Output is correct |
4 |
Correct |
2 ms |
344 KB |
Output is correct |
5 |
Correct |
2 ms |
428 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
2 ms |
344 KB |
Output is correct |
8 |
Correct |
2 ms |
344 KB |
Output is correct |
9 |
Correct |
2 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
11 |
Correct |
4 ms |
344 KB |
Output is correct |
12 |
Correct |
3 ms |
344 KB |
Output is correct |
13 |
Correct |
2 ms |
596 KB |
Output is correct |
14 |
Correct |
4 ms |
344 KB |
Output is correct |
15 |
Correct |
16 ms |
424 KB |
Output is correct |
16 |
Correct |
5 ms |
596 KB |
Output is correct |
17 |
Correct |
2 ms |
340 KB |
Output is correct |
18 |
Correct |
3 ms |
596 KB |
Output is correct |
19 |
Correct |
19 ms |
344 KB |
Output is correct |
20 |
Correct |
8 ms |
344 KB |
Output is correct |
21 |
Correct |
20 ms |
344 KB |
Output is correct |
22 |
Correct |
12 ms |
344 KB |
Output is correct |
23 |
Correct |
2 ms |
344 KB |
Output is correct |
24 |
Correct |
4 ms |
344 KB |
Output is correct |
25 |
Correct |
8 ms |
344 KB |
Output is correct |
26 |
Correct |
12 ms |
344 KB |
Output is correct |
27 |
Correct |
2 ms |
344 KB |
Output is correct |
28 |
Correct |
3 ms |
344 KB |
Output is correct |
29 |
Correct |
4 ms |
344 KB |
Output is correct |
30 |
Correct |
2 ms |
344 KB |
Output is correct |
31 |
Correct |
2 ms |
344 KB |
Output is correct |
32 |
Correct |
2 ms |
344 KB |
Output is correct |
33 |
Correct |
0 ms |
344 KB |
Output is correct |
34 |
Correct |
16 ms |
344 KB |
Output is correct |
35 |
Correct |
2 ms |
344 KB |
Output is correct |
36 |
Correct |
14 ms |
344 KB |
Output is correct |
37 |
Correct |
3 ms |
344 KB |
Output is correct |
38 |
Correct |
2 ms |
344 KB |
Output is correct |
39 |
Correct |
11 ms |
344 KB |
Output is correct |
40 |
Correct |
2 ms |
344 KB |
Output is correct |
41 |
Correct |
15 ms |
596 KB |
Output is correct |
42 |
Correct |
9 ms |
344 KB |
Output is correct |
43 |
Correct |
10 ms |
344 KB |
Output is correct |
44 |
Correct |
15 ms |
344 KB |
Output is correct |
45 |
Correct |
17 ms |
344 KB |
Output is correct |
46 |
Correct |
2 ms |
344 KB |
Output is correct |
47 |
Correct |
12 ms |
344 KB |
Output is correct |
48 |
Correct |
7 ms |
344 KB |
Output is correct |
49 |
Correct |
16 ms |
344 KB |
Output is correct |
50 |
Correct |
2 ms |
340 KB |
Output is correct |
51 |
Correct |
20 ms |
596 KB |
Output is correct |
52 |
Correct |
22 ms |
344 KB |
Output is correct |
53 |
Correct |
2 ms |
344 KB |
Output is correct |
54 |
Correct |
14 ms |
340 KB |
Output is correct |
55 |
Correct |
2 ms |
344 KB |
Output is correct |
56 |
Correct |
2 ms |
344 KB |
Output is correct |
57 |
Correct |
8 ms |
344 KB |
Output is correct |
58 |
Correct |
8 ms |
344 KB |
Output is correct |
59 |
Correct |
10 ms |
340 KB |
Output is correct |
60 |
Correct |
11 ms |
344 KB |
Output is correct |
61 |
Correct |
2 ms |
344 KB |
Output is correct |
62 |
Correct |
2 ms |
344 KB |
Output is correct |
63 |
Correct |
2 ms |
344 KB |
Output is correct |
64 |
Correct |
2 ms |
344 KB |
Output is correct |
65 |
Correct |
2 ms |
344 KB |
Output is correct |
66 |
Correct |
4 ms |
344 KB |
Output is correct |
67 |
Correct |
5 ms |
344 KB |
Output is correct |
68 |
Correct |
2 ms |
344 KB |
Output is correct |
69 |
Correct |
4 ms |
344 KB |
Output is correct |
70 |
Correct |
4 ms |
344 KB |
Output is correct |
71 |
Partially correct |
23 ms |
344 KB |
Partially correct - number of queries: 5209 |
72 |
Correct |
4 ms |
344 KB |
Output is correct |
73 |
Partially correct |
24 ms |
344 KB |
Partially correct - number of queries: 5146 |
74 |
Partially correct |
26 ms |
344 KB |
Partially correct - number of queries: 5173 |
75 |
Correct |
2 ms |
344 KB |
Output is correct |
76 |
Correct |
28 ms |
344 KB |
Output is correct |
77 |
Correct |
24 ms |
340 KB |
Output is correct |
78 |
Correct |
3 ms |
344 KB |
Output is correct |
79 |
Correct |
11 ms |
344 KB |
Output is correct |
80 |
Correct |
23 ms |
344 KB |
Output is correct |
81 |
Correct |
24 ms |
344 KB |
Output is correct |
82 |
Correct |
17 ms |
344 KB |
Output is correct |
83 |
Correct |
2 ms |
344 KB |
Output is correct |
84 |
Correct |
21 ms |
340 KB |
Output is correct |
85 |
Correct |
27 ms |
344 KB |
Output is correct |
86 |
Incorrect |
52 ms |
344 KB |
Incorrect |
87 |
Halted |
0 ms |
0 KB |
- |