#include <bits/stdc++.h>
#include "prize.h"
//#include "grader.cpp"
using namespace std;
const int MX=2e5+9;
bool vis[MX];
int find_best(int n){
int q=10000;
while(q--){
int x=rand()%n;
if(vis[x])continue;
vis[x]=1;
vector<int>ans = ask(x);
if(ans[0] + ans[1] == 0){
return x;
}
}
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
97 ms |
504 KB |
answer is not correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
98 ms |
504 KB |
answer is not correct |
2 |
Halted |
0 ms |
0 KB |
- |