제출 #556705

#제출 시각아이디문제언어결과실행 시간메모리
556705MohamedFaresNebiliHotter Colder (IOI10_hottercolder)C++14
50 / 100
553 ms8000 KiB
#include <bits/stdc++.h> #include "grader.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) { if(lo == hi) return lo; int to = (lo + hi) / 2; if(to == pr && to - 1 >= lo) to--; if(to == pr && to + 1 <= hi) to++; if(to == pr) return to; int r = Guess(to), md = abs(to - pr); if(md & 1) md++; if(to > pr) { if(r == -1) hi = min(hi, to - md / 2); if(r == 0) return (to + pr) / 2; if(r == 1) lo = max(lo, pr + md / 2); } if(to < pr) { if(r == -1) lo = max(lo, to + md / 2); if(r == 0) return (to + pr) / 2; if(r == 1) hi = min(hi, pr - md / 2); } pr = to; } return N; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...