Submission #1164527

#TimeUsernameProblemLanguageResultExecution timeMemory
1164527irmuunThe Big Prize (IOI17_prize)C++20
20 / 100
0 ms408 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() int find_best(int n){ int l=0,r=n-1; while(l<r){ int mid=(l+r)/2; vector<int>res=ask(mid); if(res[0]+res[1]==0){ return mid; } if(res[0]>0){ r=mid-1; } else{ l=mid+1; } } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...