Submission #1012171

#TimeUsernameProblemLanguageResultExecution timeMemory
1012171asdasdqwerGap (APIO16_gap)C++14
30 / 100
56 ms7080 KiB
#include "gap.h" #include <bits/stdc++.h> using namespace std; long long findGap(int T, int N) { set<long long> a; long long mn = 0, mx = 1e18; for (int i=0;i<(N+1)/2;i++) { long long tmn, tmx; MinMax(mn, mx, &tmn, &tmx); if (tmn == -1) break; a.insert(tmn); a.insert(tmx); mn = tmn+1;mx = tmx-1; } vector<long long> b; for (long long x:a)b.push_back(x); long long dif = 0; for (int i=1;i<N;i++) { dif = max(dif, b[i] - b[i-1]); } return dif; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...