# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
962922 | biximo | Stations (IOI20_stations) | C++17 | 685 ms | 1660 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;
#define N 1005
vector<int> adj[N];
int n, ids[N], sz[N], id;
void dfs(int c, int pr) {
ids[c] = id++;
sz[c] = 1;
for(int i: adj[c]) {
if(i == pr) continue;
dfs(i, c);
sz[c] += sz[i];
}
}
vector<int> euler_tree() {
id = 0;
dfs(0, -1);
vector<int> ans(n);
for(int i = 0; i < n; i ++) {
sz[i] --;
ans[i] = sz[i]*1000+ids[i];
}
return ans;
}
vector<int> nddds;
void DFS(int c, int pr) {
nddds.push_back(c);
for(int i: adj[c]) {
if(i == pr) continue;
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... |