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 <iostream>
#include <vector>
#include <random>
#include <ctime>
using namespace std;
const int maxn = 200005;
bool is_asked[maxn];
int find_best(int n)
{
srand(time(NULL));
for (int i = 1; i <= 5000; )
{
int idx = rand() % n;
if (is_asked[idx] == false)
{
is_asked[idx] = true;
++i;
vector<int> result = ask(idx);
if (result[0] + result[1] == 0)
{
return idx;
}
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |