# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174815 | khanhphucscratch | Stations (IOI20_stations) | C++20 | 303 ms | 544 KiB |
#include "stations.h"
#include<bits/stdc++.h>
using namespace std;
//Subtask 2
vector<int> ad[1005];
int ans[1005];
bool visited[1005];
void dfs(int u)
{
visited[u] = 1;
for(int i = 0; i < ad[u].size(); i++){
ans[ad[u][i]] = ans[u] * 7 + 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++){
if(a[i] > b[i]) swap(a[i], b[i]);
ad[a[i]].push_back(b[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)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |