# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307407 | arthur_nascimento | Stations (IOI20_stations) | C++14 | 1081 ms | 1284 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 pb push_back
#define debug
#define maxn 2020
int ini[maxn];
int fim[maxn];
int mrk[maxn];
int h[maxn];
vector<int> L[maxn];
int cur = 0;
void dfs(int x){
debug("dfs %d\n",x);
ini[x] = cur++;
for(int i : L[x])
if(ini[i] == 0 && i > 0){
h[i] = 1 + h[x];
dfs(i);
}
fim[x] = cur++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
cur = 0;
for(int i=0;i<2*n;i++)
L[i].clear(), h[i] = ini[i] = fim[i] = 0, mrk[i] = 0;
for(int i=0;i<n-1;i++){
L[u[i]].pb(v[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... |