제출 #525816

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
525816	2022-02-13 00:09:35	gg123_pe	경주 (Race) (IOI11_race)	C++17	100 / 100	559 ms	63864 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> 
#include "race.h" 
using namespace std; 
typedef long long ll; 
#define f(i,a,b) for(int i = a; i < b; i++)
#define ff first
#define ss second
const ll N = 1e6 + 5; 
ll n, k, sz[N], ans = N, dist[N], dreal[N], aux[N]; 
bool on[N]; 
vector <pair<int,ll>> adj[N]; 
vector <int> ra; 
int size(int u, int f){
    sz[u] = 1;
    for(auto v: adj[u]) if(v.first != f and !on[v.first]) sz[u] += size(v.first, u); 
    return sz[u]; 
}
int get_centroid(int u, int f, int curr_size){
    for(auto v: adj[u]) if(v.first != f and !on[v.first] and sz[v.first]*2 > curr_size) return get_centroid(v.first, u, curr_size);
    return u; 
}
void get_tree(int u, int f){
    ra.push_back(u); 
    for(auto v: adj[u]) if(v.first != f and !on[v.first]) get_tree(v.first, u); 
}
void dfs(int u, int f){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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