제출 #481673

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
481673		ssense	Traffic (IOI10_traffic)	C++14	100 / 100	964 ms	152928 KiB

traffic

#include <bits/stdc++.h>
#include "traffic.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
//																																					int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}//ssense
vector<vector<int>> adj;
ll pg[1000005];
ll par[10000005];
ll ans[1000005];

ll dfs(int u, int p)
{
	ll sum = pg[u];
	for(auto v : adj[u])
	{
		if(v != p)
		{
			sum+=dfs(v, u);
		}
	}
	par[u] = p;
	ans[u] = sum;
	return sum;
}


int LocateCentre(int n, int p[], int s[], int d[])
{
	for(int i = 0; i <= n; i++)
	{
		vector<int> a;
		adj.push_back(a);
	}
	ll sumtot = 0;
	for(int i = 0; i < n; i++)
	{
		pg[i] = (ll)p[i];
		sumtot+=p[i];
	}
	for(int i = 0; i < n-1; i++)
	{
		adj[s[i]].push_back(d[i]);
		adj[d[i]].push_back(s[i]);
	}
	dfs(1, -1);
	ll ansnow = 2000000001;
	int nod = 0;
	for(int i = 0; i < n; i++)
	{
		ll now = 0;
		ll mx = 0;
		for(auto v : adj[i])
		{
			if(v != par[i])
			{
				mx = max(ans[v], mx);
				now+=ans[v];
			}
		}
		ll nowchiar = max(mx, sumtot-now-p[i]);
		if(nowchiar < ansnow)
		{
			ansnow = nowchiar;
			nod = i;
		}
	}
	return nod;
}

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