oj.uz

답안 #979837

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
979837 2024-05-11T13:22:23 Z IUA_Hasin Just Long Neckties (JOI20_ho_t1) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

#define ll                                  long long
#define ld                                  long double
#define endl                                "\n"

using namespace std;


int main(){
    #if __has_include("LOCAL.hh")
        #include "LOCAL.hh"
    #endif

    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
        using namespace std::chrono;
        cout << fixed << setprecision(9);
        auto begin = steady_clock::now();
    #else
        std::ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout.tie(NULL);
    #endif



    ll n;
    cin>>n;
    vector<pair<ll, ll>> v;
    ll brr[n];

    for(int i=0; i<n+1; i++){
        ll x;
        cin>>x;
        v.push_back({x, i});
    }

    for(int i=0; i<n; i++){
        cin>>brr[i];
    }
    sort(v.begin(), v.end());
    sort(brr, brr+n);

    ll diff1[n];
    ll diff2[n];
    for(int i=0; i<n; i++){
        ll b = brr[i];
        ll a1 = v[i].first;
        ll a2 = v[i+1].first;
        ll temp1 = max((ll)0, a1-b);
        ll temp2 = max((ll)0, a2-b);
        diff1[i] = temp1;
        diff2[i] = temp2;
    }

    multiset<ll> s;
    for(int i=0; i<n; i++){
        s.insert(diff1[i]);
    }

    ll ans[n+1];
    ll r = n;
    while(r>=0){
        ll tempind = v[r].second;
        auto it = s.end();
        it--;
        ll temp = *it;
        ans[tempind] = temp;
        s.erase(it);
        ll next = diff2[r-1];
        s.insert(next);

        r--;
    }

    for(int i=0; i<n+1; i++){
        cout << ans[i] << " ";
    }
    cout<<endl;
    






    #ifdef LOCAL
        auto end = steady_clock::now();
        cout << "\nTime : " 
             << (ld)duration_cast<nanoseconds>
                (end - begin).count()/1000000000 
             << "s" << endl;
    #endif


    return 0;
}

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -