제출 #899537

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
899537	2024-01-06 11:51:42	Iwanttobreakfree	Traffic (IOI10_traffic)	C++14	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;
int best_ans = 2e9+2, nodo_final = -1;
int total_residents;
int dfs(int nodoActual, vector<vector<int>>& lista, int par, int P[]) {
    // ans cuenta los residentes del subarbol
    // maxi se quedara con la maxima afluencia de cada vecino
    int total_subtree_residents = P[nodoActual], maxi = 0;
    for (int vecino: lista[nodoActual]) {
        if (vecino == par) continue;
        int subtree_resi = dfs(vecino, lista, nodoActual, P);
        total_subtree_residents += subtree_resi;
        maxi = max(maxi, subtree_resi);
    }
    maxi = max(maxi, total_residents-total_subtree_residents);
    // Restamos el total menos el subtree y sabremos cuantos llegan
    // por el padre
    if (maxi < best_ans) {
        maxi = best_ans;
        nodo_final = nodoActual; 
    }
    return total_subtree_residents;
}
    
int LocateCentre (int N, int P[], int S[], int D[]) {
    vector<vector<int>> g(N, vector<int>());
    vector<int> subtreeSz(N);
    for (int i = 0; i < N-1; ++i) {
        g[S[i]].push_back(D[i]);
        g[D[i]].push_back(S[i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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