# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
416831 | Dilshod_Imomov | Stations (IOI20_stations) | C++17 | 1087 ms | 55824 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 MAXN = 1e3 + 7;
vector < int > tin, tout, d;
void dfs( vector<vector<int>> adj, int v, int p, int h, int &cnt ) {
tin[v] = cnt++;
d[v] = h;
for ( auto u: adj[v] ) {
if ( u != p ) {
dfs( adj, u, v, h + 1, cnt );
}
}
tout[v] = cnt++;
}
vector<int> label(int n, int k, vector<int> U, vector<int> V) {
vector < vector < int > > adj(n + 1);
tin.resize( n + 1 );
tout.resize( n + 1 );
d.resize( n + 1 );
for ( int i = 0; i < n - 1; i++ ) {
int u = U[i], v = V[i];
adj[u].push_back(v);
adj[v].push_back(u);
}
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... |