# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546713 | cig32 | Stations (IOI20_stations) | C++17 | 806 ms | 792 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 <cstdio>
#include <cassert>
#include <map>
#include <vector>
#include <algorithm>
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v);
int find_next_station(int s, int t, std::vector<int> c);
std::vector<int> adj[1024];
int ans[1024];
int sz[1024];
void dfs(int node, int prv, int l, int r, int dep) {
if(dep & 1) {
ans[node] = r;
r--;
}
else {
ans[node] = l;
l++;
}
for(int x: adj[node]) {
if(x != prv) {
dfs(x, node, l, l + sz[x] - 1, dep + 1);
l += sz[x];
}
}
}
void fuck(int node, int prv) {
sz[node] = 1;
for(int x: adj[node]) {
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... |