#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
using vi = vector<int>;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lb lower_bound
/// #define int ll
const int oo = 1e9 + 7;
int Guess(int v);
int HC(int N) {
int lo = 1, hi = N, pr = 1; Guess(1);
while(lo <= hi) {
int to = (lo + hi) / 2;
int r = Guess(to), md = (to + pr) / 2 + 1 - (to + pr) % 2;
if(to > pr) {
if(r == -1) hi = md - 1;
if(r == 0) return (to + pr) / 2;
if(r == 1) lo = md + 1;
}
if(to < pr) {
if(r == -1) lo = md + 1;
if(r == 0) return (to + pr) / 2;
if(r == 1) hi = md - 1;
}
if(to == pr) return to;
pr = to;
}
return lo;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
30 ms |
9684 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
32 ms |
9728 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
31 ms |
9732 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
621 ms |
76916 KB |
Output isn't correct - alpha = 0.000000000000 |