Submission #762934

#	Time	Username	Problem	Language	Result	Execution time	Memory
762934		Antonn_114	Just Long Neckties (JOI20_ho_t1)	C++17	0 / 100	1 ms	340 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
int main() {
	int n;
	cin >> n;
	vector<pair<int, int>> a(n + 1);
	vector<int> b(n);
	for (int i = 0; i < n + 1; 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());
	vector<int> res(n + 1);
	vector<int> max_diff_cross(n);
	for (int i = n; i >= 1; i--){
		max_diff_cross[i] = abs(a[i].first - b[i - 1]);
		if (i != n) max_diff_cross[i] = max(max_diff_cross[i], max_diff_cross[i + 1]);
	}
	int max_diff_straight = 0;
	for (int i = 0; i <= n; i++){
		res[a[i].second] = max(i != n ? max_diff_cross[i + 1] : 0, max_diff_straight);
		max_diff_straight = max(max_diff_straight, abs(a[i].first - b[i]));
	}
	for (int i = 0; i <= n; i++){
		cout << res[i] << " ";
	}
	return 0;
}

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