题意:有
n
个人和
思路:并查集维护集合,然后枚举每一个集合,看是否满足人数
AC 代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 100 + 10;
const int pN = 1e6;// <= 10^7
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
void add(LL &x, LL y) { x += y; x %= MOD; }
int father[50];
int Find(int p) {
int t, child = p;
while(p != father[p]) p = father[p];
while(child != p) { t = father[child]; father[child] = p; child = t; }
return p;
}
void Merge(int x, int y) {
int fx = Find(x);
int fy = Find(y);
if(fx != fy)
father[fx] = fy;
}
int root[50];
vector<int> son[50];
bool vis[50];
vector<int> match[50];
int main()
{
int n, m; cin >> n >> m;
for(int i = 1; i <= n; i++) {
father[i] = i;
}
for(int i = 0; i < m; i++) {
int a, b; cin >> a >> b;
Merge(a, b);
}
int cnt = 0;
for(int i = 1; i <= n; i++) {
if(father[i] == i) {
root[cnt++] = i;
}
}
for(int i = 0; i < cnt; i++) {
son[i].clear();
for(int j = 1; j <= n; j++) {
if(Find(j) == root[i]) {
son[i].push_back(j);
}
}
}
CLR(vis, false);
for(int i = 0; i < cnt; i++) {
match[i].clear();
if(vis[i] || son[i].size() == 3) {
vis[i] = true;
continue;
}
int left = 3 - son[i].size();
for(int j = 0; j < cnt; j++) {
if(i == j || vis[j] || son[j].size() == 3) {
vis[j] = true;
continue;
}
if(left == son[j].size()) {
vis[j] = true;
left -= son[j].size();
match[i].push_back(j);
break;
}
}
if(left == 0) continue;
for(int j = 0; j < cnt; j++) {
if(i == j || vis[j] || son[j].size() == 3) {
vis[j] = true;
continue;
}
if(left >= son[j].size()) {
vis[j] = true;
left -= son[j].size();
match[i].push_back(j);
}
}
if(left) {
cout << -1 << endl;
return 0;
}
}
CLR(vis, false);
for(int i = 0; i < cnt; i++) {
if(vis[i]) continue;
cout << son[i][0];
for(int j = 1; j < son[i].size(); j++) {
cout << ' ' << son[i][j];
}
vis[i] = true;
if(son[i].size() != 3) {
for(int j = 0; j < match[i].size(); j++) {
int fp = match[i][j]; vis[fp] = true;
for(int k = 0; k < son[fp].size(); k++) {
cout << ' ' << son[fp][k];
}
}
}
cout << endl;
}
return 0;
}