oj.uz

Submission #414728

# Submission time Handle Problem Language Result Execution time Memory
414728 2021-05-31T05:58:23 Z ackerman Traffic (IOI10_traffic) C++14
0 / 100
 16 ms 23756 KB 
#include "traffic.h"
#include <vector>
using namespace std;


const int MAX_N = 1e6 + 3e2;
vector<int> adj[MAX_N];

int dfs(int u, int p) {
    int ans = 0;
    for(int to : adj[u]) {
        if(to == p) continue;
        ans += dfs(to, u);
    }
    return ans;
}

int LocateCentre(int N, int P[], int S[], int D[]) {
    for(int i = 0; i < N-1; i++) {
        adj[S[i]].push_back(D[i]);
        adj[D[i]].push_back(S[i]);
    }

    int ans = 2147483647, ret = -1;
    for(int i = 0; i < N; i++) {
        int max_traffic = -2147483648;
        for(int to : adj[i]) {
            max_traffic = max(max_traffic, dfs(to, i));
        }
        if(ans < max_traffic) {
            ans = max_traffic;
            ret = i;
        }
    }
    return ret;
}

Subtask #1
0 / 25.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 25.0

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

Subtask #4
0 / 25.0

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