Submission #1138559

#	Time	Username	Problem	Language	Result	Execution time	Memory
1138559		arijit_biswas	Traffic (IOI10_traffic)	C++20	0 / 100	0 ms	320 KiB

traffic

#include<bits/stdc++.h>
using namespace std;

#include "traffic.h"

vector<vector<int>> g;
vector<int> subtreeSize;

void dfs(int node, int par, int p[]) {
    subtreeSize[node] += p[node];
    for (int &v : g[node]) {
        if (v != par) {
            dfs(v, node, p);
            subtreeSize[node] += subtreeSize[v];
        }
    }
}

int centroid(int node, int par) {
    for (int &v : g[node]) {
        if (v != par && subtreeSize[v] >= (subtreeSize[0] + 1) / 2) {
            return centroid(v, node);
        }
    }
    return node;
}

int LocateCentre(int n, int p[], int s[], int d[]) {
    g.resize(n + 1);
    subtreeSize.assign(n + 1, 0);
    for (int i = 0; i < n - 1; i++) {
        g[s[i]].push_back(d[i]);
        g[d[i]].push_back(s[i]);
    }
    dfs(0, -1, p);
    for (int i = 0; i < n; i++) {
        cout << subtreeSize[i] << " ";
    }
    return centroid(0, -1);
}

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