제출 #201844

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
201844		nvmdava	Just Long Neckties (JOI20_ho_t1)	C++17	9 / 100	66 ms	4584 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define ff first
#define ss second
#define N 100002
#define MOD 1000000007

int a[N], ans[N];
vector<pair<int, int> > ne;
multiset<int> in;

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

    int n;
    cin>>n;
    for(int i = 0; i <= n; ++i){
        int k;
        cin>>k;
        ne.push_back({k, i});
    }
    sort(ne.begin(), ne.end());
    for(int i = 0; i < n; ++i){
        cin>>a[i];
    }
    sort(a, a + n);
    for(int i = 0; i < n; ++i)
        in.insert(a[i] - ne[i].ff);

    ans[ne[n].ss] = *in.begin();

    for(int i = n - 1; i >= 0; --i){
        in.erase(in.find(a[i] - ne[i].ff));
        in.insert(a[i] - ne[i + 1].ff);
        ans[ne[i].ss] = *in.begin();
    }
    for(int i = 0; i <= n; ++i)
        cout<<max(0, -ans[i])<<' ';
}

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