제출 #481713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
481713		MilosMilutinovic	Traffic (IOI10_traffic)	C++14	100 / 100	1041 ms	157504 KiB

traffic

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=1010000;
int a[N],id=0;
ll dis[N],mn=2e18;
vector<int> e[N];
void dfs1(int u,int p) {
	dis[u]=a[u];
	for (int x:e[u]) if (x!=p) dfs1(x,u),dis[u]+=dis[x];
}
void solve(int u,int p) {
	ll curr=0;
	for (int x:e[u]) curr=max(curr,dis[x]);
	if (curr<mn) mn=curr,id=u;
	for (int x:e[u]) if (x!=p) {
		dis[u]-=dis[x];
		dis[x]+=dis[u];
		solve(x,u);
		dis[x]-=dis[u];
		dis[u]+=dis[x];
	}
}
ll LocateCentre(int n,int*P,int*S,int*D) {
	rep(i,0,n) a[i]=P[i];
	rep(i,0,n-1) e[S[i]].pb(D[i]),e[D[i]].pb(S[i]);
	dfs1(0,0);
	solve(0,0);
	return id;
}

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