제출 #1117271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1117271		wellthen_	Just Long Neckties (JOI20_ho_t1)	C++17	100 / 100	164 ms	10824 KiB

ho_t1

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    vector<pair<int, int>> availableties(n+1);
    for(int i = 0; i<=n; i++){
        cin >> availableties[i].first;
        availableties[i].second = i;
    }
    vector<int> initialties(n);
    for(int i = 0; i<n; i++){
        cin >> initialties[i];
    }
    sort(initialties.begin(), initialties.end());
    sort(availableties.begin(), availableties.end());
    vector<int> ans(n+1);
    vector<int> pref(n+1);
    for(int i = 1; i<=n; i++){
        pref[i] = max(pref[i-1], max(0, availableties[i-1].first-initialties[i-1]));
    }
    vector<int> suff(n+1);
    for(int i = n-1; i>=0; i--){
        suff[i] = max(suff[i+1], max(0, availableties[i+1].first-initialties[i]));
    }
    for(int i = 0; i<n+1; i++){
        // assign the ith tie to the ceo
        ans[availableties[i].second] = max(pref[i], suff[i]);
    }
    for(int i = 0; i<=n; i++){
        cout << ans[i] << " ";
    }
}

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