Submission #672181

#TimeUsernameProblemLanguageResultExecution timeMemory
672181amirhoseinfar1385Just Long Neckties (JOI20_ho_t1)C++17
100 / 100
87 ms10824 KiB
#include<bits/stdc++.h> using namespace std; int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; vector<pair<int,int>>all(n+2); vector<int>alln(n+1); for(int i=1;i<=n+1;i++){ cin>>all[i].first; all[i].second=i; } for(int i=1;i<=n;i++){ cin>>alln[i]; } sort(all.begin(),all.end()); sort(alln.begin(),alln.end()); vector<int>ps(n+1),suf(n+3); for(int i=1;i<=n;i++){ ps[i]=max(ps[i-1],max(all[i].first-alln[i],0)); } for(int i=n+1;i>=2;i--){ suf[i]=max(suf[i+1],max(0,all[i].first-alln[i-1])); } vector<int>res(n+2); for(int i=1;i<=n+1;i++){ res[all[i].second]=max(ps[i-1],suf[i+1]); } for(int i=1;i<=n+1;i++){ cout<<res[i]<<" "; } cout<<"\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...