Pagini recente » Cod sursa (job #2494937) | Cod sursa (job #2395254) | Cod sursa (job #1859790) | Cod sursa (job #1178016) | Cod sursa (job #2789002)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("mesaj4.in");
ofstream fout("mesaj4.out");
vector<int>v[100005];
bool ap[100005];
vector<pair<int,int>>pereche;
int X, U, V1, V2;
inline void DFS(int start)
{
ap[start] = true;
for (int i = 0; i < v[start].size(); i++)
{
if(!ap[v[start][i]])
{
pereche.push_back(make_pair(start, v[start][i]));
DFS(v[start][i]);
}
}
}
int main()
{
fin >> X >> U;
for(int i = 0; i < U ; i++)
{
fin >> V1 >> V2;
V1--, V2--;
v[V1].push_back(V2);
v[V2].push_back(V1);
}
DFS(false);
if(2 * pereche.size() == 2 * X - 2)
{
fout << 2 * X - 2 << '\n';
for(int i = X - 2; i >= 0; i--)
{
fout << pereche[i].second + 1 << " " << pereche[i].first + 1 << '\n';
}
for(int i = 0; i < X - 1; i++)
{
fout << pereche[i].first + 1 << " " << pereche[i].second + 1 << '\n';
}
}
else
{
fout << -1;
}
return false;
}