# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
366146 | 79brue | Stations (IOI20_stations) | C++14 | 1067 ms | 1244 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 <bits/stdc++.h>
#include "stations.h"
using namespace std;
typedef long long ll;
vector<int> link[1002];
bool visited[1002];
int arr[1002];
int sz[1002];
void szd(int x, int par=-1){
sz[x] = 1;
for(auto y: link[x]){
if(y == par) continue;
szd(y, x);
sz[x] += sz[y];
}
}
void dfs(int x, int l, int r, bool chk){
visited[x] = 1;
if(chk) arr[x] = l++;
else arr[x] = r--;
for(auto y: link[x]){
if(visited[y]) continue;
if(chk){
dfs(y, r-sz[y]+1, r, !chk);
r -= sz[y];
# | 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... |