Codeforces Round #181 (Div. 2) B. Coach

#include<stdio.h>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
int n,m,a,b;
int p[50];
int find(int i)
{
    if(p[i]!=i)
    return p[i]=find(p[i]);
    return i;
}
void mege(int a,int b)
{
    a=find(a);
    b=find(b);
    p[a]=b;
}


vector<int>zero,one,two,three,other,e[50];//one存父亲加儿子只有1个点的,two存父亲加儿子有两个点的,three存父亲加儿子有三个点的,other存父亲加儿子的点数>4的.
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        zero.clear();
        one.clear();
        two.clear();
        three.clear();
        other.clear();
        int i,j,k;
        for(i=0;i<50;i++)
        e[i].clear();

        for(i=1;i<=n;i++)
        {
            p[i]=i;
        }
        for(i=1;i<=m;i++)
        {
            scanf("%d%d",&a,&b);
            mege(a,b);
        }
        for(i=1;i<=n;i++)
        {
            int c=find(i);
            e[c].push_back(i);
        }
        for(i=1;i<=n;i++)
        {
            if(e[i].size()==0)
            zero.push_back(i);
            if(e[i].size()==1)
            one.push_back(i);
            else if(e[i].size()==2)
            two.push_back(i);
            else if(e[i].size()==3)
            three.push_back(i);
            else if(e[i].size()>3)
            other.push_back(i);
        }

      /*  for(i=1;i<=n;i++)
        {
            printf("%d ",e[i].size());
        }
        printf("  zhj\n");*/
        //显然输出-1的情况是:有树的点数>3,而且显然一个two要对应一个one,并且two必须少于one,而且one要比two多3的倍数
        if(other.size()!=0||(two.size()!=0&&(one.size()-two.size())%3!=0))
        {
            printf("-1\n");
        }
        else
        {
            //先输出three的
            for(i=0;i<three.size();i++)
            {
                printf("%d %d %d\n",e[three[i]][0],e[three[i]][1],e[three[i]][2]);
            }
            int o=0,tw=0;
            //再按一个one对应一个two输出
            while(o<one.size()&&tw<two.size())
            {
                printf("%d %d %d\n",e[one[o]][0],e[two[tw]][0],e[two[tw]][1]);
                o++;
                tw++;
            }
            //再按三个one一组
            while(o<one.size())
            {
                printf("%d %d %d\n",e[one[o++]][0],e[one[o++]][0],e[one[o++]][0]);
            }
        }
    }
    return 0;
}