Submission #627776

#TimeUsernameProblemLanguageResultExecution timeMemory
627776hy_1The Big Prize (IOI17_prize)C++14
20 / 100
57 ms348 KiB
#include "prize.h" #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <exception> #include <fstream> #include <functional> #include <iomanip> #include <ios> #include <iosfwd> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <cmath> #include <locale> #include <map> #include <memory> #include <new> #include <numeric> #include <ostream> #include <queue> #include <set> #include <sstream> #include <stack> #include <stdio.h> #include <stdexcept> #include <streambuf> #include <string> #include <typeinfo> #include <utility> #include <valarray> #include <vector> #include <unordered_map> using namespace std; int find_best(int n) { int l = 0; int r = n-1; while(l <= r){ int mid = (l+r)/2; vector<int> res = ask(mid); if(res[0] + res[1] == 0){ return mid; }else if(res[0] != 0) r = mid - 1; else l = mid + 1; } }

Compilation message (stderr)

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