# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147463 | 2019-08-29T15:27:59 Z | mosiashvililuka | Split the Attractions (IOI19_split) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> using namespace std; int z,x,d,e,ka[10],zx; vector <int> pas,v[100009]; bool bo[100009]; void dfs(int w){ if(ka[zx]==0) return; bo[w]=1; pas[w]=zx; ka[zx]--; if(ka[zx]==0) return; for(vector <int>::iterator it=v[w].begin(); it!=v[w].end(); it++){ if(bo[(*it)]==1) continue; dfs((*it)); if(ka[zx]==0) return; } } vector <int> find_split(int n, int a, int b, int c, vector <int> p, vector <int> q){ pas.resize(n); ka[1]=a; ka[2]=b; ka[3]=c; zx=0; m=p.size(); for(int h=0; h<m; h++){ v[p[h]].push_back(q[h]); v[q[h]].push_back(p[h]); } for(int h=1; h<=a; h++){ if(bo[h]==0){ zx++; dfs(h); } } return pas; }