# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433525 | JUANDI321 | Split the Attractions (IOI19_split) | C++17 | 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 <vector>
using namespace std;
vector<vector<int>> g;
vector<int> res;
int aa, bb, cc;
void dfs(int node, int ant)
{
if(a>0)
{
res[node]=1;
a--;
}
else if(b>0)
{
res[node]=2;
b--;
}
else
{
res[node]=3;
c--;
}
for(int y : g[node])
{
if(y!=ant)
{
dfs(y, node);
}
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
aa = a;
bb = b;
cc = c;
//vector<int> res;
for(int i = 0; i<p.size(); i++)
{
g[p[i]].push_back(q[i]);
g[q[i]].push_back(p[i]);
}
int node =0;
for(int i = 0; i<n; i++)
{
if(g[i].size()==1)
{
node = i;
break;
}
}
dfs(node, -1);
return res;
}