이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <assert.h>
#include "grader.h"
using namespace std;
#define MAX_N 1000000
#define min(a, b) (((a) > (b))?(b):(a))
#define max(a, b) (((a) > (b))?(a):(b))
int HC(int n)
{
int min = 1, max = n, previous_guess = 1, guess = 0, hot_cool;
Guess(1);
while (min < max)
{
guess = min + max - previous_guess;
guess = min(guess, n);
guess = max(guess, 1);
hot_cool = Guess(guess);
if (hot_cool == 0)
{
return ((previous_guess + guess) >> 1);
}
int mid = (previous_guess + guess) / 2;
int mod = (previous_guess + guess) & 1;
if (hot_cool > 0)
{
if (guess > previous_guess)
min = mid + mod;
else
max = mid;
}
else
{
//assert(hot_cool < 0);
if (guess > previous_guess)
max = mid;
else
min = mid + mod;
}
previous_guess = guess;
}
return min;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |