제출 #40766

#제출 시각아이디문제언어결과실행 시간메모리
40766ssnsarang2023Gap (APIO16_gap)C++14
0 / 100
103 ms1520 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; typedef long long ll; ll findGap(int _t, int _n) { ll n = _n; ll mn = 1, mx = (ll)1e18; MinMax(mn, mx, &mn, &mx); ll d = (mx - mn) / n, mod = (mx - mn) % n, pre = mn; ll pstep = mn, step = mn + d + - 1 + mod, gap = 0; while (1) { ll mntmp = -1, mxtmp = -1; if (pstep <= min(mx - 1, step)) MinMax(pstep + 1, min(mx - 1, step), &mntmp, &mxtmp); if (step >= mx) { if (mxtmp != -1) gap = max(gap, mx - mxtmp); else gap = max(gap, mx - pre); } else if (mntmp != -1) gap = max(gap, mntmp - pre); pre = mxtmp, pstep = step, step += d; } return gap; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...