Submission #1020601

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1020601	2024-07-12 07:29:59	AliHasanli	Traffic (IOI10_traffic)	C++17	100 / 100	923 ms	186300 KiB

traffic

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "traffic.h"
#include<bits/stdc++.h>
using namespace std;
long long val[1000005],subtree[1000005],ans=1000000000000000000,calc[1000005];
vector<int>g[1000005];
void dfs(int node,int p)
{
    subtree[node]=val[node];
    for(int go:g[node])
        if(go!=p)dfs(go,node),subtree[node]+=subtree[go];
}
void answer(int node,int p)
{
    //cout<<ans<<endl;
    //long long calc=0;
    for(int go:g[node])
    {
        if(go!=p)
        {
            calc[node]=max(calc[node],subtree[go]);
            answer(go,node);
        }
        else calc[node]=max(calc[node],subtree[1]-subtree[node]);
    }
    ans=min(ans,calc[node]);
}
int LocateCentre(int N, int pp[], int S[], int D[]) {
    for(int i=1;i<=N;i++)val[i]=pp[i-1];
    //for(int i=1;i<=N;i++)cout<<val[i]<<" ";cout<<endl;
    for(int i=0;i<N-1;i++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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