Submission #924489

#TimeUsernameProblemLanguageResultExecution timeMemory
924489mochaJust Long Neckties (JOI20_ho_t1)C++14
0 / 100
2 ms4496 KiB
#include <bits/stdc++.h> using namespace std; const int mx = 2e5+1; int n; pair<int,int> a[mx]; int b[mx]; int d[mx], rd[mx]; int ans[mx]; int main() { cin.tie(0);ios::sync_with_stdio(0); cin >> n; for (int i=0;i<=n;i++) { cin >> a[i].first; a[i].second = i; } for (int i=0;i<n;i++) { cin >> b[i]; } sort(a,a+n+1); sort(b,b+n); d[0] = max(a[0].first-b[0],0); for (int i=1;i<n;i++) { d[i] = max(d[i-1],a[i].first-b[i]); } rd[n-1] = a[n].first - b[n-1]; rd[n-1] = max(d[n-1],0); for (int i=n-2;i>=0;i--) { rd[i] = max(rd[i+1],a[i+1].first-b[i]); } ans[a[0].second] = rd[0]; ans[a[n].second] = d[n-1]; for (int i=1;i<n;i++) { ans[a[i].second] = max(d[i-1],rd[i]); } for (int i=0;i<=n;i++) { cout << ans[i] << " "; } cout << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...