제출 #481633

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
481633		ssense	Traffic (IOI10_traffic)	C++14	25 / 100	15 ms	4308 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;
int pg[1010];
ll ans = 0;
 
ll dfs(int u, int p)
{
	ll sum = (ll)pg[u];
	for(auto v : adj[u])
	{
		if(v != p)
		{
			ll k = dfs(v, u);
			if(p == -1)
			{
				ans = max(k, ans);
			}
			sum+=k;
		}
	}
	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);
	}
	for(int i = 0; i < n; i++)
	{
		pg[i] = p[i];
	}
	for(int i = 0; i < n-1; i++)
	{
		adj[s[i]].push_back(d[i]);
		adj[d[i]].push_back(s[i]);
	}
	int nod = 0;
	ll al = 3000000001;
	for(int i = 0; i < n; i++)
	{
		dfs(i, -1);
		if((ll)ans < al)
		{
			al = ans;
			ans = 0;
			nod = i;
		}
	}
	return nod;
}

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