Submission #469014

#TimeUsernameProblemLanguageResultExecution timeMemory
469014Cross_Ratio커다란 상품 (IOI17_prize)C++14
0 / 100
2 ms392 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int N) { int s = 0; int e = N; srand(0); int cnt = 0; random_device rd; mt19937 random(rd()); uniform_int_distribution<> dice(0, 200005); while(s + 1 != e) { int mid = dice(random) % (e - s) + s; vector<int> V = ask(mid); if(V[0] == 0 && V[1] == 0) return mid; else if(V[0] == 0) s = mid; else if(V[1] == 0) e = mid; cnt++; assert(cnt < 10000); } }

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:13:19: warning: control reaches end of non-void function [-Wreturn-type]
   13 |     random_device rd;
      |                   ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...