#include "prize.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
vector<int> asked[200000];
vector<int> Ask(int i){
if(asked[i].empty()) asked[i] = ask(i);
return asked[i];
}
int find_best(int n){
int p = 0;
while(1){
auto cur = Ask(p);
if(cur[0]+cur[1] == 0) return p;
int a = p+1, b = n-1;
while(a < b){
int md = (a+b)/2;
auto v = Ask(md);
if(v[0]+v[1] < cur[0]+cur[1]) b = md;
else if(v[0]+v[1] > cur[0]+cur[1]) a = md+1;
else if(v[0] != cur[0]) b = md-1;
else a = md+1;
}
p = a;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4944 KB |
Output is correct |
2 |
Correct |
3 ms |
4944 KB |
Output is correct |
3 |
Correct |
3 ms |
4988 KB |
Output is correct |
4 |
Correct |
3 ms |
4992 KB |
Output is correct |
5 |
Correct |
4 ms |
4944 KB |
Output is correct |
6 |
Correct |
3 ms |
4992 KB |
Output is correct |
7 |
Correct |
3 ms |
4944 KB |
Output is correct |
8 |
Correct |
3 ms |
4988 KB |
Output is correct |
9 |
Correct |
3 ms |
4944 KB |
Output is correct |
10 |
Correct |
3 ms |
4944 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4944 KB |
Output is correct |
2 |
Correct |
3 ms |
4992 KB |
Output is correct |
3 |
Correct |
3 ms |
4992 KB |
Output is correct |
4 |
Correct |
3 ms |
4944 KB |
Output is correct |
5 |
Correct |
3 ms |
4992 KB |
Output is correct |
6 |
Correct |
3 ms |
4944 KB |
Output is correct |
7 |
Correct |
3 ms |
4988 KB |
Output is correct |
8 |
Correct |
3 ms |
4988 KB |
Output is correct |
9 |
Correct |
3 ms |
4900 KB |
Output is correct |
10 |
Correct |
3 ms |
4984 KB |
Output is correct |
11 |
Runtime error |
7 ms |
9848 KB |
Execution killed with signal 11 |
12 |
Halted |
0 ms |
0 KB |
- |