Pagini recente » Borderou de evaluare (job #2372027) | Cod sursa (job #2371099)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("ciclueuler.in");
ofstream g ("ciclueuler.out");
const int nmax=1e5+3;
int viz[nmax],sol[5*nmax],k,n,m,x,y,grad[nmax];
vector <int> v[nmax];
void dfs(int nod)
{
while(grad[nod])
{
int urm=v[nod][0];
--grad[nod];
--grad[urm];
v[nod].erase(v[nod].begin());
v[urm].erase(find(v[urm].begin(),v[urm].end(),nod));
dfs(urm);
}
sol[++k]=nod;
}
int main()
{
ios::sync_with_stdio(false);
f>>n>>m;
for(int i=1;i<=m;++i)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
++grad[x];
++grad[y];
}
for(int i=1;i<=n;++i)
{
if(grad[i]&1)
{
g<<-1;
return 0;
}
}
dfs(1);
for(int i=1;i<=k;++i) g<<sol[i]<<' ';
return 0;
}