oj.uz

답안 #423705

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
423705 2021-06-11T11:37:18 Z AugustinasJucas 커다란 상품 (IOI17_prize) C++14
20 / 100
 1 ms 320 KB 





#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
int find_best(int n) {
	int l = 0; int r = n-1;
	
	while(l <= r){
		int mid = (l + r) / 2;
		auto f = ask(mid);
		if(f[0] == 0 && f[1] == 0) return mid;
		if(f[0] == 1){
			r = mid-1;
		}else{
			l = mid+1;
		}
	}
	return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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