###### B. Coach

time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A programming coach has n students to teach. We know that n is divisible by 3. Let's assume that all students are numbered from 1 ton, inclusive.

Before the university programming championship the coach wants to split all students into groups of three. For some pairs of students we know that they want to be on the same team. Besides, if the i-th student wants to be on the same team with the j-th one, then the j-th student wants to be on the same team with the i-th one. The coach wants the teams to show good results, so he wants the following condition to hold: if the i-th student wants to be on the same team with the j-th, then the i-th and the j-th students must be on the same team. Also, it is obvious that each student must be on exactly one team.

Help the coach and divide the teams the way he wants.

Input

The first line of the input contains integers n and m (3 ≤ n ≤ 48. Then follow m lines, each contains a pair of integers ai, bi (1 ≤ ai < bi ≤ n) — the pair ai, bi means that students with numbers ai and bi want to be on the same team.

It is guaranteed that n is divisible by 3. It is guaranteed that each pair ai, bi occurs in the input at most once.

Output

If the required division into teams doesn't exist, print number -1. Otherwise, print  lines. In each line print three integers xiyizi (1 ≤ xi, yi, zi ≤ n) — the i-th team.

If there are multiple answers, you are allowed to print any of them.

Sample test(s)
input
3 0

output
3 2 1

input
6 4
1 2
2 3
3 4
5 6

output
-1

input
3 3
1 2
2 3
1 3

output
3 2 1

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
int n,m;
int gp[50][50];//gp[i][j]表示j与i可以分一组
int cnt[50];//cnt[i]表示与i一组的人数
int vis[50];
int set[50];
queue<int>que[4];
int find(int x)
{
if(set[x] != x)
set[x] = find(set[x]);
return set[x];
}

int main()
{
scanf("%d %d",&n,&m);
int t,flag;
for(int i = 1; i <= n; i++)
set[i] = i;
int u,v;
for(int i = 1; i <= m; i++)
{
scanf("%d %d",&u,&v);
int uu = find(u);
int vv = find(v);
if(uu != vv)
set[uu] = vv;
}
for(int i = 1; i <= n; i++)
{
cnt[i] = 0;
t = find(i);
for(int j = 1; j <= n; j++)
{
if(t == find(j))
{
gp[i][cnt[i]++] = j;
}
}
}//并查集，将所有可能分一组的存起来

memset(vis,0,sizeof(vis));
flag = 1;
for(int i = 1; i <= n; i++)
{
if(cnt[i] > 3)//如果与i一组的人数大于3，不合法
{
flag = 0;
continue;
}
if(vis[gp[i][0]]) continue;

else if(cnt[i] == 1)
que[1].push(i);
else if(cnt[i] == 2)
que[2].push(i);
else if(cnt[i] == 3)
que[3].push(i);

vis[gp[i][0]] = 1;
}
if(que[1].size() < que[2].size() || (que[1].size()-que[2].size())%3 !=0)
flag = 0;

if(flag)
{
while(que[2].size() > 0)
{
int sec = que[2].front();
que[2].pop();
printf("%d %d ",gp[sec][0],gp[sec][1]);

int fir = que[1].front();
que[1].pop();
printf("%d\n",gp[fir][0]);
}

while(que[1].size() > 0)
{
int fir = que[1].front();
que[1].pop();
printf("%d ",gp[fir][0]);

fir = que[1].front();
que[1].pop();
printf("%d ",gp[fir][0]);

fir = que[1].front();
que[1].pop();
printf("%d\n",gp[fir][0]);
}

while(que[3].size() > 0)
{
int thi= que[3].front();
que[3].pop();
printf("%d %d %d\n",gp[thi][0],gp[thi][1],gp[thi][2]);
}
}
else printf("-1\n");

return 0;
}

#### Codeforces Round #181 (Div. 2) B. Coach 带权并查集

2017-03-04 09:55:21

#### Codeforces Round #364 div.2 C. They Are Everywhere 【尺追法】

2016-07-23 11:33:07

#### ScrumAlliance对Agile Coach的能力定义了五个部分

2017-01-17 19:19:45

#### 做好Coach(教练)角色

2004-10-10 16:58:00

#### Longman Exams Coach 破解版

2015年03月29日 565.71MB 下载

#### 详解Nervana最新开源深度强化学习库Coach，支持DQN、DDQN等十多种算法｜附开源代码

2017-10-23 00:00:00

#### ZOJ Talented Chef

2014-04-12 19:27:53

#### Fibonacci Tree 4786

2015-08-13 11:30:20

#### HDU-4786 Fibonacci Tree（最小生成树[Kruskal]）

2015-08-20 13:33:17

#### coach spec

2013年01月15日 358KB 下载

B. Coach