#include <bits/stdc++.h>
#include "prize.h"
#define N 100005
#define ll long long int
#define fo(i,x,y) for(int i=x;i<=y;i++)
#define fs(ar,n) fo(i,1,n) cin>>ar[i]
#define sp " "
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast2 freopen ("in.txt","r",stdin);freopen ("out.txt","w",stdout);
#define mod 1000000007
using namespace std;
ll nn,m,ar[N],sum,t,a,b,ans;
vector<int> myask(int ind)
{
vector<int> a=ask(ind);
if(a[0]==0 && a[1]==0)
ans=ind;
return a;
}
void bs(ll l,ll r,vector<int> v1,vector<int> v2)
{
if(ans!=-1)
return;
if(v1[0]==v2[0] && v1[1]==v2[1])
return;
if(r-l<=1)
return;
int mid=(l+r)/2;
vector<int> v3;
v3=myask(mid);
bs(l,mid,v1,v3);
bs(mid,r,v3,v2);
}
int find_best(int n)
{
a=0;
b=n-1;
ans=-1;
bs(0,n-1,myask(0),myask(n-1));
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
288 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
1 ms |
256 KB |
Output is correct |
5 |
Correct |
1 ms |
256 KB |
Output is correct |
6 |
Correct |
0 ms |
256 KB |
Output is correct |
7 |
Correct |
1 ms |
256 KB |
Output is correct |
8 |
Correct |
1 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
1 ms |
256 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
1 ms |
256 KB |
Output is correct |
6 |
Correct |
0 ms |
256 KB |
Output is correct |
7 |
Correct |
1 ms |
256 KB |
Output is correct |
8 |
Correct |
1 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
1 ms |
256 KB |
Output is correct |
11 |
Correct |
3 ms |
256 KB |
Output is correct |
12 |
Correct |
1 ms |
256 KB |
Output is correct |
13 |
Correct |
5 ms |
256 KB |
Output is correct |
14 |
Correct |
2 ms |
256 KB |
Output is correct |
15 |
Correct |
6 ms |
256 KB |
Output is correct |
16 |
Correct |
24 ms |
364 KB |
Output is correct |
17 |
Correct |
1 ms |
256 KB |
Output is correct |
18 |
Partially correct |
40 ms |
256 KB |
Partially correct - number of queries: 5068 |
19 |
Correct |
1 ms |
384 KB |
Output is correct |
20 |
Correct |
11 ms |
256 KB |
Output is correct |
21 |
Correct |
15 ms |
256 KB |
Output is correct |
22 |
Correct |
3 ms |
256 KB |
Output is correct |
23 |
Correct |
1 ms |
256 KB |
Output is correct |
24 |
Correct |
1 ms |
256 KB |
Output is correct |
25 |
Correct |
21 ms |
256 KB |
Output is correct |
26 |
Correct |
26 ms |
256 KB |
Output is correct |
27 |
Correct |
1 ms |
256 KB |
Output is correct |
28 |
Correct |
36 ms |
256 KB |
Output is correct |
29 |
Correct |
18 ms |
372 KB |
Output is correct |
30 |
Partially correct |
43 ms |
256 KB |
Partially correct - number of queries: 5022 |
31 |
Correct |
1 ms |
256 KB |
Output is correct |
32 |
Correct |
4 ms |
256 KB |
Output is correct |
33 |
Correct |
0 ms |
256 KB |
Output is correct |
34 |
Correct |
15 ms |
256 KB |
Output is correct |
35 |
Correct |
2 ms |
256 KB |
Output is correct |
36 |
Correct |
11 ms |
256 KB |
Output is correct |
37 |
Correct |
2 ms |
256 KB |
Output is correct |
38 |
Correct |
1 ms |
256 KB |
Output is correct |
39 |
Correct |
24 ms |
256 KB |
Output is correct |
40 |
Correct |
40 ms |
256 KB |
Output is correct |
41 |
Correct |
16 ms |
376 KB |
Output is correct |
42 |
Correct |
27 ms |
256 KB |
Output is correct |
43 |
Correct |
25 ms |
256 KB |
Output is correct |
44 |
Correct |
20 ms |
256 KB |
Output is correct |
45 |
Correct |
8 ms |
384 KB |
Output is correct |
46 |
Correct |
1 ms |
256 KB |
Output is correct |
47 |
Correct |
19 ms |
256 KB |
Output is correct |
48 |
Correct |
20 ms |
376 KB |
Output is correct |
49 |
Correct |
4 ms |
256 KB |
Output is correct |
50 |
Partially correct |
27 ms |
376 KB |
Partially correct - number of queries: 5070 |
51 |
Correct |
19 ms |
256 KB |
Output is correct |
52 |
Correct |
1 ms |
256 KB |
Output is correct |
53 |
Correct |
2 ms |
256 KB |
Output is correct |
54 |
Correct |
25 ms |
256 KB |
Output is correct |
55 |
Correct |
1 ms |
256 KB |
Output is correct |
56 |
Partially correct |
52 ms |
256 KB |
Partially correct - number of queries: 5069 |
57 |
Correct |
33 ms |
256 KB |
Output is correct |
58 |
Correct |
35 ms |
256 KB |
Output is correct |
59 |
Correct |
35 ms |
256 KB |
Output is correct |
60 |
Correct |
27 ms |
256 KB |
Output is correct |
61 |
Correct |
2 ms |
256 KB |
Output is correct |
62 |
Correct |
1 ms |
256 KB |
Output is correct |
63 |
Correct |
2 ms |
256 KB |
Output is correct |
64 |
Correct |
1 ms |
256 KB |
Output is correct |
65 |
Correct |
1 ms |
256 KB |
Output is correct |
66 |
Correct |
1 ms |
256 KB |
Output is correct |
67 |
Correct |
0 ms |
256 KB |
Output is correct |
68 |
Correct |
1 ms |
384 KB |
Output is correct |
69 |
Correct |
1 ms |
256 KB |
Output is correct |
70 |
Correct |
1 ms |
256 KB |
Output is correct |
71 |
Correct |
45 ms |
256 KB |
Output is correct |
72 |
Correct |
7 ms |
256 KB |
Output is correct |
73 |
Correct |
42 ms |
256 KB |
Output is correct |
74 |
Correct |
44 ms |
256 KB |
Output is correct |
75 |
Correct |
2 ms |
256 KB |
Output is correct |
76 |
Correct |
46 ms |
256 KB |
Output is correct |
77 |
Partially correct |
51 ms |
256 KB |
Partially correct - number of queries: 5216 |
78 |
Correct |
6 ms |
256 KB |
Output is correct |
79 |
Correct |
32 ms |
256 KB |
Output is correct |
80 |
Partially correct |
49 ms |
256 KB |
Partially correct - number of queries: 5237 |
81 |
Partially correct |
52 ms |
256 KB |
Partially correct - number of queries: 5218 |
82 |
Partially correct |
52 ms |
256 KB |
Partially correct - number of queries: 5216 |
83 |
Correct |
2 ms |
256 KB |
Output is correct |
84 |
Correct |
41 ms |
384 KB |
Output is correct |
85 |
Partially correct |
33 ms |
256 KB |
Partially correct - number of queries: 5233 |
86 |
Correct |
9 ms |
256 KB |
Output is correct |
87 |
Correct |
5 ms |
256 KB |
Output is correct |
88 |
Correct |
6 ms |
256 KB |
Output is correct |
89 |
Correct |
9 ms |
256 KB |
Output is correct |
90 |
Correct |
3 ms |
256 KB |
Output is correct |
91 |
Correct |
5 ms |
256 KB |
Output is correct |
92 |
Correct |
1 ms |
256 KB |
Output is correct |
93 |
Correct |
4 ms |
256 KB |
Output is correct |
94 |
Correct |
3 ms |
256 KB |
Output is correct |
95 |
Correct |
6 ms |
256 KB |
Output is correct |
96 |
Correct |
5 ms |
256 KB |
Output is correct |
97 |
Correct |
1 ms |
256 KB |
Output is correct |