# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
790641 | 2023-07-23T03:21:14 Z | ttamx | The Big Prize (IOI17_prize) | C++14 | 1 ms | 296 KB |
#include "prize.h" #include<bits/stdc++.h> using namespace std; int find_best(int n) { int l=0,r=n-1; int cntl=0,cntr=0; while(l<r){ int m=(l+r)/2; auto res=ask(m); if(res[0]+res[1]==0)return m; if(res[0]!=m)r=m-1; else l=m+1; } return l; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 208 KB | answer is not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 296 KB | answer is not correct |
2 | Halted | 0 ms | 0 KB | - |