Pagini recente » Cod sursa (job #2350330) | Cod sursa (job #908654) | Cod sursa (job #2588817) | Cod sursa (job #1729824) | Cod sursa (job #1643787)
#include <bits/stdc++.h>
#define DIM 100005
using namespace std;
ifstream fin("mesaj4.in");
ofstream fout("mesaj4.out");
int N,M,x,y;
vector <int> v[DIM];
vector <pair <int,int> > Sol;
bitset <DIM> viz;
void bfs(){
viz[1]=1;
queue <int> Q;
Q.push(1);
while(!Q.empty()){
int node = Q.front();
Q.pop();
for(int i=0;i<v[node].size();i++){
int vecin = v[node][i];
if(!viz[vecin]){
Q.push(vecin);
viz[vecin]=1;
Sol.push_back(make_pair(node,vecin));
}
}
}
}
int main(){
fin >> N >> M;
while(M--){
fin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
bfs();
for(int i=1;i<=N;i++)
if(!viz[i]){
fout << "-1\n";
return 0;
}
fout << 2 * (N-1) << "\n";
for(int i=0;i<Sol.size();i++)
fout << Sol[i].second << " " << Sol[i].first << "\n";
for(std::vector <pair <int,int> >::reverse_iterator it=Sol.rbegin();it!=Sol.rend();it++)
fout << it->first << " " << it->second << "\n";
}