# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305648 | jovan_b | Stations (IOI20_stations) | C++17 | 1161 ms | 6008 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;
vector <int> graf[100005];
vector <int> labels;
int in[100005];
int out[100005];
int tajm;
void dfs(int v, int depth, int par){
in[v] = ++tajm;
for(auto c : graf[v]){
if(c != par){
dfs(c, depth+1, v);
}
}
out[v] = ++tajm;
if(depth%2){
labels[v] = out[v];
}
else labels[v] = in[v];
}
map <int, int> koji;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
labels.clear();
# | 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... |