Cod sursa(job #3354108)
| Utilizator | Data | 15 mai 2026 12:01:44 | |
|---|---|---|---|
| Problema | Ciclu Eulerian | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
string s;
int v[100005];
vector<vector<int>>vec;
map<pair<int,int>,bool>mp;
int n,m;
int main()
{
ifstream cin("ciclueuler.in");
ofstream cout("ciclueuler.out");
cin>>n>>m;
vec.resize(2*m);
for(int i=0;i<m;i++)
{
int a,b;
cin>>a>>b;
v[a]++;
v[b]++;
mp[{a,b}]=true;
mp[{b,a}]=true;
vec[a].push_back(b);
vec[b].push_back(a);
}
int cnt=0;
int y=0;
for(int i=1;i<=n;i++)
{
if(v[i]%2==1)
{
cnt++;
y=i;
}
}
if(cnt>2)
cout<<-1;
return 0;
}
