Submission #139441

#TimeUsernameProblemLanguageResultExecution timeMemory
139441HassoonyThe Big Prize (IOI17_prize)C++17
0 / 100
81 ms692 KiB
#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){ while(1){ int x=rand()%n; if(vis[x])continue; vis[x]=1; vector<int>ans = ask(x); if(ans[0] + ans[1] == 0){ return x; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...