# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
297887 | juggernaut | Split the Attractions (IOI19_split) | 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>
#include"split.h"
using namespace std;
vector<int>g[100005];
int ans[100005];
int fir(int v,int p){
for(int to:g[v])if(to!=p)return fir(to,v);
return v;
}
vector<int>find_split(int n,int a,int b,int c,vector<int>p1,vector<int>p2){
int root=0;
for(int i=0;i<p1.size();i++){
g[p1[i]].push_back(p2[i]);
g[p2[i]].push_back(p1[i]);
}
if(i!=n)root=fir(root,-1);
while(a--){
ans[root]=1;
for(int to:g[v])if(!ans[to])root=to;
}
while(b--){
ans[root]=2;
for(int to:g[v])if(!ans[to])root=to;
}
while(c--){
ans[root]=3;
for(int to:g[v])if(!ans[to])root=to;
}
vector<int>res;
for(int i=0;i<n;i++)res.push_back(ans[i]);
return res;
}