oj.uz

답안 #125916

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
125916 2019-07-06T14:12:43 Z chubyxdxd 커다란 상품 (IOI17_prize) C++11
20 / 100
 2 ms 508 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;
int find_best(int n) {
	vector<int> v;
	int low=0;int hi=n,mid;
	while(hi-low>1){
		v.clear();
		mid=(low+hi)/2;
		v=ask(mid);
		if(v[0]==0 and v[1]==0){
			return mid;
			break;
		}
		if(v[0]<v[1]){
			low=mid;
		}
		else{
			hi=mid;
		}
	}
	return ((low+hi)/2);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 308 KB Output is correct
4 Correct 2 ms 424 KB Output is correct
5 Correct 2 ms 304 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 ms 404 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 388 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 388 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 308 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 252 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Incorrect 2 ms 304 KB answer is not correct
12 Halted 0 ms 0 KB -