제출 #668330

#제출 시각아이디문제언어결과실행 시간메모리
668330birthdaycakeGap (APIO16_gap)C++17
0 / 100
61 ms3260 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; long long findGap(int T, int N){ long long l = 0, r = 0, mn = 0, mx = 0; MinMax(1, 1000000000000000000, &mn, &mx); l = mn; r = mx; long long sz = (r - l + 1) / (N - 1), j = 0; vector<pair<long long,long>>d; for(j = l; j <= r; j += sz+1){ MinMax(j, j + sz, &mn, &mx); d.push_back({mn, mx}); } MinMax(j, r, &mn, &mx); d.push_back({mn, mx}); long long ans = sz; mx = d[0].second; for(int i = 1; i < (int)d.size(); i++){ if(d[i].first != -1){ ans = max(ans, d[i].first - mx); mx = d[i].second; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...