Submission #1236241

#TimeUsernameProblemLanguageResultExecution timeMemory
1236241AMel0nGap (APIO16_gap)C++20
70 / 100
44 ms3256 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define FOR(i,N) for(ll i = 0; i < N; i++) #define all(x) (x).begin(), (x).end() #define F first #define S second #include "gap.h" const ll MAXN = 100005; ll findGap(int T, int N) { ll mn, mx; MinMax(0, 1e18, &mn, &mx); ll x = ceil(double ((mx - 1) - (mn + 1)) / double(N - 1)); ll maxr = mx - 1; ll l = mn + 1; vector<ll> simga = {mn}; while(l <= maxr) { MinMax(l, min(maxr, l + x), &mn, &mx); if (mn != -1) { simga.push_back(mn); simga.push_back(mx); } l = min(maxr, l + x) + 1; } simga.push_back(maxr + 1); ll res = 0; FOR(i, (ll)simga.size() - 1) { res = max(res, simga[i+1] - simga[i]); } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...