# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1256803 | rhm_gan | Split the Attractions (IOI19_split) | C++20 | 0 ms | 0 KiB |
#include "split.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
vector<int> g[N];
vector<int> res;
bool vis[N];
int A, B, C;
void dfs(int u) {
vis[u] = 1;
if (A) {
res[u] = 1;
A--;
} else if (B) {
res[u] = 2;
B--;
}
else {
res[u] = 3;
C--;
}
for (auto v : g[u]) {
if (!vis[v]) dfs(v);
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
A = a, B = b, C = c;
res.resize(n);
int m = p.size();
for (int i = 0; i < m; i++) {
g[p[i]].push_back(q[i]);
g[q[i]].push_back(p[i]);
}
int u = 0;
for (int i = 0; i < n; i++) {
if (g[i].size() == 1) {
u = i;
break;
}
}
dfs(u);
return res;
}
int main() {
int n, m, a, b, c;
assert(5 == scanf("%d%d%d%d%d", &n, &m, &a, &b, &c));
vector<int> p(m), q(m);
for (int i=0; i<m; i++)
assert(2 == scanf("%d%d", &p[i], &q[i]));
// fclose(stdin);
vector<int> result = find_split(n, a, b, c, p, q);
for (int i=0; i<(int)result.size(); i++)
printf("%s%d", ((i>0)?" ":""), result[i]);
printf("\n");
// fclose(stdout);
return 0;
}