This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define ff first
#define ss second
int find_best(int n) {
set<int> used;
int k = rand() % n;
vi res = ask(k);
used.insert(k);
while(res != vi{0,0}){
while(used.count(k)) k = rand()%n;
used.insert(k);
res = ask(k);
}
return k;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |