# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
666769 | divad | Network (BOI15_net) | C++14 | 6 ms | 11988 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#include <vector>
#define MAX 500002
using namespace std;
int n,x,y,vf[MAX];
vector<int> v[MAX],frunze;
void dfs(int nod){
vf[nod] = 1;
bool ok = false;
for(auto vecin: v[nod]){
if(vf[vecin] == 0){
ok |= true;
dfs(vecin);
}
}
if(!ok){
frunze.push_back(nod);
}
}
int main()
{
cin >> n;
for(int i = 1; i < n; i++){
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1);
//sort(frunze.begin(), frunze.end());
reverse(frunze.begin(), frunze.end());
vector<pair<int, int>> sol;
sol.push_back({1, frunze[0]});
for(int i = 1; i < frunze.size()-1; i++){
sol.push_back({frunze[i], frunze[i+1]});
}
cout << sol.size() << "\n";
for(auto [x, y]: sol){
cout << x << " " << y << "\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |