Codeforces 263 D. Cycle in Graph

DFS一遍......

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 v1, v2, ..., vd such, that nodes v1 and vd are connected by an edge of the graph, also for any integer i (1 ≤ i < d) nodes vi and vi + 1 are connected by an edge of the graph.

Input

The first line contains three integers n, m, k (3 ≤ n, m ≤ 105; 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 ai,bi (1 ≤ ai, bi ≤ n; ai ≠ bi) — 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 v1, v2, ..., vr (1 ≤ vi ≤ 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 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>

using namespace std;

const int maxn=100100;

bool vis[maxn];
int deep[maxn];
int n,m,k,cnt;
vector<int> edge[maxn];
vector<int> road;

bool dfs(int u,int dep)
{
    vis[u]=true;
    deep[u]=dep;
    road.push_back(u);
    for(int i=0,sz=edge[u].size();i<sz;i++)
    {
        int v=edge[u][i];
        if(vis[v]==true&&deep[u]-deep[v]>=k)
        {
            int id=0;
            for(int i=0;i<road.size();i++)
            {
                if(road[i]==v)
                {
                    id=i; break;
                }
            }
            printf("%d\n",road.size()-id);
            for(int i=id,sz=road.size();i<sz;i++)
            {
                printf("%d%c",road[i],(i+1==sz)?'\n':' ');
            }
            return true;
        }
        else if(vis[v]==false)
        {
            if(dfs(v,dep+1)) return true;
        }
    }
    road.pop_back();
    return false;
}

int main()
{
    scanf("%d%d%d",&n,&m,&k);
    while(m--)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        edge[a].push_back(b);
        edge[b].push_back(a);
    }
    for(int i=1;i<=n;i++)
    {
        cnt=0;
        if(vis[i]==false)
        {
            if(dfs(i,cnt)) break;
        }
    }
    return 0;
}