Submission #1267582

#	Time	Username	Problem	Language	Result	Execution time	Memory
1267582		somefolk	Traffic (IOI10_traffic)	C++20	100 / 100	516 ms	141192 KiB

traffic

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
#include "traffic.h"
using namespace std;

#define endl "\n"
// #define int long long

const int INF = 2e9+7;
const int MOD = 1e9+7;

int n;
vector<int> a, sum, parent;
vector<vector<int>> adj;

void init(int N, int p[], int s[], int d[]){
    n = N;
    adj.resize(n);
    for(int i = 0; i < n-1; i++){
        adj[s[i]].push_back(d[i]);
        adj[d[i]].push_back(s[i]);
    }
    a.resize(n);
    for(int i = 0; i < n; i++){
        a[i] = p[i];
    }
    parent.resize(n, -1);
    sum.resize(n, 0);
}

void dfs(int u, int p){
    parent[u] = p;
    sum[u] = a[u];
    for(auto &v : adj[u]){
        if(v == p) continue;
        dfs(v, u);
        sum[u] += sum[v];
    }
}

int LocateCentre(int N, int p[], int s[], int d[]){
    init(N, p, s, d);

    dfs(0, -1);

    int total = 0;
    for(auto &i : a) total += i;

    int sol = -1, mn = INF;
    for(int u = 0; u < n; u++){
        int curr = 0;
        for(auto &v : adj[u]){
            if(v == parent[u]) curr = max(curr, total-sum[u]);
            else curr = max(curr, sum[v]);
        }
        if(curr < mn){
            mn = curr;
            sol = u;
        }
    }

    return sol;
}

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