# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
396075 | InternetPerson10 | Stations (IOI20_stations) | C++17 | 0 ms | 0 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector<vector<int>> adj;
vector<int> sub;
vector<int> labels;
int sub_calc(int v, int par) {
int ans = 1;
for(int i = 0; i < (int)adj[v].size(); i++) {
if(adj[v][i] == par) continue;
ans += sub_calc(adj[v][i], v);
}
// cout << v << ' ' << ans << '\n';
sub[v] = ans;
return sub[v];
}
void rec(int v, int l, int u, int par, int d) { // even: min, odd: max
if(d%2) {
labels[v] = u-1;
u--;
}
else {
labels[v] = l;
l++;