제출 #360249

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
360249		sumit_kk10	Traffic (IOI10_traffic)	C++14	0 / 100	2 ms	2688 KiB

traffic

#include <traffic.h>
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
using namespace std;
const int N = 100000 + 5;
const int MOD = 1e9 + 7;
vector<int> graph[N];
long long int dis[N];
bool vis[N];

void dfs(int source, int p[]){
    vis[source] = 1;
    dis[source] = p[source];
    for(auto k : graph[source]){
        if(!vis[k]) {
            dfs(k, p);
            dis[source] += dis[k];
        }
    }
}

int LocateCentre(int n, int p[], int S[], int D[]){
    for(int i = 0; i < n - 1; ++i){
        graph[S[i]].push_back(D[i]);
        graph[D[i]].push_back(S[i]);
    }
    long long int mn = LLONG_MAX;
    for(int i = 0; i < n; ++i){
        dfs(i, p);
        long long int mx = p[i];
        for(auto k : graph[i])
            mx = max(mx, dis[k]);
        mn = min(mn, mx);
        // cout << mx << endl;
        for(int j = 0; j < n; ++j)
            vis[j] = 0;
    }
    return mn;
}
/*
5
10 10 10 20 20
0 2
1 2
2 3
3 4
 */

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