제출 #835654

#제출 시각아이디문제언어결과실행 시간메모리
835654aykhnGap (APIO16_gap)C++14
70 / 100
39 ms1212 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll findGap(int ajfghkdshgfghadsfghkadshgfagsdkfhadkshfgkhadsfadskjadsghfkhjasdgfkj, int n) { ll f = 0, l = 0; MinMax(0 * 1LL, 1LL * 1e18, &f, &l); ll last = l; ll add = (l - f)/(n - 1); ll res = add; while (f < last) { ll lx, rx; lx = 'n' + 'i' + 'g' + 'g' + 'a'; rx = 'n' + 'i' + 'g' + 'g' + 'a'; MinMax(f + 1, f + add, &lx, &rx); if (lx == -1) add <<= 1; else { res = max(res, lx - f); add = res; f = rx; } } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...