# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
391624 | ljuba | Stations (IOI20_stations) | C++17 | 1136 ms | 1012 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 mxN = 1100;
vector<int> adj[mxN];
std::vector<int> labels;
int timer = 0;
void dfs(int s, int p, int pa) {
if(pa^1)
labels[s] = timer++;
for(auto e : adj[s]) {
if(e == p) continue;
dfs(e, s, pa^1);
}
if(pa)
labels[s] = timer++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
for(int i = 0; i < n; ++i) {
adj[i].clear();
}
timer = 0;
for(int i = 0; i < n-1; ++i) {
adj[u[i]].push_back(v[i]);
# | 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... |