제출 #333791

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
333791		Sho10	Traffic (IOI10_traffic)	C++14	0 / 100	18 ms	23788 KiB

traffic

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll tot,a[1000005],p[1000005],sub[1000005];
vector<ll>g[1000005];
void dfs(ll node,ll par){
for(auto it : g[node]){
    if(it==node){
            continue;
    }
    dfs(it,node);
    sub[node]+=sub[it];
    p[node]=max(p[node],sub[it]);
}
p[node]=max(p[node],tot-sub[node]-a[node]);
sub[node]+=a[node];
}
int LocateCentre(int N,int pp[],int S[],int D[])
{
    ll n=N;
for(ll i=1;i<=n;i++)
{
    a[i]=pp[i];
    tot+=a[i];
}
for(ll i=1;i<n;i++)
{
    S[i]++;
    D[i]++;
    g[S[i]].pb(D[i]);
    g[D[i]].pb(S[i]);
}
dfs(1,0);
ll mn=LINF,pos=0;
for(ll i=1;i<=n;i++)
{
    if(mn>p[i]){
        mn=p[i];
        pos=i;
    }
}
return pos-1;
}
/*
int32_t main(){
CODE_START;
*/

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