#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int unloli,ans=-1;
void calc(int l,int r,int tol,int tor){
if(ans>=0)
return;
if(l>r)
return;
if(tol+tor==unloli)
return;
int mid=l+r>>1,pt=mid;
vector<int>stuff=ask(mid);
if(stuff[0]+stuff[1]==0){
ans=mid;
return;
}
while(stuff[0]+stuff[1]-unloli&&pt>=l)
if(stuff[0]+stuff[1]==0){
ans=pt;
return;
} else
stuff=ask(--pt);
calc(l,pt-1,tol,stuff[1]);
calc(mid+1,r,stuff[0],tor);
}
int find_best(int n) {
if(n<5002) {
for(int i = 1; i < n; i++) {
std::vector<int> res = ask(i);
if(res[0] + res[1] == 0)
return i;
}
return 0;
}
for(int i=0;i<min(455,n);i++){
vector<int>x=ask(i);
if(x[0]+x[1]==0)
return i;
unloli=max(unloli,x[0]+x[1]);
}
calc(0,n-1,0,0);
return ans;
}
Compilation message
prize.cpp: In function 'void calc(int, int, int, int)':
prize.cpp:12:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
12 | int mid=l+r>>1,pt=mid;
| ~^~
# |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
596 KB |
Output is correct |
7 |
Correct |
4 ms |
596 KB |
Output is correct |
8 |
Correct |
2 ms |
420 KB |
Output is correct |
9 |
Correct |
2 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
340 KB |
Output is correct |
2 |
Correct |
3 ms |
504 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 |
2 ms |
344 KB |
Output is correct |
11 |
Correct |
3 ms |
344 KB |
Output is correct |
12 |
Correct |
2 ms |
600 KB |
Output is correct |
13 |
Correct |
4 ms |
344 KB |
Output is correct |
14 |
Correct |
3 ms |
344 KB |
Output is correct |
15 |
Correct |
4 ms |
432 KB |
Output is correct |
16 |
Correct |
25 ms |
344 KB |
Output is correct |
17 |
Correct |
2 ms |
344 KB |
Output is correct |
18 |
Partially correct |
26 ms |
344 KB |
Partially correct - number of queries: 5547 |
19 |
Correct |
3 ms |
344 KB |
Output is correct |
20 |
Correct |
10 ms |
344 KB |
Output is correct |
21 |
Correct |
11 ms |
420 KB |
Output is correct |
22 |
Correct |
5 ms |
344 KB |
Output is correct |
23 |
Correct |
2 ms |
344 KB |
Output is correct |
24 |
Correct |
2 ms |
344 KB |
Output is correct |
25 |
Correct |
14 ms |
436 KB |
Output is correct |
26 |
Correct |
11 ms |
344 KB |
Output is correct |
27 |
Correct |
2 ms |
344 KB |
Output is correct |
28 |
Correct |
25 ms |
344 KB |
Output is correct |
29 |
Correct |
19 ms |
344 KB |
Output is correct |
30 |
Partially correct |
27 ms |
344 KB |
Partially correct - number of queries: 5501 |
31 |
Correct |
2 ms |
344 KB |
Output is correct |
32 |
Correct |
3 ms |
600 KB |
Output is correct |
33 |
Correct |
0 ms |
344 KB |
Output is correct |
34 |
Correct |
12 ms |
344 KB |
Output is correct |
35 |
Correct |
3 ms |
344 KB |
Output is correct |
36 |
Correct |
6 ms |
344 KB |
Output is correct |
37 |
Correct |
2 ms |
344 KB |
Output is correct |
38 |
Correct |
2 ms |
600 KB |
Output is correct |
39 |
Correct |
11 ms |
344 KB |
Output is correct |
40 |
Correct |
35 ms |
344 KB |
Output is correct |
41 |
Correct |
17 ms |
344 KB |
Output is correct |
42 |
Correct |
18 ms |
344 KB |
Output is correct |
43 |
Correct |
14 ms |
344 KB |
Output is correct |
44 |
Correct |
12 ms |
344 KB |
Output is correct |
45 |
Correct |
9 ms |
344 KB |
Output is correct |
46 |
Correct |
2 ms |
596 KB |
Output is correct |
47 |
Correct |
10 ms |
600 KB |
Output is correct |
48 |
Correct |
18 ms |
344 KB |
Output is correct |
49 |
Correct |
4 ms |
344 KB |
Output is correct |
50 |
Partially correct |
28 ms |
344 KB |
Partially correct - number of queries: 5538 |
51 |
Correct |
17 ms |
344 KB |
Output is correct |
52 |
Correct |
2 ms |
344 KB |
Output is correct |
53 |
Correct |
3 ms |
344 KB |
Output is correct |
54 |
Correct |
19 ms |
344 KB |
Output is correct |
55 |
Correct |
2 ms |
344 KB |
Output is correct |
56 |
Partially correct |
25 ms |
344 KB |
Partially correct - number of queries: 5541 |
57 |
Correct |
18 ms |
344 KB |
Output is correct |
58 |
Correct |
18 ms |
344 KB |
Output is correct |
59 |
Correct |
14 ms |
344 KB |
Output is correct |
60 |
Correct |
19 ms |
436 KB |
Output is correct |
61 |
Correct |
2 ms |
344 KB |
Output is correct |
62 |
Correct |
2 ms |
340 KB |
Output is correct |
63 |
Correct |
3 ms |
344 KB |
Output is correct |
64 |
Correct |
3 ms |
436 KB |
Output is correct |
65 |
Incorrect |
3 ms |
432 KB |
Integer -1 violates the range [0, 199999] |
66 |
Halted |
0 ms |
0 KB |
- |