Submission #432116

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
432116	2021-06-17 21:12:24	SirCovidThe19th	Railway (BOI17_railway)	C++14	100 / 100	236 ms	22980 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>
using namespace std;
const int mx = 1e5+5, ml = 17;
int n, m, k, tin[mx], tout[mx], cnt = 0, up[ml][mx], depth[mx], weight[mx]; 
vector<pair<int, int>> adj[mx]; vector<int> ans;
void dfs(int node){
    tin[node] = ++cnt;
    for (int l = 1; l < ml; l++) up[l][node] = up[l-1][up[l-1][node]];
    for (pair<int, int> nxt : adj[node])
        if (nxt.first != up[0][node])
            depth[nxt.first] = depth[node]+1, up[0][nxt.first] = node, dfs(nxt.first);
    tout[node] = cnt;
}
bool isAnc(int a, int b){ 
    return tin[a] <= tin[b] and tout[a] >= tout[b]; 
}
int lca(int a, int b){
    if (isAnc(a, b)) return a; 
    if (isAnc(b, a)) return b;
    for (int l = ml-1; l >= 0; l--) 
        if (up[l][a] != 0 and !isAnc(up[l][a], b)) 
            a = up[l][a];
    return up[0][a];
}
int solve(int node){
    int ret = weight[node];
    for (pair<int, int> nxt : adj[node])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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