# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307695 | CodePlatina | Stations (IOI20_stations) | C++14 | 974 ms | 1268 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> gph[1010];
int ord[1010];
int cnt = 0;
void dfs(int x, int p, bool flag)
{
if(flag) ord[x] = ++cnt;
for(auto y : gph[x]) if(y != p) dfs(y, x, !flag);
if(!flag) ord[x] = ++cnt;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
vector<int> labels(n);
for(int i = 0; i < n; ++i) ord[i] = 0, vector<int>().swap(gph[i]);
cnt = 0;
for(int i = 0; i < n - 1; ++i)
{
gph[u[i]].push_back(v[i]);
gph[v[i]].push_back(u[i]);
}
dfs(0, 0, false);
for(int i = 0; i < n; ++i) labels[i] = ord[i];
return labels;
}
# | 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... |