# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1146100 | Khalid_Alabdullatif | Gap (APIO16_gap) | C++17 | 50 ms | 1096 KiB |
#include "gap.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
long long findGap(int T, int N)
{
ll mn,mx,n=N;
MinMax(0,1e18,&mn,&mx);
ll l=mn,r=mx;
ll block=(r-l-1)/(n)+1;
ll ans=0,last=mn;
for(ll i=mn;i<r;i+=block){
MinMax(i+1,i+block,&mn,&mx);
if(mx!=-1)
ans=max(max(ans,mn-last),mx-mn),last=mx;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |