# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
838597 | ma_moutahid | Stations (IOI20_stations) | C++17 | 664 ms | 836 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 vi vector<int>
#define vii vector<vi>
#define pi pair<int,int>
int nd;
vi l;
vii g;
void dfs(int node, int parent){
nd++;
int temp=nd;
for(int child:g[node]){
if(child==parent)continue;
dfs(child,node);
}
l[node]=1000*temp +nd;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
g.clear();
g.resize(2*n);
l.resize(n);
std::vector<int> labels(n);
for(int i=0;i<n-1;i++){
g[u[i]].push_back(v[i]);
g[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... |