# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373672 | Jarif_Rahman | Stations (IOI20_stations) | C++17 | 943 ms | 1340 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>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
vector<vector<int>> v;
vector<int> lb, sz;
pair<int, int> div(int x){
return make_pair(x/1000, x%1000 + 1);
}
int in = 0;
void dfs(int nd, int ss){
lb[nd] = 1000*in;
in++;
for(int x: v[nd]) if(x!=ss) dfs(x, nd);
for(int x: v[nd]) if(x!=ss) sz[nd]+=sz[x];
lb[nd]+=sz[nd]-1;
}
vector<int> label(int n, int k, vector<int> aa, vector<int> bb){
in = 0;
v.assign(n, {});
lb.assign(n, -1);
sz.assign(n, 1);
for(int i = 0; i < n-1; i++){
v[aa[i]].pb(bb[i]);
v[bb[i]].pb(aa[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... |