Pagini recente » Cod sursa (job #1958619) | Cod sursa (job #2163357) | Cod sursa (job #247519) | Cod sursa (job #2034663) | Cod sursa (job #2163210)
#include <bits/stdc++.h>
using namespace std;
vector< pair<int,int> > v[100005];
int viz[500005];
int main()
{
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int n,m,i,x,y,ok=1;
f>>n>>m;
for (i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(make_pair(y,i));
v[y].push_back(make_pair(x,i));
}
for (i=1;i<=n;i++)
{
if (v[i].size() & 1)
{
g<<-1;
return 0;
}
}
stack<int> stiva;
vector<int> sol;
stiva.push(1);
while (!stiva.empty())
{
x=stiva.top();
if (!v[x].empty())
{
auto y=v[x].back();
v[x].pop_back();
if (viz[y.second]==0)
{
viz[y.second]=1;
stiva.push(y.first);
}
}
else
{
stiva.pop();
sol.push_back(x);
}
}
for (i=0;i<sol.size()-1;i++)
g<<sol[i]<<" ";
return 0;
}