Pagini recente » Istoria paginii runda/aaaaaaaaaaaaaaaaaaaa | clasament-arhiva-educationala | Cod sursa (job #661022) | Cod sursa (job #1231116) | Cod sursa (job #2540452)
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
int n, m, NR;
int TT[100005];
bool viz[100005];
vector <int> v[100005];
vector <pair <int, int> > aux;
vector <int> parc;
void dfs(int nod){
viz[nod] = 1; --NR;
for(auto it : v[nod]){
if(viz[it]) continue ;
TT[it] = nod;
dfs(it);
}
parc.push_back(nod);
}
int main(){
freopen("mesaj4.in", "r", stdin);
freopen("mesaj4.out", "w", stdout);
scanf("%d%d", &n, &m);
int x, y;
for(int i = 1; i <= m ; ++i){
scanf("%d%d", &x, &y);
v[x].push_back(y);
v[y].push_back(x);
}
NR = n;
dfs(1);
if(NR) {printf("-1"); return 0;}
printf("%d\n", 2 * n - 2);
parc.pop_back();
for(int i = 0; i < parc.size() ; ++i)
printf("%d %d\n", parc[i], TT[parc[i]]);
for(int i = parc.size() - 1; i >= 0 ; --i)
printf("%d %d\n", TT[parc[i]], parc[i]);
return 0;
}