oj.uz

Submission #897179

# Submission time Handle Problem Language Result Execution time Memory
897179 2024-01-02T16:56:07 Z Iwanttobreakfree Traffic (IOI10_traffic) C++14
0 / 100
 1 ms 4540 KB 
#include <bits/stdc++.h>
using namespace std;

int dfs(int nodoActual, vector<vector<int>>& lista, int par, int P[]) {
    int 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]);
    }
    int maxi = 2e9+1, ans = -1;
    for (int i = 0; i < N; ++i) {
        int cur = dfs(i, g, i, P);
        if (cur < maxi) {
            maxi = cur;
            ans = i;
        }
    }
    return ans;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4540 KB Output isn't correct
2 Halted 0 ms 0 KB -