Submission #1174822

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1174822	2025-03-27 11:52:13	khanhphucscratch	Stations (IOI20_stations)	C++20	10 / 100	300 ms	560 KiB

stations

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 "stations.h"
#include<bits/stdc++.h>
using namespace std;
//Subtask 2
vector<int> ad[1005];
int ans[1005], base = 8;
bool visited[1005];
void dfs(int u)
{
    visited[u] = 1;
    for(int i = 0; i < ad[u].size(); i++) if(visited[ad[u][i]] == 0){
        ans[ad[u][i]] = ans[u] * base + i;
        dfs(ad[u][i]);
    }
}
vector<int> label(int n, int k, vector<int> a, vector<int> b)
{
    for(int i = 0; i < n; i++){
        ad[i].clear(); visited[i] = 0;
    }
    for(int i = 0; i < n-1; i++){
        ad[a[i]].push_back(b[i]);
        ad[b[i]].push_back(a[i]);
    }
    ans[0] = 1; dfs(0);
    vector<int> an(n);
    for(int i = 0; i < n; i++) an[i] = ans[i];
    return an;
}
int lca(int u, int v)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 16
• Subtask 4: 10 / 10
• Subtask 5: 0 / 61