제출 #1195858

#제출 시각아이디문제언어결과실행 시간메모리
1195858DeathIsAweThe Big Prize (IOI17_prize)C++20
20 / 100
0 ms412 KiB
#include "prize.h" #include <bits/stdc++.h> #define pb push_back #define mp make_pair #define ff first #define ss second #define ll long long using namespace std; int find_best(int n) { vector<int> result; int left = 0, right = n - 1, middle; result = ask(0); if (result[0] + result[1] == 0) return 0; result = ask(n - 1); if (result[0] + result[1] == 0) return n - 1; while (left + 1 < right) { middle = (left + right) / 2; result = ask(middle); if (result[0] + result[1] == 0) return middle; if (result[0] == 1) right = middle; else left = middle; } }

컴파일 시 표준 에러 (stderr) 메시지

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