Pagini recente » Cod sursa (job #1965222) | Cod sursa (job #2660526) | Cod sursa (job #2192577) | Cod sursa (job #1368270) | Cod sursa (job #2351103)
#include <bits/stdc++.h>
#define MAXN 100005
int N, M;
std::vector <int> ADC[MAXN];
inline void AddEdge(int X, int Y) {
ADC[X].push_back(Y);
ADC[Y].push_back(X);
}
bool Seen[MAXN];
std::vector <std::pair <int, int>> Pairs;
void DFS(int Vertex = 1) {
Seen[Vertex] = 1;
for (auto Edge:ADC[Vertex])
if (!Seen[Edge])
DFS(Edge), Pairs.push_back({Edge, Vertex});
}
std::ifstream In ("mesaj4.in");
std::ofstream Out("mesaj4.out");
void Print() { Out << 2*N - 2 << '\n';
for (int i=0; i<Pairs.size(); ++i)
Out << Pairs[i].first << ' ' << Pairs[i].second << '\n';
for (int i=Pairs.size()-1; i>=0; --i)
Out << Pairs[i].second << ' ' << Pairs[i].first << '\n';
}
void Citire() {
In >> N >> M;
for (int i=1, X, Y; i<=M; ++i)
In >> X >> Y, AddEdge(X, Y);
}
void Rezolvare() {
DFS();
if (Pairs.size() == N-1)
Print();
else
Out << "-1\n";
}
int main()
{
Citire();
Rezolvare();
return 0;
}