이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#pragma comment(linker, "/STACK:128000000")
#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;
}
template <class T1, class T2>
inline int minimise(T1 &x, T2 y) {
if (x > y) { x = y; return true; }
return false;
}
template <class T1, class T2>
inline int maximise(T1 &x, T2 y) {
if (x < y) { x = y; return true; }
return false;
}
const int INF = 0x2f2f2f2f;
int N;
mt19937 rnd(time(NULL));
int solve(int l, int r, int x) {
//cout << "solve " << l << " " << r << ", x = " << x << endl;
if (l > r)
return -1;
if (l == r)
return r;
int y = l + r - x;
maximise(y, 1);
minimise(y, N);
if (x == 1 and y == 1)
x++;
if (x == N and y == N)
y--;
int m1 = (x + y) >> 1;
int m2 = (x + y + 1) >> 1;
int id = Guess(y);
if (id == SAME)
return m1;
if (id == HOTTER)
return x < y ? solve(m1 + 1, r, y) : solve(l, m2 - 1, y);
if (id == COLDER)
return x < y ? solve(l, m2 - 1, y) : solve(m1 + 1, r, y);
return -1;
}
int HC(int _N) {
N = _N;
if (N == 1)
return 1;
Guess(N / 2);
return solve(1, N, N / 2);
}
컴파일 시 표준 에러 (stderr) 메시지
hottercolder.cpp:1: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
1 | #pragma comment(linker, "/STACK:128000000")
|
# | 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... |