# CF405E 挺好的爆搜题

http://codeforces.com/problemset/problem/405/E

E. Graph Cutting
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Little Chris is participating in a graph cutting contest. He's a pro. The time has come to test his skills to the fullest.

Chris is given a simple undirected connected graph with n vertices (numbered from 1 to n) and m edges. The problem is to cut it into edge-distinct paths of length 2. Formally, Chris has to partition all edges of the graph into pairs in such a way that the edges in a single pair are adjacent and each edge must be contained in exactly one pair.

For example, the figure shows a way Chris can cut a graph. The first sample test contains the description of this graph.

You are given a chance to compete with Chris. Find a way to cut the given graph or determine that it is impossible!

Input

The first line of input contains two space-separated integers n and m (1 ≤ n, m ≤ 105), the number of vertices and the number of edges in the graph. The next m lines contain the description of the graph's edges. The i-th line contains two space-separated integers ai andbi (1 ≤ ai, bi ≤ nai ≠ bi), the numbers of the vertices connected by the i-th edge. It is guaranteed that the given graph is simple (without self-loops and multi-edges) and connected.

Note: since the size of the input and output could be very large, don't use slow output techniques in your language. For example, do not use input and output streams (cin, cout) in C++.

Output

If it is possible to cut the given graph into edge-distinct paths of length 2, output  lines. In the i-th line print three space-separated integers xiyi and zi, the description of the i-th path. The graph should contain this path, i.e., the graph should contain edges (xi, yi)and (yi, zi). Each edge should appear in exactly one path of length 2. If there are multiple solutions, output any of them.

If it is impossible to cut the given graph, print "No solution" (without quotes).

Sample test(s)
input
8 12
1 2
2 3
3 4
4 1
1 3
2 4
3 5
3 6
5 6
6 7
6 8
7 8

output
1 2 4
1 3 2
1 4 3
5 3 6
5 6 8
6 7 8
input
3 3
1 2
2 3
3 1

output
No solution

input
3 2
1 2
2 3

output
1 2 3
/**
CF405E 爆搜

*/
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
const int maxn=100005;

int n,m,mk[maxn];

void init()
{
memset(mk,0,sizeof(mk));
ip=0;
}

struct note
{
int v,next;
}edge[maxn*2];

void addedge(int u,int v)
{
}

bool dfs(int u,int pre)
{
mk[u]=1;
int vs[2],cnt=0;
{
int v=edge[i].v;
if(mk[v]==0)
{
if(!dfs(v,u))
vs[cnt++]=v;
}
else if(mk[v]==1&&v!=pre)
{
vs[cnt++]=v;
}
if(cnt==2)
{
cnt=0;
printf("%d %d %d\n",vs[0],u,vs[1]);
}
}
mk[u]=2;
if(cnt)
{
printf("%d %d %d\n",vs[0],u,pre);
return true;
}
return false;
}

int main()
{
while(~scanf("%d%d",&n,&m))
{
init();
for(int i=0;i<m;i++)
{
int u,v;
scanf("%d%d",&u,&v);
}
if(m&1)printf("No solution\n");
else dfs(1,-1);
}
return 0;
}


• 本文已收录于以下专栏：

## CF#405 C. Bear and Different Names （思维题）

C. Bear and Different Names time limit per test 1 second memory limit per test 256 megabytes i...

## CF Educational Codeforces Round 6 E题 dfs+线段树

E. New Year Tree time limit per test3 seconds memory limit per test256 megabytes inputstandard in...

## CF 459E && 市赛I题

E. Pashmak and Graph time limit per test 1 second memory limit per test 256 megabytes inp...
• hero_ds
• 2015年05月03日 11:05
• 323

## cf（405A,B,C，D）

A. Gravity Flip time limit per test 1 second memory limit per test 256 megabytes input standar...

## CF 314A(Sereja and Contest-这题题目索性没看懂,E文是硬伤)

C. Sereja and Contest time limit per test 2 seconds memory limit per test 256 megabytes ...

## CF 121E - Lucky Array(树状数组裸题)

• YJX_xx
• 2015年08月01日 21:35
• 477

## coderforces 405E 图论dfs

• Dan__ge
• 2016年03月16日 13:09
• 300

## codeforces 405 C. Unusual Product and E. Graph Cutting (异或规律 & 搜索）

http://codeforces.com/problemset/problem/405/C 定义square运算：第i行向量和第i列向量的乘积的和（i从1到n） 有三种操作： given a row...

举报原因： 您举报文章：CF405E 挺好的爆搜题 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)