제출 #1273497

#제출 시각아이디문제언어결과실행 시간메모리
1273497lamlamlamGap (APIO16_gap)C++20
30 / 100
34 ms6784 KiB
#include "gap.h" #define ll long long #include <bits/stdc++.h> using namespace std; int n; vector<ll> a; void sol(ll l,ll r){ if(l>r or a.size()==n) return; ll mx,mn; MinMax(l,r,&mn,&mx); if(mx==-1) return; a.push_back(mn); if(mx==mn) return; a.push_back(mx); l = mn+1; r = mx-1; if(l>r or a.size()==n) return; sol(l,r); } long long findGap(int subtask_num, int N){ n = N; if(subtask_num==1){ sol(0,1e18); sort(a.begin(),a.end()); ll ans = 0; for(int i=0; i<a.size()-1; i++) ans = max(ans,a[i+1]-a[i]); return ans; } return -1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...