Submission #469341

#	Time	Username	Problem	Language	Result	Execution time	Memory
469341		Drew_	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	299 ms	18628 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;

#define ii pair<int, int>
#define f1 first
#define s2 second

int main()
{
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n;
	cin >> n;

	vector<ii> a(n+1);
	vector<int> b(n), ans(n+1);
	for (int i = 0; i < n+1; ++i)
		cin >> a[i].f1, a[i].s2 = i;
	for (int &x : b)
		cin >> x;

	sort(a.begin(), a.end());
	sort(b.begin(), b.end());

	multiset<int, greater<int>> st;
	for (int i = 1; i < n+1; ++i)
		st.insert(a[i].f1 - b[i-1]);
	ans[a[0].s2] = max(0, *st.begin());

	for (int i = 1; i < n+1; ++i)
	{
		st.erase(st.lower_bound(a[i].f1 - b[i-1]));
		st.insert(a[i-1].f1 - b[i-1]);
		ans[a[i].s2] = max(0, *st.begin());
	}

	for (int x : ans)
		cout << x << " ";
	cout << '\n';

	return 0;
}

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