# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985414 | sopaconk | Stations (IOI20_stations) | C++17 | 593 ms | 1484 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 <vector>
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
void dfs(int n, int par, vector<int> &ini, vector<int>&fin, vector<int> &prof, vector<vector<int>> &adj, int &cont, int &height){
ini[n]=cont;
prof[n]=height;
height++;
for(int x: adj[n]){
if(x==par) continue;
cont++;
dfs(x, n, ini, fin, prof, adj, cont, height);
}
height--;
cont++;
fin[n]=cont;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> ans (n);
vector<int> ini (n);
vector<int> fin (n);
vector<int> prof (n);
int cont=0;
vector<vector<int>> adj (n);
for(int i=0; i<n-1; ++i){
adj[u[i]].pb(v[i]);
adj[v[i]].pb(u[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... |