#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5;
int ans[MAX_N][2];
int t;
bool found = false;
int pos;
pair<int, int> askk( int i ) {
if ( ans[i][0] == -1 ) {
auto x = ask( i );
ans[i][0] = x[0];
ans[i][1] = x[1];
}
if ( ans[i][0] + ans[i][1] == 0 ) {
found = true;
pos = i;
}
return { ans[i][0], ans[i][1] };
}
void solve( int l, int r, int tleft, int tright ) {
if ( tleft == tright )
return;
if ( found )
return;
if ( l > r )
return;
//printf( "%d %d\n", l, r );
int mid = l + rand() % (r - l + 1);
while ( mid <= r && askk( mid ).first + askk( mid ).second != t && !found )
mid++;
if ( mid >= r ) {
mid--;
while ( mid >= l && askk( mid ).first + askk( mid ).second != t && !found )
mid--;
if ( mid < l )
return;
}
int tmid = askk( mid ).first;
solve( l, mid, tleft, tmid );
solve( mid + 1, r, tmid, tright );
}
int find_best( int n ) {
for( int i = 0; i < n; i++ )
ans[i][0] = ans[i][1] = -1;
t = 0;
for ( int i = 0; i < 20; i++ ) {
int p = rand() % n;
t = max( t, askk( p ).first + askk( p ).second );
}
solve( 0, n - 1, 0, t );
// for ( int i = 0; i < n; i++ )
// askk( i );
return pos;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1880 KB |
Output is correct |
2 |
Correct |
1 ms |
1880 KB |
Output is correct |
3 |
Correct |
1 ms |
1880 KB |
Output is correct |
4 |
Correct |
2 ms |
1880 KB |
Output is correct |
5 |
Correct |
1 ms |
1880 KB |
Output is correct |
6 |
Correct |
1 ms |
1880 KB |
Output is correct |
7 |
Correct |
1 ms |
1880 KB |
Output is correct |
8 |
Correct |
1 ms |
1880 KB |
Output is correct |
9 |
Correct |
1 ms |
1880 KB |
Output is correct |
10 |
Correct |
1 ms |
1880 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1880 KB |
Output is correct |
2 |
Correct |
1 ms |
1880 KB |
Output is correct |
3 |
Correct |
1 ms |
1880 KB |
Output is correct |
4 |
Correct |
1 ms |
1880 KB |
Output is correct |
5 |
Correct |
1 ms |
1880 KB |
Output is correct |
6 |
Correct |
1 ms |
1880 KB |
Output is correct |
7 |
Correct |
2 ms |
1880 KB |
Output is correct |
8 |
Correct |
1 ms |
1880 KB |
Output is correct |
9 |
Correct |
1 ms |
1880 KB |
Output is correct |
10 |
Correct |
1 ms |
1880 KB |
Output is correct |
11 |
Correct |
2 ms |
1880 KB |
Output is correct |
12 |
Correct |
1 ms |
1880 KB |
Output is correct |
13 |
Correct |
4 ms |
1880 KB |
Output is correct |
14 |
Correct |
1 ms |
600 KB |
Output is correct |
15 |
Correct |
5 ms |
1880 KB |
Output is correct |
16 |
Correct |
22 ms |
1880 KB |
Output is correct |
17 |
Correct |
1 ms |
2132 KB |
Output is correct |
18 |
Partially correct |
32 ms |
1880 KB |
Partially correct - number of queries: 6083 |
19 |
Correct |
2 ms |
1880 KB |
Output is correct |
20 |
Correct |
7 ms |
1112 KB |
Output is correct |
21 |
Correct |
9 ms |
1880 KB |
Output is correct |
22 |
Correct |
2 ms |
1880 KB |
Output is correct |
23 |
Correct |
1 ms |
1880 KB |
Output is correct |
24 |
Correct |
1 ms |
1880 KB |
Output is correct |
25 |
Correct |
19 ms |
1880 KB |
Output is correct |
26 |
Correct |
18 ms |
1880 KB |
Output is correct |
27 |
Correct |
1 ms |
1880 KB |
Output is correct |
28 |
Partially correct |
21 ms |
1880 KB |
Partially correct - number of queries: 5250 |
29 |
Correct |
25 ms |
1880 KB |
Output is correct |
30 |
Partially correct |
26 ms |
1880 KB |
Partially correct - number of queries: 6002 |
31 |
Correct |
2 ms |
1880 KB |
Output is correct |
32 |
Correct |
4 ms |
1880 KB |
Output is correct |
33 |
Correct |
1 ms |
344 KB |
Output is correct |
34 |
Correct |
12 ms |
1880 KB |
Output is correct |
35 |
Correct |
2 ms |
1880 KB |
Output is correct |
36 |
Correct |
7 ms |
2136 KB |
Output is correct |
37 |
Correct |
1 ms |
1880 KB |
Output is correct |
38 |
Correct |
2 ms |
1880 KB |
Output is correct |
39 |
Correct |
11 ms |
1880 KB |
Output is correct |
40 |
Partially correct |
23 ms |
2132 KB |
Partially correct - number of queries: 5366 |
41 |
Correct |
23 ms |
1880 KB |
Output is correct |
42 |
Correct |
15 ms |
1880 KB |
Output is correct |
43 |
Correct |
15 ms |
1972 KB |
Output is correct |
44 |
Correct |
13 ms |
1880 KB |
Output is correct |
45 |
Correct |
8 ms |
1880 KB |
Output is correct |
46 |
Correct |
1 ms |
1972 KB |
Output is correct |
47 |
Correct |
14 ms |
1880 KB |
Output is correct |
48 |
Correct |
20 ms |
1880 KB |
Output is correct |
49 |
Correct |
3 ms |
1880 KB |
Output is correct |
50 |
Partially correct |
30 ms |
2132 KB |
Partially correct - number of queries: 5996 |
51 |
Correct |
11 ms |
1880 KB |
Output is correct |
52 |
Correct |
1 ms |
1880 KB |
Output is correct |
53 |
Correct |
2 ms |
1880 KB |
Output is correct |
54 |
Correct |
11 ms |
1880 KB |
Output is correct |
55 |
Correct |
1 ms |
1880 KB |
Output is correct |
56 |
Partially correct |
27 ms |
1880 KB |
Partially correct - number of queries: 6008 |
57 |
Correct |
19 ms |
1880 KB |
Output is correct |
58 |
Correct |
16 ms |
1880 KB |
Output is correct |
59 |
Correct |
19 ms |
1880 KB |
Output is correct |
60 |
Correct |
21 ms |
1880 KB |
Output is correct |
61 |
Correct |
2 ms |
1880 KB |
Output is correct |
62 |
Correct |
1 ms |
1880 KB |
Output is correct |
63 |
Correct |
2 ms |
1880 KB |
Output is correct |
64 |
Correct |
2 ms |
2136 KB |
Output is correct |
65 |
Correct |
1 ms |
1880 KB |
Output is correct |
66 |
Correct |
2 ms |
1880 KB |
Output is correct |
67 |
Correct |
3 ms |
1880 KB |
Output is correct |
68 |
Correct |
2 ms |
1880 KB |
Output is correct |
69 |
Correct |
3 ms |
2136 KB |
Output is correct |
70 |
Correct |
2 ms |
1880 KB |
Output is correct |
71 |
Partially correct |
44 ms |
1880 KB |
Partially correct - number of queries: 8786 |
72 |
Correct |
7 ms |
1880 KB |
Output is correct |
73 |
Partially correct |
49 ms |
1880 KB |
Partially correct - number of queries: 8737 |
74 |
Partially correct |
40 ms |
1880 KB |
Partially correct - number of queries: 8754 |
75 |
Correct |
3 ms |
1880 KB |
Output is correct |
76 |
Partially correct |
48 ms |
1880 KB |
Partially correct - number of queries: 7769 |
77 |
Partially correct |
37 ms |
1880 KB |
Partially correct - number of queries: 8017 |
78 |
Correct |
4 ms |
1880 KB |
Output is correct |
79 |
Correct |
24 ms |
1880 KB |
Output is correct |
80 |
Partially correct |
36 ms |
1880 KB |
Partially correct - number of queries: 8077 |
81 |
Partially correct |
47 ms |
1880 KB |
Partially correct - number of queries: 7847 |
82 |
Partially correct |
45 ms |
1880 KB |
Partially correct - number of queries: 7930 |
83 |
Correct |
2 ms |
1880 KB |
Output is correct |
84 |
Partially correct |
34 ms |
1880 KB |
Partially correct - number of queries: 6772 |
85 |
Partially correct |
43 ms |
1880 KB |
Partially correct - number of queries: 7915 |
86 |
Incorrect |
53 ms |
1880 KB |
Incorrect |
87 |
Halted |
0 ms |
0 KB |
- |