제출 #80289

#제출 시각아이디문제언어결과실행 시간메모리
80289MoNsTeR_CuBe커다란 상품 (IOI17_prize)C++17
20 / 100
2 ms580 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int n) { int left = 0; int right = n-1; while(left < right){ int mid = (left+right)/2; vector<int> tab = ask(mid); if(tab[0]==1){ right = mid-1; }else if(tab[1] == 1){ left = mid+1; }else{ right = mid; break; } } return right; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...