제출 #207334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
207334		fishy15	Just Long Neckties (JOI20_ho_t1)	C++14	0 / 100	5 ms	376 KiB

ho_t1

#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <cmath>

#define ll long long
#define eps 1e-8
#define MOD 1000000007

#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f

// change if necessary
#define MAXN 200000

using namespace std;

int n;
vector<pair<ll, int>> a;
vector<ll> b;
multiset<ll> cur;
int ans[MAXN];

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;

    for (int i = 0; i < n + 1; i++) {
        ll x; cin >> x;
        a.push_back({x, i});
    }

    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        b.push_back(x);
    }

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

    for (int i = 0; i < n; i++) {
        cur.insert(abs(a[i + 1].first - b[i]));
    }

    ans[a[0].second] = *max_element(cur.begin(), cur.end());

    for (int i = 1; i <= n; i++) {
        cur.erase(cur.find(abs(a[i].first - b[i - 1])));
        cur.insert(abs(a[i - 1].first - b[i - 1]));
        ans[a[i].second] = *max_element(cur.begin(), cur.end());
    }

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

    return 0;
}

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