# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
623333 | M_W | Stations (IOI20_stations) | C++17 | 903 ms | 836 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;
int _labels[1010];
vector<int> adj[1010];
int N, K, timer = 0;
void dfs(int a, int p, int lv){
if(!lv) _labels[a] = timer++;
for(auto x : adj[a]){
if(x == p) continue;
dfs(x, a, 1 - lv);
}
if(lv) _labels[a] = timer++;
}
vector<int> label(int _N, int _K, vector<int> U, vector<int> V) {
N = _N; K = _K; timer = 0;
for(int i = 0; i < N - 1; i++){
adj[U[i]].push_back(V[i]);
adj[V[i]].push_back(U[i]);
}
dfs(0, 0, 0);
vector<int> res;
for(int i = 0; i < N; i++) res.push_back(_labels[i]);
for(int i = 0; i < N; i++) adj[i].clear();
return res;
}
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... |