Pagini recente » Cod sursa (job #55549) | Cod sursa (job #886643) | Cod sursa (job #1033628) | Cod sursa (job #674708) | Cod sursa (job #2463717)
#include <bits/stdc++.h>
using namespace std;
ifstream f("mesaj4.in");
ofstream g("mesaj4.out");
const int NMAX = 100005;
int n,m,k;
bitset <NMAX> viz;
vector <int> v[NMAX];
pair <int, int> ans[NMAX];
void dfs(int node)
{
viz[node] = 1;
for(int i = 0 ; i < v[node].size() ; i++)
{
int it = v[node][i];
if(!viz[it])
{
dfs(it);
ans[++k] = {it,node};
}
}
}
int main()
{
f >> n >> m;
for(int i = 1 ; i <= m ; i++)
{
int x,y;
f >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1);
if(k != n - 1)
{
g << -1;
return 0;
}
g << 2 * (n - 1) << "\n";
for(int i = 1 ; i <= k ; i++)
g << ans[i].first << " " << ans[i].second << "\n";
for(int i = k ; i >= 1 ; i--)
g << ans[i].second << " " << ans[i].first << "\n";
return 0;
}