제출 #139442

#제출 시각아이디문제언어결과실행 시간메모리
139442Hassoony커다란 상품 (IOI17_prize)C++17
0 / 100
98 ms504 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){ int q=10000; while(q--){ int x=rand()%n; if(vis[x])continue; vis[x]=1; vector<int>ans = ask(x); if(ans[0] + ans[1] == 0){ return x; } } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...