Submission #199516

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
199516	2020-02-01 17:40:44	shahriarkhan	Race (IOI11_race)	C++14	100 / 100	947 ms	34040 KiB

race

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<bits/stdc++.h>
using namespace std ;
const int mx = 2e5 + 5 , ww = 1e7 + 6 ;
vector<pair<int,int> > adj[mx] ;
int subtree[mx] , vis[mx] , dist[ww] , n , ans = mx , k ;
void dfs(int s , int par)
{
    int siz = adj[s].size() ;
    subtree[s] = 1 ;
    for(int i = 0 ; i < siz ; ++i)
    {
        if(adj[s][i].first!=par && vis[adj[s][i].first]==0)
        {
            dfs(adj[s][i].first,s) ;
            subtree[s] += subtree[adj[s][i].first] ;
        }
    }
}
int centroid(int s , int par , int n)
{
    int siz = adj[s].size() ;
    for(int i = 0 ; i < siz ; ++i)
    {
        if(adj[s][i].first!=par && vis[adj[s][i].first]==0)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 22 / 22
• Subtask 4: 57 / 57