Pagini recente » Cod sursa (job #803721) | Cod sursa (job #2417056) | Cod sursa (job #1774989) | Cod sursa (job #846544) | Cod sursa (job #2450192)
#include <cstdio>
#include <vector>
using namespace std;
const int N=100000+7;
int n,m;
int sum[5*N];
bool ok[5*N];
vector <int> id[N];
int sol[5*N],top;
int stiva[5*N],kol;
int main()
{
freopen("ciclueuler.in","r",stdin);
freopen("ciclueuler.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++)
{
int x,y;
scanf("%d%d",&x,&y);
ok[i]=1;
sum[i]=x+y;
id[x].push_back(i);
id[y].push_back(i);
}
for(int i=1;i<=n;i++)
{
int d=(int)id[i].size();
if(d&1)
{
printf("-1\n");
return 0;
}
}
stiva[++kol]=1;
while(kol)
{
int a=stiva[kol];
while(!id[a].empty() && ok[id[a].back()]==0)
id[a].pop_back();
if(!id[a].empty())
{
int i=id[a].back();
ok[i]=0;
stiva[++kol]=sum[i]-a;
}
else
{
sol[++top]=a;
kol--;
}
}
for(int i=1;i<top;i++)
printf("%d ",sol[i]);
printf("\n");
return 0;
}