제출 #502514

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
502514	2022-01-06 07:46:08	n00bie_1004	Railway (BOI17_railway)	C++17	100 / 100	122 ms	35896 KiB

railway

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>
typedef long long int ll; 
using namespace std;
vector<ll> adj[100005];
ll l = 20; 
ll dp[100005][20]; 
vector<ll> dep(100005); 
ll timer = 0;
vector<ll> tin(100005), tout(100005);
bool comp(ll u, ll v){
    return tin[u] < tin[v]; 
}
void precomp(ll v, ll par){
    dep[v] = dep[par] + 1; 
    dp[v][0] = par;
    for(ll i=1;i<l;i++)
        dp[v][i] = dp[dp[v][i - 1]][i - 1]; 
    tin[v] = ++timer; 
    for(auto u : adj[v])
        if(u != par)
            precomp(u, v); 
    tout[v] = ++timer; 
} 
ll is_ancs(ll u, ll v){
    return tin[u] <= tin[v] && tout[u] >= tout[v];  
}
ll find_LCA(ll u, ll v){
    if(is_ancs(u, v))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 15 / 15
• Subtask 3: 7 / 7
• Subtask 4: 29 / 29
• Subtask 5: 16 / 16
• Subtask 6: 25 / 25