제출 #420918

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
420918		Joo	Traffic (IOI10_traffic)	C++17	0 / 100	17 ms	23824 KiB

traffic

#include<bits/stdc++.h>
using namespace std;

const int N = 1e6+10;

int dp[N],sum[N],val[N],sumall;
vector<int> vec[N];

void fisum(int u, int p){
    sum[u] = val[u];
    sumall += val[u];
    for(int v : vec[u]){
        if(v == p) continue;
        fisum(v, u);
        sum[u] += sum[v];
    }
}

void solve(int u, int p){
    int res = 0;
    for(int v : vec[u]){
        if(v == p) continue;
        solve(v, u);
        dp[u] = min(dp[u], dp[v]);
        res = max(res, sum[v]);
    }
    res = max(res, sumall-sum[u]);
    dp[u] = min(dp[u], res);
}

int LocateCentre(int n, int P[], int E1[], int E2[]){
    for(int i=0; i<n; i++){
        val[i] = P[i];
        dp[i] = 2e9;
    }
    for(int i=0; i<n-1; i++){
        vec[E1[i]].emplace_back(E2[i]);
        vec[E2[i]].emplace_back(E1[i]);
    }
    fisum(0, 0);
    solve(0, 0);
    return dp[0];
}
/*main(){
    int n,P[N],S[N],D[N];
    cin >> n;
    cout << "TEST";
    for(int i=0; i<n; i++){
        cin >> P[i];
    }
    for(int i=0; i<n-1; i++){
        cin >> S[i] >> D[i];
    }
    cout << LocateCentre(n, P, S, D);
}*/

• Subtask 1: 0 / 25
• Subtask 2: 0 / 25
• Subtask 3: 0 / 25
• Subtask 4: 0 / 25