Submission #1292549

#TimeUsernameProblemLanguageResultExecution timeMemory
1292549goulthenGap (APIO16_gap)C++20
0 / 100
48 ms3256 KiB
#include <bits/stdc++.h> #include "gap.h" using namespace std; #define ll long long #define pb push_back #define rep(i,a,b) for(int i = a; i <= b; i++) ll findGap(int T, int N) { ll s = 0, t = 1e18; MinMax(s,t,&s,&t); ll ans = (t-s+N-1)/(N-1); vector<ll> imp; ll s1 = s, t1 = s+ans; while (s1 <= t) { ll tmp = t1; MinMax(s1,t1,&s1,&t1); if(s1!=-1)imp.pb(s1); if(t1!=-1)imp.pb(t1); s1 = tmp+1; t1 = s1+ans; } rep(i,0,(int)imp.size()-2) { ans = max(ans, imp[i+1]-imp[i]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...