Pagini recente » Cod sursa (job #1121283) | Cod sursa (job #1373225) | Cod sursa (job #198543) | Cod sursa (job #2010794) | Cod sursa (job #2328469)
#include<fstream>
#include<vector>
#include<stack>
#define pb push_back
#define x first
#define y second
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
const int DN=1e5+5,DM=5e5+5;
int n,m,f,g,nod,z[DN],viz[DM];
stack<int>stk;
vector<pair<int,int> >v[DN];
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>f>>g;
v[f].pb({g,i});
v[g].pb({f,i});
}
for(int i=1;i<=n;i++)
if(v[i].size()%2)
{
fout<<-1;
return 0;
}
stk.push(1);
while(!stk.empty())
{
nod=stk.top();
//cout<<nod<<' ';
while(z[nod]<v[nod].size())
{
if(viz[v[nod][z[nod]].y])
{
z[nod]++;
continue;
}
viz[v[nod][z[nod]].y]=1;
stk.push(v[nod][z[nod]].x);
//z[nod]++;
break;
}
if(z[nod]==v[nod].size())
{
stk.pop();
if(!stk.empty())
fout<<nod<<' ';
}
}
}