oj.uz

답안 #296928

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
296928 2020-09-11T05:09:38 Z Gurban 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 288 KB 
#include <bits/stdc++.h>
#include "prize.h"
#define ff first
#define ss second
using namespace std;

int l,r,md,ans;

int find_best(int n) {
	l = 0,r = n-1;
	while(l <= r){
		md=(l+r)/2;
		vector<int> jog = ask(md);
		if(jog[0] == 0 and jog[1] == 0) return md;
		if(jog[0] < jog[1]) l = md+1;
		else r = md-1;
	}
	return rand()%n;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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