# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
750734 | Error42 | Stations (IOI20_stations) | C++17 | 942 ms | 920 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 <algorithm>
#include <vector>
using namespace std;
int dfs(
vector<vector<int>> const& graph,
vector<int>& label,
int const cur,
int start,
bool const left,
int const par
) {
int sz = 1;
if (left) {
label[cur] = start;
start++;
}
for (int const neigh : graph[cur]) {
if (neigh == par)
continue;
int const neigh_sz = dfs(graph, label, neigh, start, !left, cur);
sz += neigh_sz;
start += neigh_sz;
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... |