Pagini recente » Cod sursa (job #3254205) | Cod sursa (job #2607460) | Cod sursa (job #1270194) | Cod sursa (job #1700062) | Cod sursa (job #2163184)
#include <iostream>
#include <vector>
#include <stack>
#include <fstream>
using namespace std;
vector<int> v[100005];
int viz[500005];
int main()
{
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int n,m,i,x,y;
f>>n>>m;
for (i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
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())
{
y=v[x].back();
v[x].pop_back();
for (i=0;i<v[y].size();i++)
{
if (v[y][i]==x)
{
v[y].erase(v[y].begin()+i);
i=v[y].size();
}
}
stiva.push(y);
}
else
{
stiva.pop();
sol.push_back(x);
}
}
for (i=0;i<sol.size()-1;i++)
g<<sol[i]<<" ";
return 0;
}