Submission #361271

---

Source Code Expand

#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>
#include<functional>

using namespace std;

#define reE(i,a,b) for(auto (i)=(a);(i)<=(b);(i)++)
#define rE(i,b) reE(i,0,b)
#define reT(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rT(i,b) reT(i,0,b)
#define rep(i,a,b) reE(i,a,b);
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define itr(i,b) for(auto (i)=(b).begin();(i)!=(b).end();++(i))
#define rti(i,b) for(auto (i)=(b).rbegin();(i)!=(b).rend();++(i))
#define LL long long
#define all(b) (b).begin(),(b).end()

#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line  getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num

#define dir(xx,yy,x,y,i) (xx)=(x)+dir[(i)],(yy)=(y)+dir[(i)+1]

typedef complex<double> P;
typedef vector<P> Poly;

const LL INF = 1 << 30;
const double eps = 1e-8;
const int dir[] = { 0, 1, 0, -1, 0 };
int N,a,b;
vector<vector<int>> adj;
vector<bool> used;
list<int> ans;

void dyjkstra(){
	used.resize(N);
	rT(i, N)used[i] = true;
	used[0] = false;
	priority_queue<int,vector<int>,greater<int> > que;
	que.push(0);
	while (que.empty() == false){
		int v = que.top(); que.pop();

		ans.push_back(v);
		itr(i, adj[v]){
			if (used[*i]){
				used[*i] = false;
				que.push(*i);
			}
		}
	}
}

int main(void){
	cin >> N;
	adj.resize(N);
	reT(i, 1, N){
		cin >> a >> b; a--; b--;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	dyjkstra();
	itr(i, ans){
		if (i != ans.begin())cout << " ";
		cout << (*i) + 1;
	}
	cout << endl;
	return(0);
}

Submission Info

Judge Result