結果

問題 No.2654 [Cherry 6th Tune] Re: start! (Black Sheep)
ユーザー umimelumimel
提出日時 2024-02-26 18:07:38
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,756 bytes
コンパイル時間 3,360 ms
コンパイル使用メモリ 258,876 KB
実行使用メモリ 62,752 KB
最終ジャッジ日時 2024-09-29 11:41:37
合計ジャッジ時間 11,151 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 1 ms
6,820 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 135 ms
17,892 KB
testcase_04 AC 129 ms
17,152 KB
testcase_05 AC 73 ms
11,648 KB
testcase_06 AC 21 ms
6,816 KB
testcase_07 AC 59 ms
10,240 KB
testcase_08 AC 80 ms
12,672 KB
testcase_09 AC 143 ms
18,260 KB
testcase_10 AC 21 ms
6,816 KB
testcase_11 AC 90 ms
13,824 KB
testcase_12 AC 15 ms
6,820 KB
testcase_13 AC 89 ms
13,184 KB
testcase_14 AC 201 ms
22,352 KB
testcase_15 AC 188 ms
21,448 KB
testcase_16 AC 72 ms
11,776 KB
testcase_17 AC 144 ms
19,040 KB
testcase_18 AC 54 ms
9,728 KB
testcase_19 AC 185 ms
21,784 KB
testcase_20 AC 86 ms
13,312 KB
testcase_21 AC 95 ms
14,336 KB
testcase_22 AC 96 ms
13,952 KB
testcase_23 AC 2 ms
6,824 KB
testcase_24 AC 2 ms
6,816 KB
testcase_25 AC 1 ms
6,816 KB
testcase_26 AC 2 ms
6,820 KB
testcase_27 AC 2 ms
6,820 KB
testcase_28 AC 195 ms
23,492 KB
testcase_29 AC 217 ms
23,464 KB
testcase_30 AC 209 ms
23,460 KB
testcase_31 AC 197 ms
23,432 KB
testcase_32 AC 203 ms
23,412 KB
testcase_33 AC 302 ms
62,664 KB
testcase_34 AC 86 ms
21,984 KB
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 2 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


template<typename T>
struct edge{
    int from, to;
    T cost;
    int id;

    edge(){}
    edge(int to, T cost=1) : from(-1), to(to), cost(cost){}
    edge(int to, T cost, int id) : from(-1), to(to), cost(cost), id(id){}
    edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id){}
};

template<typename T>
struct redge{
    int from, to;
    T cap, cost;
    int rev;
    
    redge(int to, T cap, T cost=(T)(1)) : from(-1), to(to), cap(cap), cost(cost){}
    redge(int to, T cap, T cost, int rev) : from(-1), to(to), cap(cap), cost(cost), rev(rev){}
};

template<typename T> using Edges = vector<edge<T>>;
template<typename T> using weighted_graph = vector<Edges<T>>;
template<typename T> using tree = vector<Edges<T>>;
using unweighted_graph = vector<vector<int>>;
template<typename T> using residual_graph = vector<vector<redge<T>>>;


void solve(){
    int n; cin >> n;
    vector<ll> a(n+1);
    for(int i=0; i<n+1; i++) cin >> a[i];
    tree<int> T(n+1);
    for(int i=0; i<n; i++){
        int u, v; cin >> u >> v;
        T[u].push_back(edge<int>(v));
        T[v].push_back(edge<int>(u));
    }
    
    // lo <= hi <= lo+1
    multiset<ll> lo, hi;
    ll lsum=0, hsum=0;
    lo.insert(-LINF);
    hi.insert(LINF);
    auto add = [&](ll x){
        if((int)lo.size() == (int)hi.size()){
            auto itr = lo.end();
            itr--;
            if(*(itr) <= x){
                hi.insert(x);
                hsum += x;
            }else{
                hi.insert(*itr);
                hsum += *itr;
                lsum -= *itr;
                lo.erase(itr);
                lo.insert(x);
                lsum += x;
            }
        }else if((int)lo.size() < (int)hi.size()){
            if(*(hi.begin()) < x){
                lo.insert(*(hi.begin()));
                lsum += *(hi.begin());
                hsum -= *(hi.begin());
                hi.erase(hi.begin());
                hi.insert(x);
                hsum += x;
            }else{
                lo.insert(x);
                lsum += x;
            }
        }
    };

    auto erase = [&](ll x){
        if(lo.find(x)!=lo.end()){
            lo.erase(lo.lower_bound(x));
            lsum -= x;
            if((int)lo.size()+1 < (int)hi.size()){
                lo.insert(*(hi.begin()));
                lsum += *(hi.begin());
                hsum -= *(hi.begin());
                hi.erase(hi.begin());
            }
        }else{
            hi.erase(hi.lower_bound(x));
            hsum -= x;
            if((int)lo.size() > (int)hi.size()){
                auto itr = lo.end();
                itr--;
                hi.insert(*itr);
                hsum += *itr;
                lsum -= *itr;
                lo.erase(itr);
            }
        }
    };

    auto query = [&](){
        ll ans = LINF;
        //右端を選択
        {
            ll cost = 0;
            if((int)lo.size() == (int)hi.size()){
                // 中央値はunique
                auto itr = hi.end();
                itr--; itr--;
                ll mx = *itr;
                itr = lo.end();
                itr--;
                ll mid = *itr;
                cost += mid*(ll)(lo.size()-1) - lsum;
                cost += (hsum-mx) - mid*(ll)(hi.size()-2);

                if(mx == mid) cost++;
            }else{
                auto itr = hi.end();
                itr--; itr--;
                ll mx = *itr;
                itr = lo.end();
                itr--;
                ll lmid = *itr;
                itr--;
                ll rmid = *itr;
                cost += rmid*(ll)(lo.size()-1) - lsum;
                cost += (hsum-mx) - rmid*(ll)(hi.size()-2);
                if(lmid==rmid&&lmid==mx) cost++;
            }

            ans = min(ans, cost);
        }

        //左端を選択
        {
            ll cost = 0;
            if((int)lo.size() == (int)hi.size()){
                // 中央値はunique
                auto itr = lo.begin();
                itr++;
                ll mn = *itr;
                ll mid = *hi.begin();
                cost += mid*(ll)(lo.size()-2) - (lsum - mn);
                cost += hsum - mid*(ll)(hi.size()-1);

                if(mn == mid) cost++;
            }else{
                auto itr = lo.begin();
                itr++;
                ll mn = *itr;
                itr = hi.begin();
                ll lmid = *itr;
                itr++;
                ll rmid = *itr;
                cost += lmid*(ll)(lo.size()-2) - (lsum - mn);
                cost += hsum - lmid*(ll)(hi.size()-1);
                if(lmid==rmid&&lmid==mn) cost++;
            }

            ans = min(ans, cost);
        }

        return ans;
    };

    vector<ll> ans(n+1, -1), depth(n+1, 0);
    function<void(int, int)> dfs = [&](int v, int p){
        add(a[v]);
        if(depth[v]>=2) ans[v] = query();

        for(edge<int> e : T[v]) if(e.to!=p){
            depth[e.to] = depth[v]+1;
            dfs(e.to, v);
        }
        erase(a[v]);
    }; dfs(0, -1);

    for(int v=1; v<n+1; v++) cout << ans[v] << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    // cin >> T;
    while(T--) solve();
}
0