Submission #3026961

---

Source Code Expand

#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<math.h>
#include<numeric>
#include<cassert>
#include<random>
#include<deque>
#include<chrono>
#include<unordered_map>
#include<list>
#include<fstream>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
const ll E=1e18+7;
#define F first
#define S second
#define MK make_pair
const ll MOD=1000000007;

vector<vector<ll>> e;
vector<bool> used;

vector<ll> dfs(ll w,vector<ll> path){
    used[w]=true;
    path.push_back(w+1);
    for(int i=0;i<e[w].size();i++){
        if(!used[e[w][i]]){return dfs(e[w][i],path);}
    }
    return path;
}


int main(){
    vector<vector<ll>> e;
    vector<bool> used;
    ll n,m;
    cin>>n>>m;
    e.resize(n);
    used.resize(n);
    for(int i=0;i<m;i++){
        ll a,b;
        cin>>a>>b;
        a--; b--;
        e[a].push_back(b);
        e[b].push_back(a);
    }
    deque<ll> A;
    ll w=0;
    while(1){
        bool cont=false;
        used[w]=true;
        A.push_back(w+1);
        for(int i=0;i<e[w].size();i++){
            if(!used[e[w][i]]){w=e[w][i]; cont=true; break;}
        }
        if(!cont){break;}
    }
    w=0;
    while(1){
        bool cont=false;
        used[w]=true;
        if(w!=0){
            A.push_front(w+1);
        }
        for(int i=0;i<e[w].size();i++){
            if(!used[e[w][i]]){w=e[w][i]; cont=true; break;}
        }
        if(!cont){break;}
    }
    cout<<A.size()<<endl;
    for(int i=0;i<A.size();i++){
        cout<<A[i];
        if(i!=A.size()-1){cout<<" ";}
        else{cout<<endl;}
    }
    
    
    return 0;
}

Submission Info

Judge Result