Cycle in Graph (coder)

找到一个大于K的没有重复的圈。

思路：用的是深搜，一开始我就只是单纯的试着从1开始。但是wrong了，这样很快想到了反例，

   就是把每一个点作为起始点开始搜就可以了，直到搜到满足要求的序列。用pre来记录其排序。

#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<ctype.h>
#include<set>
#include<cstdlib>
using namespace std;


#define N 100010

int go[2*N][2];
int n;
bool ok=true;
int ans[N];
bool b[N];

int main()
{
	freopen("c:\in.txt","r",stdin);

	int i,j,k;

	cin>>n;
	k=2*n;
	
	memset(go,0,sizeof(go));
	while (k--)
	{
		scanf("%d%d",&i,&j);
		if (go[i][0])
		{
			if (go[i][1])
				ok=false;
			go[i][1]=j;
		}
		else
			go[i][0]=j;
	}

	j=1;
	i=1;
	int temp=n;
	ans[i]=j;
	while (temp--)
	{
		i++;
		//cout<<j<<' '<<go[j][0]<<' '<<go[j][1]<<' '<<go[go[j][0]][0]<<' '<<go[go[j][0]][1]<<endl;
		if (go[go[j][0]][0]==go[j][1] || go[go[j][0]][1]==go[j][1])
		{

			ans[i]=j=go[j][0];
		}
		else if (go[go[j][1]][0]==go[j][0] || go[go[j][1]][1]==go[j][0])
		{
			ans[i]=j=go[j][1];
		}
		else
			ok=false;
	}

	for (i=1;i<5;i++)
		ans[n+i]=ans[i];
	
	for (i=1;i<=n;i++)
	{
		if ( (go[ans[i]][0]==ans[i+1] && go[ans[i]][1]==ans[i+2]) || (go[ans[i]][0]==ans[i+2] && go[ans[i]][1]==ans[i+1]) )
			;
		else
			ok=false;
	}

	memset(b,false,sizeof(b));
	for (i=1;i<=n;i++)
	{
		if (b[ans[i]])
			ok=false;
		b[ans[i]]=true;
	}

	if (ok)
	{
		for (i=1;i<=n;i++)
			printf("%d ",ans[i]);
		printf("\n");
	}
	else
		printf("-1\n");

	return 0;
}

D. Cycle in Graph

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You've got a undirected graph G, consisting of n nodes. We will consider the nodes of the graph indexed by integers from 1 to n. We know that each node of graph G is connected by edges with at least k other nodes of this graph. Your task is to find in the given graph a simple cycle of length of at least k + 1.

A simple cycle of length d (d > 1) in graph G is a sequence of distinct graph nodes v₁, v₂, ..., v_d such, that nodes v₁ and v_d are connected by an edge of the graph, also for any integer i (1 ≤ i < d) nodes v_i and v_i + 1 are connected by an edge of the graph.

Input

The first line contains three integers n, m, k (3 ≤ n, m ≤ 10⁵; 2 ≤ k ≤ n - 1) — the number of the nodes of the graph, the number of the graph's edges and the lower limit on the degree of the graph node. Next m lines contain pairs of integers. The i-th line contains integers a_i, b_i (1 ≤ a_i, b_i ≤ n; a_i ≠ b_i) — the indexes of the graph nodes that are connected by the i-th edge.

It is guaranteed that the given graph doesn't contain any multiple edges or self-loops. It is guaranteed that each node of the graph is connected by the edges with at least k other nodes of the graph.

Output

In the first line print integer r (r ≥ k + 1) — the length of the found cycle. In the next line print r distinct integers v₁, v₂, ..., v_r (1 ≤ v_i ≤ n) — the found simple cycle.

It is guaranteed that the answer exists. If there are multiple correct answers, you are allowed to print any of them.

Sample test(s)

Input

3 3 2
1 2
2 3
3 1

Output

3
1 2 3 

Input

4 6 3
4 3
1 2
1 3
1 4
2 3
2 4

Output

4
3 4 1 2