Submission #1304463

---

Source Code Expand

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstdio>
#include<vector>
#include<cctype>
#include<cstdlib>
#include<cstring>
#include<utility>
#include<algorithm>
 
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define For(i,x,y) for(int i=((int)x);i<=((int)y);i++)
#define Dep(i,y,x) for(int i=((int)y);i>=((int)x);i--)
#define Rep(i,x) for (int y,i=head[x];i;i=E[i].nxt) if (!vis[y=E[i].to])
using namespace std;
 
typedef long long ll;
typedef unsigned int uint;
typedef pair<int,int> pii;
 
int rd() {
	char c=getchar_unlocked(); int t=0,f=1;
	while (!isdigit(c)) f=(c=='-')?-1:1,c=getchar_unlocked();
	while (isdigit(c)) t=t*10+c-48,c=getchar_unlocked(); return t*f;
}
void wt(int x) {
	if (x<0) putchar_unlocked('-'),wt(-x);
	else { if (x>9) wt(x/10); putchar_unlocked(x%10+48); }
}
 
const int N=300035;
 
int n,m,head[N],cnt;
struct Edge { int to,nxt; }E[N<<1];
void Link(int u,int v) {
	E[++cnt]=(Edge){v,head[u]}; head[u]=cnt;
	E[++cnt]=(Edge){u,head[v]}; head[v]=cnt;
}
 
int stk[N],top,vis[N];
 
bool dfs1(int x) {
	vis[x]=1,stk[++top]=x;
	Rep (i,x) if (dfs1(y)) return 1;
	return 1;
}
 
bool dfs2(int x) {
	vis[x]=1,stk[++top]=x;
	Rep (i,x) if (dfs2(y)) return 1;
	return 1;
}
 
int main() {
	n=rd(),m=rd();
	For (i,1,m) Link(rd(),rd());
	dfs1(1);
	reverse(stk+1,stk+top+1); top--;
	dfs2(1);
	
	printf("%d\n",top);
	while (top) printf("%d ",stk[top--]);
	
	return 0;
}

Submission Info

Judge Result