oj.uz

Submission #428064

# Submission time Handle Problem Language Result Execution time Memory
428064 2021-06-15T07:48:53 Z aris12345678 Traffic (IOI10_traffic) C++14
0 / 100
 18 ms 23756 KB 
#include <bits/stdc++.h>
#include "traffic.h"
using namespace std;

const int mxN = 1000005;
vector<int> adj[mxN];
int sums[mxN], res[mxN];

void dfs(int u, int par, int p[]) {
    sums[u] = p[u];
    for(auto &v : adj[u]) {
        if(v == par) continue;
        dfs(v, u, p);
        sums[u] += sums[v];
    }
    for(auto &v : adj[u]) {
        if(v == par)
            res[u] = max(res[u], sums[0]-sums[u]);
        else
            res[u] = max(res[u], sums[v]);
    }
}

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]);
    }
    dfs(0, -1, p);
    int ans = 0, pos = 0;
    for(int i = 0; i < n; i++) {
        if(ans < res[i])
            ans = res[i], pos = i;
    }
    return pos;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 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 18 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 18 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 18 ms 23756 KB Output isn't correct
2 Halted 0 ms 0 KB -