Submission #206954

#	Time	Username	Problem	Language	Result	Execution time	Memory
206954		wiwiho	Just Long Neckties (JOI20_ho_t1)	C++14	100 / 100	305 ms	14996 KiB

ho_t1

//#define NDEBUG

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define pob pop_back()
#define pof pop_front()
#define F first
#define S second
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
#define pii pair<int, int>
#define pll pair<ll, ll>
#define tiii tuple<int, int, int>
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) ((a) / (b) + !!((a) % (b)))

//#define TEST

typedef long long ll;
typedef unsigned long long ull;

using namespace std;
using namespace __gnu_pbds;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}


int main(){
    StarBurstStream

    int n;
    cin >> n;

    vector<pii> a(n + 1);
    for(int i = 0; i < n + 1; i++){
        cin >> a[i].F;
        a[i].S = i;
    }

    lsort(a);

    vector<int> ans(n + 1);

    vector<int> b(n);
    for(int i = 0; i < n; i++) cin >> b[i];
    lsort(b);

    multiset<int> s;
    for(int i = 0; i < n; i++) s.insert(max(a[i].F - b[i], 0));
    ans[a.back().S] = *s.rbegin();

    for(int i = n - 1; i >= 0;i --){
        s.erase(s.find(max(a[i].F - b[i], 0)));
        s.insert(max(a[i + 1].F - b[i], 0));
        ans[a[i].S] = *s.rbegin();
    }

    printv(ans, cout);

    return 0;
}

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