Submission #1535273

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <climits>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

#define INF INT_MAX/3
#define REP(i,n) for(int i=0;i<n;i++)

int main(){
	
	int N,M;
	
	vector<vector<int>> nodes;

	

	cin>>N>>M;
	
	nodes.resize(N);
	
	REP(i,M){
		int  a,b;
		cin>>a>>b;
		
		nodes[a-1].push_back(b-1);
		nodes[b-1].push_back(a-1);
	}
	
	vector<int> path;
	path.push_back(0);
	int opposite = nodes[0][0];
	while(path.size() < N){
			
		path.push_back(opposite);
		if(nodes[opposite].size() == 1)break;
	
		int i = 0;
		int next_node = -1;	
		while(i < nodes[opposite].size()){
			
			if(find(path.begin(),path.end(),nodes[opposite][i]) == path.end()){
				next_node = nodes[opposite][i];
				break;
			}
			i++;
		}
		if(next_node == -1)break;
		
		opposite = next_node;
	}

	cout<<path.size()<<endl;

	for(int i = 0; i < path.size()-1; i++)cout<<path[i] + 1<<" ";
	cout<<path[path.size()-1] + 1<<endl;

	return 0;
}

Submission Info

Judge Result