oj.uz

답안 #769949

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
769949 2023-06-30T14:35:02 Z APROHACK 커다란 상품 (IOI17_prize) C++14
20 / 100
 1 ms 336 KB 
#include "prize.h"

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second

using namespace std;

int find_best(int n) {
	int li = 0, ls = n-1, pos;
	pos = (li + ls)/2;
	while(li + 1 < ls){
		vector<int>ans = ask(pos);
		if(ans[0] > ans[1]){
			ls = pos-1;
		}else if(ans[1] > ans[0]){
			li = pos+1;
		}else{
			return pos;
		}
		pos = (li + ls)/2;
	}
	vector<int>ans = ask(pos);
	if(ans[0] + ans[1] == 0)return pos;
	else return pos + 1;
	return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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