#include "prize.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int sumMax = 0, start = 450;
struct range{
int ff, ss, izq, der;
};
bool confirm(vector<int>&t){
return t[0] + t[1] == 0;
}
int suma(vector<int>&t){return t[0] + t[1];}
int find_best(int n) {
vector<int>t;
vector<int>answers;
for(int i = 0 ; i < start ; i ++){
t = ask(i);
answers.pb(suma(t));
sumMax = max(sumMax, suma(t));
if(confirm(t))return i;
}
int tempp = 0;
for(auto i : answers){
if(i < sumMax){
tempp++;
}
}
queue<range>cola;
cola.push({0, n-1, 0, 0});
while(!cola.empty()){
range cur = cola.front();
cola.pop();
if(cur.ff > cur.ss)continue;
if(cur.ff == cur.ss){
t = ask(cur.ff);
if(confirm(t))return cur.ff;
}
int midd = (cur.ff + cur.ss)/2, toL, k, cuenta = 0;
t = ask(midd);
k = midd;
toL = midd-1;
bool thereIsR = true;
while(suma(t) != sumMax){
if(confirm(t))return k;
k++;
cuenta ++ ;
if(k > cur.ss){
thereIsR = false;
break;
}
t = ask(k);
}
if(confirm(t))return k;
if(t[1] - cur.der > 0 and thereIsR and k+1 <= cur.ss){
cola.push({k+1, cur.ss, t[0], cur.der});
}
if(thereIsR and t[0]-cuenta- cur.izq > 0 and toL >= cur.ff)cola.push({cur.ff, toL, cur.izq, t[1] + cuenta});
else if(t[0]-cuenta- cur.izq > 0 and toL >= cur.ff){
cola.push({cur.ff, toL, cur.izq, cur.der + cuenta});
}
//if(t[0] > 0 and toL >= cur.ff)cola.push({cur.ff, toL});
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
284 KB |
Output is correct |
2 |
Correct |
2 ms |
296 KB |
Output is correct |
3 |
Correct |
3 ms |
296 KB |
Output is correct |
4 |
Correct |
4 ms |
208 KB |
Output is correct |
5 |
Correct |
2 ms |
308 KB |
Output is correct |
6 |
Correct |
1 ms |
296 KB |
Output is correct |
7 |
Correct |
2 ms |
296 KB |
Output is correct |
8 |
Correct |
4 ms |
296 KB |
Output is correct |
9 |
Correct |
2 ms |
296 KB |
Output is correct |
10 |
Correct |
5 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
208 KB |
Output is correct |
2 |
Correct |
2 ms |
300 KB |
Output is correct |
3 |
Correct |
3 ms |
208 KB |
Output is correct |
4 |
Correct |
4 ms |
208 KB |
Output is correct |
5 |
Correct |
2 ms |
304 KB |
Output is correct |
6 |
Correct |
1 ms |
208 KB |
Output is correct |
7 |
Correct |
5 ms |
300 KB |
Output is correct |
8 |
Correct |
5 ms |
228 KB |
Output is correct |
9 |
Correct |
3 ms |
292 KB |
Output is correct |
10 |
Correct |
4 ms |
208 KB |
Output is correct |
11 |
Correct |
6 ms |
296 KB |
Output is correct |
12 |
Correct |
8 ms |
208 KB |
Output is correct |
13 |
Correct |
5 ms |
296 KB |
Output is correct |
14 |
Correct |
10 ms |
208 KB |
Output is correct |
15 |
Correct |
40 ms |
296 KB |
Output is correct |
16 |
Correct |
35 ms |
304 KB |
Output is correct |
17 |
Correct |
2 ms |
292 KB |
Output is correct |
18 |
Correct |
28 ms |
208 KB |
Output is correct |
19 |
Correct |
21 ms |
288 KB |
Output is correct |
20 |
Correct |
15 ms |
308 KB |
Output is correct |
21 |
Correct |
28 ms |
288 KB |
Output is correct |
22 |
Correct |
34 ms |
208 KB |
Output is correct |
23 |
Correct |
4 ms |
288 KB |
Output is correct |
24 |
Correct |
7 ms |
208 KB |
Output is correct |
25 |
Correct |
34 ms |
208 KB |
Output is correct |
26 |
Correct |
23 ms |
208 KB |
Output is correct |
27 |
Correct |
4 ms |
208 KB |
Output is correct |
28 |
Correct |
9 ms |
304 KB |
Output is correct |
29 |
Correct |
33 ms |
284 KB |
Output is correct |
30 |
Correct |
28 ms |
208 KB |
Output is correct |
31 |
Correct |
2 ms |
300 KB |
Output is correct |
32 |
Correct |
8 ms |
208 KB |
Output is correct |
33 |
Correct |
1 ms |
208 KB |
Output is correct |
34 |
Correct |
23 ms |
292 KB |
Output is correct |
35 |
Correct |
5 ms |
284 KB |
Output is correct |
36 |
Correct |
17 ms |
304 KB |
Output is correct |
37 |
Correct |
4 ms |
344 KB |
Output is correct |
38 |
Correct |
4 ms |
208 KB |
Output is correct |
39 |
Correct |
16 ms |
304 KB |
Output is correct |
40 |
Correct |
35 ms |
208 KB |
Output is correct |
41 |
Correct |
41 ms |
208 KB |
Output is correct |
42 |
Correct |
37 ms |
292 KB |
Output is correct |
43 |
Correct |
28 ms |
312 KB |
Output is correct |
44 |
Correct |
15 ms |
348 KB |
Output is correct |
45 |
Correct |
15 ms |
300 KB |
Output is correct |
46 |
Correct |
3 ms |
208 KB |
Output is correct |
47 |
Correct |
28 ms |
292 KB |
Output is correct |
48 |
Correct |
15 ms |
336 KB |
Output is correct |
49 |
Correct |
11 ms |
304 KB |
Output is correct |
50 |
Correct |
15 ms |
304 KB |
Output is correct |
51 |
Correct |
17 ms |
304 KB |
Output is correct |
52 |
Partially correct |
41 ms |
288 KB |
Partially correct - number of queries: 5082 |
53 |
Correct |
3 ms |
292 KB |
Output is correct |
54 |
Correct |
42 ms |
288 KB |
Output is correct |
55 |
Correct |
4 ms |
292 KB |
Output is correct |
56 |
Correct |
17 ms |
292 KB |
Output is correct |
57 |
Correct |
13 ms |
300 KB |
Output is correct |
58 |
Correct |
16 ms |
348 KB |
Output is correct |
59 |
Correct |
15 ms |
296 KB |
Output is correct |
60 |
Correct |
12 ms |
296 KB |
Output is correct |
61 |
Correct |
3 ms |
208 KB |
Output is correct |
62 |
Correct |
3 ms |
208 KB |
Output is correct |
63 |
Correct |
5 ms |
292 KB |
Output is correct |
64 |
Correct |
2 ms |
300 KB |
Output is correct |
65 |
Correct |
4 ms |
288 KB |
Output is correct |
66 |
Correct |
6 ms |
208 KB |
Output is correct |
67 |
Incorrect |
3 ms |
344 KB |
answer is not correct |
68 |
Halted |
0 ms |
0 KB |
- |