Pagini recente » Cod sursa (job #1071894) | Cod sursa (job #2625208) | Cod sursa (job #2039606) | Cod sursa (job #221099) | Cod sursa (job #1341459)
#include <fstream>
#include <bitset>
#include <vector>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int n,m,i,j,x,y;
bool ok;
bitset <100001> viz;
vector <int> v[100001];
int main()
{
f>>n>>m;
for (i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
q.push(1);
while(!q.empty())
{
x=q.front();
viz[x]=true;
for (j=0;j<v[x].size();j++)
if (viz[v[x][j]]==false)
q.push(v[x][j]);
}
ok=true;
for (j=1;j<=n;j++)
if ((viz[j]==false) || (v[j].size()%2==1))
ok=false;
if (ok==false)
g<<-1;
return 0;
}