oj.uz

답안 #825679

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
825679 2023-08-15T07:02:55 Z Minindu206 커다란 상품 (IOI17_prize) C++14
20 / 100
 1 ms 296 KB 
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;
int find_best(int n) {
	int st = 0, en = n - 1;
	// cout << st << " " << en << '\n';
	while(en - st > 1)
	{
		int mid = (st + en) / 2;
		auto a = ask(mid);
		if(a[0] >= a[1])
			en = mid;
		else
			st = mid + 1;
		// cout << a[0] << " " << a[1] << " " << st << " " << en << '\n';	
	}
	auto a = ask(st);
	if(a[0] + a[1] == 0)
		return st;
	return en;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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