Submission #282356

#	Time	Username	Problem	Language	Result	Execution time	Memory
282356		iliccmarko	Traffic (IOI10_traffic)	C++14	25 / 100	294 ms	262144 KiB

traffic

#include <bits/stdc++.h>
#include<traffic.h>
using namespace std;
#define ll long long
#define endl "\n"

using namespace std;




int dfs(int u, int pret, vector<vector<int> > g, int &ans, int &ind, int svi, int p[])
{
    int br = 0;
    for(int i = 0;i<(int)g[u].size();i++)
    {
        int s = g[u][i];
        if(s==pret) continue;
        br+=dfs(s, u, g, ans, ind, svi, p);
    }

    int maks = max(br, svi - p[u] - br);

    if(maks<ans)
    {
        ans = maks;
        ind = u;
    }

    return br + p[u];
}

int LocateCentre(int n, int p[], int s[], int d[])
{
    vector<vector<int> > g(n+1);
    for(int i = 0;i<n-1;i++)
    {
        int a = s[i];
        int b = d[i];
        g[a].push_back(b);
        g[b].push_back(a);
    }
    int svi = 0;
    for(int i = 0;i<n;i++)
    {
        svi+=p[i];
    }
    int ans = svi;
    int ind;
    dfs(0, -1, g, ans, ind, svi, p);
    return ind;
}

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