Submission #1227665

#	Time	Username	Problem	Language	Result	Execution time	Memory
1227665		wedonttalkanymore	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	64 ms	11592 KiB

ho_t1

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define pii pair <ll, ll>
#define fi first
#define se second

const ll N = 2e5 + 5, inf = 1e18, mod = 1e9 + 7;
int n;
int a[N], b[N];
ll pfs[N], suf[N], ans[N];
pii pos[N];
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n + 1; i++) {
		cin >> a[i];
		pos[i] = make_pair(a[i], i);
	}
	for (int i = 1; i <= n; i++) {
		cin >> b[i];
	}
	
	sort(pos + 1, pos + n + 2);
	sort(b + 1, b + n + 1);
	for (int i = 1; i <= n; i++) {
		pfs[i] = max(pfs[i - 1], max(pos[i].fi - b[i], 0LL));
		
	}
	for (int i = n; i >= 1; i--) {
		suf[i] = max(suf[i + 1], max(pos[i + 1].fi - b[i], 0LL));
	}
	for (int i = 1; i <= n + 1; i++) {
		ans[pos[i].se] = max(pfs[i - 1], suf[i]);
	}
	for (int i = 1; i <= n + 1; i++) {
	    cout << ans[i] << ' ';
	}
	return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 8 / 8
• Subtask 3: 91 / 91