Submission #1146035

#TimeUsernameProblemLanguageResultExecution timeMemory
1146035jklepecGap (APIO16_gap)C++20
0 / 100
31 ms1168 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, R + (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...