Submission #244845

#	Time	Username	Problem	Language	Result	Execution time	Memory
244845		vioalbert	Just Long Neckties (JOI20_ho_t1)	C++14	9 / 100	1090 ms	7916 KiB

ho_t1

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

const int N = 2e5+5;
int n;
int b[N], odd[N], ans[N];
vector<pair<int, int>> a;

void read() {
	cin >> n;
	for(int i = 0; i <= n; i++) {
		int x; cin >> x;
		a.push_back({x, i});
	}
	sort(a.begin(), a.end());
	for(int i = 0; i < n; i++)
		cin >> b[i];
	sort(b, b+n);
}

void solve() {
	for(int i = 0; i < n; i++) {
		odd[i] = max(0, a[i+1].first - b[i]);
	}

	for(int i = 0; i < n; i++) {
		int& mx = ans[a[i].second] = 0;
		for(int j = 0; j < n; j++)
			mx = max(mx, odd[j]);
		odd[i] = max(0, a[i].first - b[i]);
	}
	int& mx = ans[a[n].second] = 0;
	for(int j = 0; j < n; j++)
		mx = max(mx, odd[j]);

	for(int i = 0; i < n+1; i++)
		cout << ans[i] << " \n"[i==n];
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	read();
	solve();
	return 0;
}

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