# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
312006 | htc001 | Stations (IOI20_stations) | C++14 | 1085 ms | 1140 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<bits/stdc++.h>
#include "stations.h"
using namespace std;
const int N=1005;
int tme;
vector<int> lab;
vector<int> nei[N];
void dfs(int x,int p,int lv){
if(lv) lab[x-1]=tme++;
for(int i=0;i<int(nei[x].size());i++){
int to=nei[x][i];
if(to!=p) dfs(to,x,lv^1);
}
if(!lv) lab[x-1]=tme++;
}
vector<int> label(int n,int k,vector<int> u,vector<int> v){
lab.clear();
lab.resize(n);
tme=0;
for(int i=0;i<N;i++) nei[i].clear();
for(int i=0;i<n-1;i++){
u[i]++;v[i]++;
// printf("%d %d\n",u[i],v[i]);
nei[u[i]].push_back(v[i]);
nei[v[i]].push_back(u[i]);
}
dfs(1,-1,0);
# | 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... |