Submission #897180

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
897180	2024-01-02 17:00:33	Iwanttobreakfree	Traffic (IOI10_traffic)	C++11	0 / 100	1 ms	4440 KiB

traffic

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
long long dfs(int nodoActual, vector<vector<int>>& lista, int par, int P[]) {
    long long ans = 0;
    for (int vecino: lista[nodoActual]) {
        if (vecino == par) continue;
        ans += dfs(vecino, lista, nodoActual, P);
    }
    return ans+P[nodoActual];
}
int LocateCentre (int N, int P[], int S[], int D[]) {
    vector<vector<int>> g(N, vector<int>());
    for (int i = 0; i < N-1; ++i) {
        g[S[i]].push_back(D[i]);
        g[D[i]].push_back(S[i]);
    }
    long long maxi = 2e18+1, ans = -1;
    for (int i = 0; i < N; ++i) {
        long long cur = dfs(i, g, i, P);
        if (cur < maxi) {
            maxi = cur;
            ans = i;
        }
    }
    return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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