Submission #380640

#	Time	Username	Problem	Language	Result	Execution time	Memory
380640		dinesh_b_s	Traffic (IOI10_traffic)	C++14	100 / 100	1178 ms	141804 KiB

traffic

#include "traffic.h"
#include<bits/stdc++.h>

using namespace std;

#define ld long double
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define pll pair<int,int>
#define MOD 1000000007
#define M2 998244353
#define INF 1e9 + 1
#define EPS 1e-9
#define pi pair<int,int>
#define minheap priority_queue<int, vector<int>, greater<int>>
const ld PI = 3.14159265358979323846;
const int MX = 1e6 + 5;

int fans = 0;
vector<int> g[MX], nodes(MX), people(MX), children(MX);

void dfs(int v, int parent) {
    for (auto x: g[v]) {
        if (x == parent) continue;
        dfs(x, v);
        children[v] += children[x];
        people[v] = max(people[v], children[x]);
    }
    people[v] = max(people[v], fans - children[v] - nodes[v]);
    children[v] += nodes[v];
}

int LocateCentre(int n, int p[], int d[], int s[]) {
    for (int i = 0; i < n; i++) {
        fans += p[i];
        nodes[i] = p[i];
    }
    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);
    int sol = INF, res = -1;
    for (int i = 0; i < n; i++) {
        if (people[i] < sol) {
            res = i;
            sol = people[i];
        }
    }
    return res;
}

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