제출 #1340940

#제출 시각아이디문제언어결과실행 시간메모리
1340940altern23Gap (APIO16_gap)C++20
0 / 100
32 ms2364 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long

long long findGap(int T, int N) {
      ll L = 0, R = 1e18;
      vector <ll> v;
      while (L <= R) {
            MinMax(L, R, &L, &R);
            if (L == -1) break;
            v.push_back(L), v.push_back(R);
            L++, R--;
      }

      sort(v.begin(), v.end());
      v.erase(unique(v.begin(), v.end()), v.end());

      ll ret = 0;

      assert(v.size() == N);
      
      for (int i = 1; i < (ll)v.size(); i++) ret = max(ret, v[i]-v[i-1]);

      return ret;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...