Submission #95632

#TimeUsernameProblemLanguageResultExecution timeMemory
95632jeffGap (APIO16_gap)C++14
0 / 100
69 ms1272 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; long long findGap(int T, int N) { long long l, r, y, z, ls = -1, rs = 0, a, b = 0, i; MinMax(0, 1000000000000000000, &y, &z); for (i = 0; i < N - 1; ++i) { a = y + (long double) i * (z - y) / (N - 1); b = y + (long double) (i + 1) * (z - y) / (N - 1) - 1; if (a >= b) continue; MinMax(a, b, &l, &r); if (l < 0 && r < 0) continue; if (ls > -1) rs = max(rs, l - ls); ls = r; } return max(rs, z - r); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...