Cod sursa(job #2776294)
Utilizator | Enal Gemaledin Blaugranas | Data | 19 septembrie 2021 11:06:06 |
---|---|---|---|
Problema | Ciclu Eulerian | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
#include<list>
#include<algorithm>
using namespace std;
ifstream F("ciclueuler.in");
ofstream G("ciclueuler.out");
int n,m,i,v,x,s[500001];
list<int> l[100001];
int main()
{
F>>n>>m;
while(m--)
F>>i>>x,l[i].push_back(x),l[x].push_back(i);
for(i=1;i<=n;++i)
if(l[i].size()%2) {
printf("-1");
return 0;
}
for(v=s[1]=1;v;) {
for(x=s[v];!l[x].empty();)
i=l[x].front(),l[x].pop_front(),l[i].erase(find(l[i].begin(),l[i].end(),x)),s[++v]=x=i;
G<<s[v--]<<" ";
}
return 0;
}