제출 #706277

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
706277		SamNguyen	Hotter Colder (IOI10_hottercolder)	C++14	0 / 100	543 ms	8108 KiB

hottercolder

#include "grader.h"
#include <bits/stdc++.h>
using namespace std;

const int HOTTER = 1, COLDER = -1, SAME = 0;

template <class Func>
int FIND_SMALLEST(int l, int r, Func f) {
	int res = r + 1;
	while (l <= r) {
		int m = (l + r) >> 1;
		if (f(m)) res = m, r = m - 1;
		else l = m + 1;
	}
	return res;
}

template <class Func>
int FIND_LARGEST(int l, int r, Func f) {
	int res = l - 1;
	while (l <= r) {
		int m = (l + r) >> 1;
		if (f(m)) res = m, l = m + 1;
		else r = m - 1;
	}
	return res;
}

int findLeft(int N) {
	auto f = [&](int len) {
		Guess(1);
		return Guess(1 + 2 * len);
	};

	int l = 0, r = N / 2; 
	while (l <= r) {
		int m = (l + r) >> 1;
		int val = f(m);
		if (val == SAME)
			return 1 + m;
		if (val == HOTTER)
			l = m + 1;
		else
			r = m - 1;
	}

	return -1;
}

int findRight(int N) {
	auto f = [&](int len) {
		Guess(N);
		return Guess(N - 2 * len);
	};
	
	int l = 0, r = N / 2; 
	while (l <= r) {
		int m = (l + r) >> 1;
		int val = f(m);
		if (val == SAME)
			return N - m;
		if (val == HOTTER)
			l = m + 1;
		else
			r = m - 1;
	}

	return -1;
}

int HC(int N) {
	Guess(1);
	int id = Guess(N);

	if (id == SAME)
		return (N + 1) / 2;
	if (id == HOTTER)
		return findRight(N);
	return findLeft(N);
}

• Subtask 1: 0 / 25
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25