Submission #1179622

#TimeUsernameProblemLanguageResultExecution timeMemory
1179622user736482Just Long Neckties (JOI20_ho_t1)C++20
100 / 100
65 ms13740 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define pb push_back #define ff first #define ss second #define MOD 1000000009 #define INF 1000000019 #define INFL 1000000000000000099LL ll n,q,s,t,a,b,c,ans,k,m; vector<ll>v2; vector<pair<ll,ll>>v1; ll co[1000007][2],co2[1000007]; int main() { ios_base::sync_with_stdio(0);cin.tie(0); cin>>n; for(ll i=0;i<=n;i++){ cin>>a; v1.pb({a,i}); } for(ll i=0;i<n;i++){ cin>>a; v2.pb(a); } sort(v1.begin(),v1.end()); sort(v2.begin(),v2.end()); for(ll i=1;i<=n;i++){ co[i][0]=max(co[i-1][0],v1[i-1].ff-v2[i-1]); } for(ll i=n-1;i>=0;i--){ co[i][1]=max(co[i+1][1],v1[i+1].ff-v2[i]); } for(ll i=0;i<=n;i++)co2[v1[i].ss]=max(co[i][0],co[i][1]); for(ll i=0;i<=n;i++)cout<<co2[i]<<" "; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...