oj.uz

답안 #1012225

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1012225 2024-07-01T20:28:50 Z hyakup 커다란 상품 (IOI17_prize) C++17
20 / 100
 1 ms 504 KB 
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
#define bug(x) cout << #x << " " << x << endl;

int bs( int n ){
	int l = 0, r = n - 1;
	while( l < r ){
		int mid = ( l + r )/2;
		vector<int> a = ask(mid);
		if( a[0] == a[1] && a[0] == 0 ) return mid;
		if( a[0] == 1 ) r = mid - 1;
		else l = mid + 1;
	}
	return r;
}

int find_best(int n) {
	return bs(n);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 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 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 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 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 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 0 ms 344 KB Output is correct
7 Correct 0 ms 504 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 0 ms 344 KB answer is not correct
12 Halted 0 ms 0 KB -