| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1164527 | irmuun | The Big Prize (IOI17_prize) | C++20 | 0 ms | 408 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
