Submission #206759

#	Time	Username	Problem	Language	Result	Execution time	Memory
206759		egekabas	Just Long Neckties (JOI20_ho_t1)	C++14	0 / 100	5 ms	376 KiB

ho_t1

#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<int, int>  pii;
typedef pair<ld, ld>  pld;
ll n;
pll a[1000009];
ll b[1000009];
ll ans[1000009];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    for(ll i = 0; i <= n; ++i){
        cin >> a[i].ff;
        a[i].ss = i;
    }
    for(ll i = 0; i < n; ++i)
        cin >> b[i];
    sort(a, a+n+1);
    sort(b, b+n);
    
    multiset<ll, greater<ll>> cur;
    for(ll i = 0; i < n; ++i){
        cur.insert(abs(a[i+1].ff-b[i]));
    }
    ans[a[0].ss] = *cur.begin();
    for(ll i = 1; i <= n; ++i){
        cur.erase(cur.lower_bound(abs(a[i].ff-b[i-1])));
        cur.insert(abs(a[i-1].ff-b[i-1]));
        ans[a[i].ss] = *cur.begin();
    }
    for(ll i = 0; i <= n; ++i)
        cout << ans[i] << '\n';
}

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