| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 349568 | blue | 기지국 (IOI20_stations) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "stations.h"
#include <vector>
using namespace std;
vector<int> visit(1000, 0);
vector<int> edge[1000];
vector<int> L;
int dfs(int u, int a, bool flag)
{
visit[u] = 1;
if(flag == 0)
{
L[u] = a;
a++;
}
for(int v: edge[u])
{
if(visit[v]) continue;
a = dfs(v, a, !flag);
}
if(flag == 1)
{
L[u] = a;
a++;
}
return a;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
for(int i = 0; i < n-1; i++)
{
edge[u[i]].push_back(v[i]);
edge[v[i]].push_back(u[i]);
}
L = vector<int>(n, -1);
dfs(0, 0, 0);
return L;
}
