Submission #998993

#TimeUsernameProblemLanguageResultExecution timeMemory
998993Angus_YeungJust Long Neckties (JOI20_ho_t1)C++17
100 / 100
105 ms20560 KiB
#include <bits/stdc++.h> #define x first #define y second #define pii pair<ll, ll> typedef long long ll; const ll MOD = 1000000007LL; const ll INF = 1e15; using namespace std; ll n, b[200010], ans[200010]; pii a[200010]; priority_queue<pii> q; int main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n+1; i++) cin >> a[i].x, a[i].y = i; for (int i = 1; i <= n; i++) cin >> b[i]; sort(a+1, a+n+2); sort(b+1, b+n+1); for (int i = 1; i <= n; i++) q.push({max(0LL, a[i+1].x-b[i]), i}); for (int i = 1; i <= n+1; i++) { while (!q.empty() && q.top().y > 0 && q.top().y < i) q.pop(); ans[a[i].y] = q.top().x; q.push({max(0LL, a[i].x-b[i]), -i}); } for (int i = 1; i <= n+1; i++) { if (i-1) cout << ' '; cout << ans[i]; } cout << "\n"; return 0; } /* */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...