# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108009 | 2019-04-26T18:44:40 Z | reda | The Big Prize (IOI17_prize) | C++14 | 75 ms | 1192 KB |
#include<bits/stdc++.h> #include "prize.h" using namespace std; int find_best(int n) { int mid = n/2; vector<int> arr=ask(mid); if(arr[0]==0 && arr[1]==0)return mid+1; else{ if(arr[0]>arr[1]) { return find_best(mid); } else return find_best(mid+n/2); } }
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 75 ms | 1144 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 45 ms | 1192 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |