# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1065258 | Malix | Network (BOI15_net) | C++14 | 388 ms | 54004 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
vii a;
vi p,arr;
void dfs(int x){
if(a[x].size()==1)arr.PB(x+1);
for(auto u:a[x]){
if(p[x]==u)continue;
p[u]=x;
dfs(u);
}
}
int main() {
int n;cin>>n;
a.resize(n);p.resize(n,-1);
REP(i,0,n-1){
int x,y;cin>>x>>y;
x--;y--;
a[x].PB(y);a[y].PB(x);
}
dfs(0);
cout<<(arr.size()+1)/2<<"\n";
if(arr.size()%2)cout<<arr.front()<<" "<<arr.back()<<"\n";
REP(i,0,arr.size()/2)cout<<arr[i]<<" "<<arr[arr.size()/2+i]<<"\n";
}
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... |