# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432732 | Hazem | Stations (IOI20_stations) | C++14 | 971 ms | 856 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;
const int N = 2e3;
int cnt = 0;
int dfs(int i,int pre,vector<int> &ret,vector<int> adj[]){
int mx = cnt;
ret[i] = cnt++;
for(int j=0;j<adj[i].size();j++){
int v = adj[i][j];
if(v==pre)continue;
mx = max(mx,dfs(v,i,ret,adj));
}
ret[i] |= mx<<10;
return mx;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<int>adj[N];
for(int i=0;i<n-1;i++){
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(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... |