# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
722536 | joelgun14 | Stations (IOI20_stations) | C++17 | 922 ms | 6016 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;
const int lim = 1e5 + 5;
int subtree[lim];
bool vis[lim];
vector<int> edges[lim];
void get_subtree(int nd) {
vis[nd] = 1;
subtree[nd] = 1;
for(auto i : edges[nd]) {
if(!vis[i]) {
get_subtree(i);
subtree[nd] += subtree[i];
}
}
//cout << nd << " " << subtree[nd] << endl;
}
vector<int> ret;
void dfs(int nd, int l, int r, bool pos) {
vis[nd] = 1;
if(!pos) {
ret[nd] = l, ++l;
}
else {
ret[nd] = r, --r;
}
//cout << nd << " " << l << " " << r << " " << ret[nd] << endl;
for(auto i : edges[nd]) {
if(!vis[i]) {
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... |