# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
938227 | LittleOrange | Unique Cities (JOI19_ho_t5) | C++17 | 2045 ms | 42604 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<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(0);cin.tie(0);
ll n,m;
cin >> n >> m;
vector<vector<ll>> con(n);
vector<ll> c(n);
for(ll i = 1;i<n;i++){
ll u,v;
cin >> u >> v;
con[u-1].push_back(v-1);
con[v-1].push_back(u-1);
}
for(ll &i : c) cin >> i;
vector<ll> d(n,0),p(n,0);
{
function<void(ll)> dfs;
dfs = [&](ll i){
for(ll j : con[i]) if(j!=p[i]){
p[j] = i;
d[j] = d[i]+1;
dfs(j);
}
};
dfs(0);
}
vector<vector<ll>> pp(20,vector<ll>(n));
pp[0] = p;
# | 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... |