제출 #1146039

#제출 시각아이디문제언어결과실행 시간메모리
1146039jklepecGap (APIO16_gap)C++20
0 / 100
39 ms1192 KiB
#include "gap.h" long long findGap(int T, int N) { long long L, R; MinMax(0, 1e18, &L, &R); auto max = [](long long a, long long b) { return a > b ? a : b; }; long long diffy = (R - L - 1) / (N - 1) + 1; long long sol = diffy; int last = L; for (int i = 0; i < N - 1; i++) { long long m, M; MinMax(L + i * diffy + 1, L + (i + 1) * diffy, &m, &M); sol = max(sol, m - last); if (m != -1) last = M; } return max(sol, R - last); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...