# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314056 | dlwocks31 | Stations (IOI20_stations) | C++17 | 994 ms | 1128 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 <bits/stdc++.h>
using namespace std;
int lbl[1000], cnt;
void dfs(int i, int p, int d, vector<vector<int>> &adj) {
if(d % 2 == 0)
lbl[i] = cnt++;
for(int a: adj[i]) {
if(a == p) continue;
dfs(a, i, d+1, adj);
}
if(d % 2 == 1)
lbl[i] = cnt++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
cnt = 0;
memset(lbl, 0, sizeof lbl);
vector<int> labels(n);
vector<vector<int>> adj(n);
for(int i=0; i<u.size(); i++) {
//printf("edge = %d, %d\n", u[i], v[i]);
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs(0, -1, 0, adj);
for(int i=0; i<n; i++) {
//printf("label %d = %d\n", i, lbl[i]);
labels[i] = lbl[i];
}
return labels;
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... |