Submission #732994

#TimeUsernameProblemLanguageResultExecution timeMemory
732994SanguineChameleonGap (APIO16_gap)C++17
0 / 100
46 ms1940 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long findGap(int T, int N) { if (T == 1) { long long mi = 0; long long mx = 1e18L; int lt = 0; int rt = N - 1; vector<long long> a(N); while (lt <= rt) { MinMax(mi, mx, &mi, &mx); a[lt] = mi; a[rt] = mx; mi++; mx--; lt++; rt--; } long long res = 0; for (int i = 1; i < N; i++) { res = max(res, a[i + 1] - a[i]); } return res; } else { /* long long mi = 0; long long mx = 1e18L; MinMax(mi, mx, &mi, &mx); long long len = (mx - mi - 1) / (N - 1) + 1; vector<long long> a; for (int i = 1; i <= N - 1; i++) { }*/ } }

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:38:1: warning: control reaches end of non-void function [-Wreturn-type]
   38 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...