제출 #769629

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

ho_t1

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n; cin >> n;
    vector <pair<int, int>> a(n + 1);
    vector <int> b(n);
    
    for (int i = 0; i <= n; i++){
        cin >> a[i].f;
        a[i].s = i;
    }
    
    for (auto &x : b) cin >> x;
    
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    
    vector <int> ans(n + 1);
    multiset <int> st;
    for (int i = 1; i <= n; i++) st.insert(max(0LL, a[i].f - b[i - 1]));
    
    for (int i = 0; i <= n; i++){
        ans[a[i].s] = *(--st.end());
        if (i != n){
            st.erase(st.find(max(0LL, a[i + 1].f - b[i])));
            st.insert(max(0LL, a[i].f - b[i]));
        }
    }
    
    for (int i = 0; i <= n; i++) cout << ans[i] << " \n"[i == n];
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

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