Submission #701597

#TimeUsernameProblemLanguageResultExecution timeMemory
701597vjudge1Just Long Neckties (JOI20_ho_t1)C++17
100 / 100
96 ms14200 KiB
#include<bits/stdc++.h> #define int long long #define MOD 998244353 #define all(x) x.begin(),x.end() #define ff first #define ss second #define pb push_back #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); using namespace std; int32_t main(){ fast; int n; cin>>n; pair<int,int>a[n+5]; int b[n],ans[n+5]; for(int i=0;i<=n;i++){ cin>>a[i].ff; a[i].ss=i; } for(int i=0;i<n;i++)cin>>b[i]; sort(a,a+n+1); sort(b,b+n); vector<int>v; int mx=-1; v.pb(mx); for(int i=n-1;i>=0;i--){ mx=max(mx,max(a[i+1].ff-b[i],(int)0)); v.pb(mx); } ans[a[0].ss]=mx; v.pop_back(); mx=-1; for(int i=0;i<n;i++){ mx=max(mx,max(a[i].ff-b[i],(int)0)); ans[a[i+1].ss]=max(mx,v.back()); v.pop_back(); } for(int i=0;i<=n;i++)cout<<ans[i]<<" "; cout<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...