oj.uz

Submission #919877

# Submission time Handle Problem Language Result Execution time Memory
919877 2024-02-01T18:34:34 Z boris_mihov Traffic (IOI10_traffic) C++17
0 / 100
 10 ms 33368 KB 
#include "traffic.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 1e6 + 10;
const int INF  = 1e9;

int n;
int p[MAXN];
llong sz[MAXN];
std::vector <int> g[MAXN];

void dfs(int node, int par)
{
    sz[node] = p[node];
    for (const int &u : g[node])
    {
        if (u == par)
        {
            continue;
        }

        dfs(u, node);
        sz[node] += sz[u];
    }
}

int find(int node, int par)
{
    for (const int &u : g[node])
    {
        if (u == par)
        {
            continue;
        }

        if (sz[u] > n / 2)
        {
            return find(u, node);
        }
    }

    return node;
}

int LocateCentre(int N, int pp[], int S[], int D[]) 
{
    n = N;
    for (int i = 0 ; i < n - 1 ; ++i)
    {
        p[i] = pp[i];
        g[S[i]].push_back(D[i]);
        g[D[i]].push_back(S[i]);
    }

    dfs(0, -1);
    return find(0, -1);
}

Subtask #1
0 / 25.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 25.0

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

Subtask #4
0 / 25.0

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