Submission #1213252

#TimeUsernameProblemLanguageResultExecution timeMemory
1213252rhm_ganJust Long Neckties (JOI20_ho_t1)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 42
#endif

#define int long long

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

   	int n;
   	cin >> n;

   	vector<int> b(n);
   	vector<pair<int, int>> a(n + 1);
   	for (int i = 0; i <= n; 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> ans(n + 1);

   	multiset<int> s;
   	for (int i = 1; i <= n; i++) {
   		s.insert(abs(a[i].first - b[i - 1]));
   	}
   	
   	ans[a[0].second] = *s.rbegin();
   	for (int i = 0; i < n; i++) {
   		s.insert(abs(a[i].first - b[i]));
   		s.erase(s.find(abs(a[i + 1].first - b[i])));
   		ans[a[i + 1].second] = *s.rbegin();
   	}

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

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...