#include "split.h" #include <bits/stdc++.h> using namespace std; const int MAXN = 200005; vector<int> con[MAXN]; vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) { vector<int> res(n, 0); for (int i = 0; i < p.size(); i++) con[p[i]].push_back(q[i]), con[q[i]].push_back(p[i]); vector<int> in; for (int i = 0; i < n; i++) if (con[i].size() == 1) in.push_back(i); if (!in.empty()) con[in[0]].push_back(in[1]), con[in[1]].push_back(in[0]); int prev = 0, curr = 0; for (int i = 0; i < n; i++) { if (a > 0) res[curr] = 1, a--; else if (b > 0) res[curr] = 2, b--; else res[curr] = 3; int temp = curr; if (con[curr][0] != prev) curr = con[curr][0]; else curr = con[curr][1]; prev = temp; } return res; }