oj.uz

답안 #1028701

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028701 2024-07-20T07:17:08 Z parsadox2 커다란 상품 (IOI17_prize) C++17
20 / 100
 51 ms 344 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

int find_best(int n) {
	int low = -1 , high = n;
	int ans = -1;
	while(high - low > 0)
	{
		int mid = (low + high) >> 1;
		auto res = ask(mid);
		if(res[0] + res[1] == 0)
		{
			ans = mid;
			break;
		}
		if(res[0] == 0)
			low = mid;
		else
			high = mid;
	}
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 80.0

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