Submission #1241983

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>

#define rep(i,n) for(int i=0; i<(n); i++)
#define reps(i,x,n) for(int i=x; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define all(X) (X).begin(),(X).end()
#define X first
#define Y second
#define pb push_back
#define eb emplace_back

using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

template<class A, size_t N, class T> void Fill(A (&a)[N], const T &v){ fill( (T*)a, (T*)(a+N), v ); }

const ll INF = 0x3fffffff;

int N, M;
vector<int> v[100005], ans;
bool f[100005] = {};

void dfs(int n){
	ans.push_back(n);
	f[n] = true;
	for(auto t: v[n]) if( !f[t] ){
		dfs(t);
		break;
	}
}

int main(){
	//ios_base::sync_with_stdio(0);

	cin >> N >> M;
	rep(i,M){
		int A, B;
		cin >> A >> B;
		//A--; B--;
		v[A].push_back(B);
		v[B].push_back(A);
	}

	int n = 1;
	while(1){
		Fill(f, false);
		ans.clear();
		dfs(n);
		reverse( all(ans) );
		ans.pop_back();
		dfs(n);
		bool check = true;
		for(auto t: v[ans.back()]) if(t == ans[0]) check = false;
		if( check ) break;
		n++;
	}

	cout << ans.size() << endl;
	for(auto a: ans){
		cout << a;
		if(ans.back() != a) cout << " ";
	}
	cout << endl;

	return 0;
}

Submission Info

Judge Result