| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 430731 | JUANDI321 | Stations (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>
#include <iostream>
#include <cstring>
using namespace std;
vector<vector<int>> g(1000+10);
vector<int> l(1000 +10);
bool ch[1010];
int j = 0;
void dfs(int node);
{
if(ch[node])return;
ch[node]=true;
l[j] = node;
//cout<<node<<endl;
for(auto y : g[node])
{
if(!ch[y])
{
dfs(y);
j++;
}
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
for(int i = 0; i < n-1; i++)
{
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
int spn = 0;
for(int i = 0; i < n; i++)
{
if(g[i].size() == 1)
{
spn = i;
break;
}
}
dfs(spn);//cout<<"hola"<<endl;
for (int i = 0; i < n; i++) {
labels[l[i]] = i;
//cout<<"l[i] "<<l[i]<<" i "<<i<<endl;
}
//cout<<"-----------"<<endl;
memset(ch, false, sizeof(ch));
for(int i=0; i<n; i++) g[i].clear();
return labels;
}