제출 #1315811

#제출 시각아이디문제언어결과실행 시간메모리
1315811wangzhiyi33Gap (APIO16_gap)C++20
0 / 100
2096 ms1204 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; #define ll long long ll n,ans; ll findGap(int T, int N){ n=N; ll mn,mx; MinMax(0,1e18,&mn,&mx); int grup=(mx-mn)/(n-1); ans=grup; ll satu,dua,lst; lst=mn; for(satu=mn+1,dua=mn+grup;satu<=mx;satu+=grup,dua+=grup){ dua=min(dua,mx); ll apa1,apa2; MinMax(satu,dua,&apa1,&apa2); if(apa1==-1)continue; ans=max(ans,apa1-lst); lst=apa2; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...