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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int id[200005];
int find_best(int n){
for(int i=0;i<n;i++){
id[i]=i;
}
shuffle(id,id+n,rng);
for(int i = 0; i < n; i++){
std::vector<int> res = ask(id[i]);
if(res[0] + res[1] == 0)
return id[i];
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |