B. Coach

原创 2013年12月03日 18:42:26

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 

解题说明:本题的意思是教练培训n个同学(n%3 = 0),要给他们分组,每3个人一组,要分n/3组,输入的m行中的x、y代表x想和y分一组,教练会根据他们的请求将他们分为一组,若最后分组不成功输出-1,否则一一输出各组同学的序号。

参考http://www.cnblogs.com/LK1994/p/3427099.html :先套并查集模板将可以分成一组的以邻接表的形式存起来,然后再判断,如果与i一组的人数大于3,说明分组不成功

#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;
}


版权声明: 举报

相关文章推荐

Sicily 1570. Hopeless Coach

1570. Hopeless Coach Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description O...

" Lakers coach said

Joe Caliro was second inside the for coach Mike Grogan's crew and Peter Anania placec second inside ...

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

Sicily 1570 Hopeless Coach

给定接下来的轮次以及最低获得的积分,否则教练就会下课。刚开始推了很久的公式,觉得加起来项数好多,好烦。后来突然想到直接就是一个dp问题,按照上次的积分扫就可以,最后输出N轮时得分大于P分的总和概率即可...

coach outlet stores-403

Wahlburgers sues ex - organization boss pertaining to 'improper conduct' Building a eating place ...

Coach CodeForces - 300B

A programming coach has n students to teach. We know that n is divisible by 3. Let's assume that all...

coach outlet usa-513100

My personal Early morning Jacket's 'Z' Within nov 2006,coach outlet usa, my personal mother nearl...

美国真便宜网,coach,美国代购网,coach factory

http://www.eipay.com 日本代购 http://zairiben.taobao.com/ 美国真便宜网,coach,美国代购网,coach factory 文章正文plu...

a pair of

COACH was first established, CO managed by six from the leather family master cobbler, leather produ...

cheap coach bags THwnN jcHI x164

This beautiful sentences picturesque West Lake Longjing tea called wonderful pictures. Set mountains...

a pair of

COACH was first established, CO managed by six from the leather family master cobbler, leather produ...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)