# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99082 | rzbt | Ball Machine (BOI13_ballmachine) | C++14 | 0 ms | 0 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>
#define pb push_back
#define mp make_pair
#define MAXN 100005
using namespace std;
int predak[MAXN][22];
vector<int> niz1[MAXN],niz[MAXN],obilazak;
int minimum[MAXN];
int koren,vreme;
int to[MAXN];
int dfs1(int t){
int m=t;
for(auto x:niz1[t])
m=min(t,dfs1(x));
minimum[t]=m;
return m;
}
voiid dfs2(int t){
for(auto x:niz1[t])
dfs2(x);
obilazak.pb(t);
vreme++;
to[t]=vreme;
}
bool comp(int a,int b){
return minimum[a]<minimum[b];
}
int main()
{
int n,q;
for(int i=1;i<=n;i++){
scanf("%d",&predak[i][0]);
else koren=i;
}
dfs1(koren);
for(int i=1;i<=n;i++){
sort(niz1[i].begin(),niz1[i].end(),comp);
}
dfs2(koren);
for(auto t:obilazak)
for(auto x:niz1[t])
niz[to[t]].pb(x);
koren=n;
return 0;
}