Submission #1295872

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295872		AbdullahIshfaq	Just Long Neckties (JOI20_ho_t1)	C++20	100 / 100	67 ms	6976 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 998244353
void solve()
{
	int n;
	cin >> n;
	int b[n + 2], l[n + 2], r[n + 2] = {}, c[n + 2];
	pair<int, int> a[n + 2] = {};
	for (int i = 1; i <= n + 1; i++)
	{
		cin >> a[i].first;
		a[i].second = 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++)
	{
		l[i] = max(l[i - 1], a[i].first - b[i]);
	}
	for (int i = n; i >= 1; i--)
	{
		r[i] = max(r[i + 1], a[i + 1].first - b[i]);
	}
	for (int i = 0; i <= n; i++)
	{
		c[a[i + 1].second] = max(l[i], r[i + 1]);
	}
	for (int i = 1; i <= n + 1; i++)
	{
		cout << c[i] << " ";
	}
	cout << '\n';
}
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll t = 1;
	// cin >> t;
	// cout << fixed << setprecision(12);
	for (ll i = 1; i <= t; i++)
	{
		solve();
	}
}

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