oj.uz

답안 #131456

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131456 2019-07-17T07:25:45 Z 20160161simone 커다란 상품 (IOI17_prize) C++14
20 / 100
 93 ms 376 KB 
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
int find_best(int n) 
{
	int l=0,r=n-1;
	while(0==0)
	{
		int mid=(l+r)/2;
		vector<int> q=ask(mid);
		if(q[0]==0&&q[1]==0)
		{
			return mid;
		}
		else
		{
			if(q[0]==1)
			{
				r=mid-1;
			}
			else l=mid+1;
		}
	} 
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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