oj.uz

답안 #559773

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
559773 2022-05-10T14:43:48 Z Mahmudul_Kabir 커다란 상품 (IOI17_prize) C++14
20 / 100
 67 ms 336 KB 
#include "prize.h"
#include "bits/stdc++.h"

#define sp <<" "
#define el <<"\n"
#define S second
#define F first
#define pb push_back
#define all(ar) ar.begin(),ar.end() 
#define pii pair<ll,ll> 
 
 
using namespace std;
using ll = long long;

int find_best(int n) {
	int l = 0, r = n - 1; 
	int mid; 
	for(int i = 0; i < n; i++) {
		mid = l + (r - l)/2; 
		std::vector<int> res = ask(mid);
		if(res[0] + res[1] == 0) return mid;
		if(res[0] > res[1]) r = mid - 1; 
		else l = mid + 1; 
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 0 ms 292 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 288 KB Output is correct
10 Correct 1 ms 208 KB Output is correct

Subtask #2
0 / 80.0

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