Submission #52098250

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,int> P;
typedef pair<int,P> PP; 
const int mod = 998244353;
struct mint {
  long long x; // typedef long long long long;
  mint(long long x=0):x((x%mod+mod)%mod){}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,int> P;
typedef pair<int,P> PP; 


const int mod = 998244353;
struct mint {
  long long x; // typedef long long long long;
  mint(long long x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}//後ろのconstはメンバxを変更しないことを示す
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  bool operator==(const mint a) const {return a.x==x;}
  mint pow(long long t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};

std::istream& operator>>(std::istream& is, mint& a) { return is >> a.x;}
std::ostream& operator<<(std::ostream& os, const mint& a) { return os << a.x;}



struct combination {
  std::vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
};


const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};


int main(){
    int N;
    cin>>N;
    vector<int> A(N-1),B(N-1);
    vector<vector<int>> G(N);
    for(int i=0;i<N-1;i++){
        cin>>A[i]>>B[i];
        A[i]--;B[i]--;
        G[A[i]].push_back(B[i]);
        G[B[i]].push_back(A[i]);
    }
    ll sumC=0;
    vector<ll> C(N);
    for(int i=0;i<N;i++){
        cin>>C[i];
        sumC+=C[i];
    }

    vector<int> dist0(N,inf);

    {
        queue<int> que;
        que.push(0);
        dist0[0]=0;
        while(!que.empty()){
            int now=que.front();
            que.pop();
            for(int to:G[now]){
                if(dist0[to]==inf){
                    dist0[to]=dist0[now]+1;
                    que.push(to);
                }
            }
        }
    }

    vector<ll> val(N,0);
    vector<int> num(N,0);

    auto dfs0=[&](auto f,int now,int pre)->void{
        
        for(int to:G[now]){
            if(to==pre) continue;
            f(f,to,now);
            val[now]+=val[to];
            num[now]+=num[to];
        }
        val[now]+=C[now];
        num[now]+=1; //自分自身
    };

    dfs0(dfs0,0,-1);

    ll score0=0;
    for(int i=0;i<N;i++){
        score0+=dist0[i]*C[i];
    }

    vector<ll> ans(N);

    auto dfs=[&](auto f,int now,int pre,ll score)->void{

        ans[now]=score;

        for(int to:G[now]){
            if(to==pre) continue;
            ll to_score=0;
            to_score+=score;
            to_score-=val[to];
            to_score+=(sumC-val[to]);
            f(f,to,now,to_score);
        }
    };

    dfs(dfs,0,-1,score0);
    ll final_ans=INF;
    for(int i=0;i<N;i++){
        //cout<<"ans["<<i<<"]="<<ans[i]<<endl;
        final_ans=min(final_ans,ans[i]);
    }
    cout<<final_ans<<endl;

}

Submission Info

Judge Result