# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
219872 | DanerZein | 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 "split.h"
#include <bits/stdc++.h>
typedef vector<int> vi;
using namespace std;
int vis[100010];
vi pa;
void dfs(int u,int c){
pa.push_back(u);
if(pa.size()==c) return;
vis[u]=1;
for(int i=0;i<G[u].size();i++){
if(G[u][i]==0){
dfs(G[u][i],c);
}
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
vector<vi> G;
G.resize(n);
vi aux;
for(int i=0;i<p.size();i++){
int u,v;
u=p[i];
v=q[i];
G[v].push_back(u);
G[u].push_back(v);
}
vector<int> r;
r.resize(n);
dfs(0,aux[1]);
int k=0;
for(int i=0;i<n;i++){
if(pa[k]==i){
r[i]=2;
k++;
}
}
pa.clear();
for(int i=0;i<n;i++){
if(vis[i]==0){
dfs(i,aux[0]);
if(ca<a){
ca=0;
pa.clear();
}
else{
break;
}
}
}
if(pa.empty()){
for(int i=0;i<n;i++){
r[i]=0;
}
}
else{
k=0;
for(int i=0;i<n;i++){
if(pa[k]==i){
r[i]=1;
k++;
}
else{
r[i]=3;
}
}
}
return r;
}