# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321964 | katearima | Stations (IOI20_stations) | C++14 | 1185 ms | 56216 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 <bits/stdc++.h>
using namespace std;
const int N=1005;
vector<vector<int>> a(N);
vector<int> ans(N);
int i,n,k,m,x,j,t;
void DFS(vector<vector<int>> a, int x,int y,int d){
if(d%2==0) {ans[y]=t; t++;}
for(int i=0; i<a[y].size(); i++){
if(a[y][i]==x) continue;
DFS(a,y,a[y][i],d+1);
}
if(d%2!=0) {ans[y]=t; t++;}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> label(n);
for(i=0; i<n; i++){
a[i].clear();
ans[i]=0;
}
for(i=0; i<n-1; i++){
a[u[i]].push_back(v[i]);
a[v[i]].push_back(u[i]);
}
t=0;
DFS(a,-1,0,0);
for(i=0; i<n; i++) label[i]=ans[i];
Compilation message (stderr)
# | 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... |