Submission #1083346

#TimeUsernameProblemLanguageResultExecution timeMemory
1083346djs100201Gap (APIO16_gap)C++17
0 / 100
34 ms1968 KiB
#include<bits/stdc++.h> #include "gap.h" #define all(v) v.begin(),v.end() using namespace std; using ll = long long; using P = pair<ll, ll>; using PP = pair<ll, P>; const ll n_ =2e5+10, inf = (ll)2e9 * (ll)1e9 + 7, mod = 998244353; ll n, m, tc = 1, a, b, c, d, sum, x, y, z, base, ans, k; ll findGap(int T, int N) { vector<ll>res(N); ll l=0,r=1e18; MinMax(l,r,&res[0],&res[N-1]); ll lidx=1,ridx=N-2; while(lidx<=ridx){ if(lidx==ridx){ MinMax(l+1,(ll)1e18,&res[lidx],&x); break; } MinMax(l+1,r-1,&res[lidx],&res[ridx]); l=res[lidx],r=res[ridx]; lidx++,ridx--; } ll ret=0; for(int i=1;i<N;i++)ret=max(ret,res[i]-res[i-1]); return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...