Submission #757742

#TimeUsernameProblemLanguageResultExecution timeMemory
757742borisAngelovThe Big Prize (IOI17_prize)C++17
0 / 100
88 ms464 KiB
#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 <= 100000; ) { 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...