Submission #1012168

#TimeUsernameProblemLanguageResultExecution timeMemory
1012168asdasdqwerGap (APIO16_gap)C++14
0 / 100
24 ms2152 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++) {
    MinMax(mn, mx, &mn, &mx);
    a.insert(mn);
    a.insert(mx);
  }

  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...