Pagini recente » Cod sursa (job #1366062) | Cod sursa (job #619361) | Cod sursa (job #1898471) | Cod sursa (job #2813955) | Cod sursa (job #833815)
Cod sursa(job #833815)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
const int Nmax=100100, Mmax=500500;
int n,m,X[Mmax], Y[Mmax],sol[Mmax], nr;
bool viz[Mmax];
vector <int> G[Nmax];
inline void citire(){
f>>n>>m;
for(int i=1; i<=m; ++i)
{f>>X[i]>>Y[i];
G[X[i]].push_back(i);
G[Y[i]].push_back(i);
}
}
inline bool Eulerian(){
for(int i=1; i<=n; ++i)
if(G[i].size()%2) return false;
else return true;
}
inline void Euler(int nod){
vector<int>::iterator it=G[nod].begin(), st=G[nod].end();
for(; it!=st; ++it)
if(!viz[*it])
{viz[*it]=true;
Euler(X[*it]+Y[*it]-nod);
sol[++nr]=nod;
}
}
int main(){
citire();
if(Eulerian()){
Euler(1);
for(int i=1;i<=nr; ++i)
g<<sol[i]<<' ';
g<<'\n';
}
else g<<"-1\n";
return 0;
}