제출 #61101

#제출 시각아이디문제언어결과실행 시간메모리
61101istleminGap (APIO16_gap)C++14
0 / 100
98 ms2580 KiB
#include "gap.h" #include<bits/stdc++.h> using namespace std; #define rep(i,a,b) for(int i = a; i<int(b);++i) #define all(v) v.begin(),v.end() #define sz(v) v.size() #define trav(a,c) for(auto a: c) typedef long long ll; typedef vector<ll> vi; typedef pair<ll,ll> pii; void ask(ll l,ll r, ll *mn,ll *mx){ ll ansMn,ansMx; MinMax(l,r-1,&ansMn,&ansMx); (*mn) = ansMn; (*mx) = ansMx; } long long findGap(int T, int N) { ll t = T; ll n = N; if(t==1){ vi a; ll l = 0; ll r = 1e18+1; while(true){ ll mn,mx; ask(l,r,&mn,&mx); if(mn==-1) break; l = mn+1; r = mx; a.push_back(mn); if(mn==mx) break; a.push_back(mx); } sort(all(a)); ll mxGap = 0; rep(i,0,n-1) mxGap = max(mxGap,a[i+1]-a[i]); return mxGap; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...