Submission #493021

#	Time	Username	Problem	Language	Result	Execution time	Memory
493021		JooDdae	Traffic (IOI10_traffic)	C++17	0 / 100	12 ms	23756 KiB

traffic

#include <bits/stdc++.h>
#include "traffic.h"
using namespace std;
using ll = long long;

vector<int> v[1001001];
int n, sz[1001001];

int dfs(int u, int p){
    for(auto x : v[u]) if(x != p) sz[u] += dfs(x, u);
    return sz[u];
}

pair<int, int> dfs2(int u, int p){
    pair<int, int> re = {n-sz[u], u};
    for(auto x : v[u]) if(x != p) re.first = max(re.first, sz[x]);
    for(auto x : v[u]) if(x != p) re = min(re, dfs2(x, u));
    return re;
}

int LocateCentre(int N, int pp[], int S[], int D[]) {
    n = N;
    for(int i=0;i<N-1;i++) v[S[i]].push_back(D[i]), v[D[i]].push_back(S[i]);
    dfs(0, 0);
    return dfs2(0, 0).second;
}

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