Submission #1053938

#TimeUsernameProblemLanguageResultExecution timeMemory
1053938aaaaaarrozThe Big Prize (IOI17_prize)C++17
0 / 100
53 ms344 KiB
#include "prize.h" #include<bits/stdc++.h> using namespace std; int nn; vector<int>ask(int i); int worse=INT_MAX; int lupdate=0; int subir(){ int l=lupdate,r=nn-1; while(l<r){ int mid=(l+r+1)/2; vector<int>res=ask(mid); if((res[0]+res[1])<worse){ lupdate=mid; worse=(res[0]+res[1]); return mid; } if(res[0]==0){ l=mid; } else{ r=mid-1; } } } int find_best(int n) { nn=n; int retorno=INT_MAX; while(worse!=0){ retorno=subir(); } return retorno; }

Compilation message (stderr)

prize.cpp: In function 'int subir()':
prize.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
   25 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...