Submission #1200543

#TimeUsernameProblemLanguageResultExecution timeMemory
1200543PlayVoltzJust Long Neckties (JOI20_ho_t1)C++20
100 / 100
150 ms6888 KiB
#include <bits/stdc++.h> using namespace std; #define pii pair<int, int> int main(){ int n; cin>>n; vector <pii> a(n+1); vector <int> ans(n+1), b(n), left(n), right(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.begin(), a.end()); sort(b.begin(), b.end()); left[0] = max(0, a[0].first-b[0]); for (int i=1; i<n; ++i){ left[i] = max(left[i-1], a[i].first-b[i]); } right[n-1] = max(0, a[n].first-b[n-1]); for (int i=n-2; i>=0; --i){ right[i] = max(right[i+1], a[i+1].first-b[i]); } ans[a[0].second] = right[0]; ans[a[n].second] = left[n-1]; for (int i=1; i<n; ++i){ ans[a[i].second] = max(left[i-1], right[i]); } for (auto num:ans)cout<<num<<" "; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...