Submission #699397

#	Time	Username	Problem	Language	Result	Execution time	Memory
699397		Richw818	Traffic (IOI10_traffic)	C++17	50 / 100	415 ms	166804 KiB

traffic

/**
 *      Author:  Richw818
 *      Created: 02.16.2023 15:28:46
**/

#include <bits/stdc++.h>
using namespace std;
int total = 0;
int center = -1, traffic = INT_MAX;
vector<vector<int>> adj;
vector<int> costs;
int dfs(int n, int p){
    int most = 0, totalChild = 0;
    for(int next : adj[n]){
        if(next != p){
            int val = dfs(next, n);
            most = max(most, val);
            totalChild += most;
        }
    }
    totalChild += costs[n];
    most = max(most, total - totalChild);
    if(most < traffic){
        center = n;
        traffic = most;
    }
    return totalChild;
}
int LocateCentre(int n, int p[], int s[], int d[]){
    adj.resize(n);
    costs.resize(n);
    for(int i = 0; i < n; i++) costs[i] = p[i];
    total = accumulate(p, p + n, 0);
    for(int i = 0; i < n - 1; i++){
        adj[s[i]].push_back(d[i]);
        adj[d[i]].push_back(s[i]);
    }
    dfs(0, -1);
    return center;
}
// int main(){
//     ios_base::sync_with_stdio(false);
//     cin.tie(nullptr);
    
//     return 0;
// }

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