# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
738473 | 2023-05-08T20:08:12 Z | Elvin_Fritl | The Big Prize (IOI17_prize) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #include "prize.h" int find_best(int n) { int l=0,r=n-1; while(l<=r){ int mid=(l+r)>>1; vector<int> a = ask(i); if(a[0] == a[1] && a[0] == 0){ return mid; } if(a[0]==0){ l=mid+1; } else{ r=mid-1; } } return 0; }