Submission #1174830

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1174830	2025-03-27 12:28:43	khanhphucscratch	Stations (IOI20_stations)	C++20	52.32 / 100	309 ms	568 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 1
vector<int> ad[1005];
int deg[1005], tin[1005], tout[1005], dfsc = 0;
bool visited[1005];
void dfs(int u)
{
    visited[u] = 1; tin[u] = ++dfsc;
    for(int v : ad[u]) if(visited[v] == 0){
        dfs(v);
    }
    tout[u] = dfsc;
}
vector<int> label(int n, int k, vector<int> a, vector<int> b)
{
    for(int i = 0; i < n; i++){
        deg[i] = 0; ad[i].clear(); visited[i] = 0;
    }
    for(int i = 0; i < n-1; i++){
        deg[a[i]]++; deg[b[i]]++;
        ad[a[i]].push_back(b[i]);
        ad[b[i]].push_back(a[i]);
    }
    dfsc = 0; dfs(0);
    vector<int> ans(n);
    for(int i = 0; i < n; i++) ans[i] = (tin[i]-1) * 1000 + tout[i] - 1;
    return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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