# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
951396 | Doncho_Bonboncho | Network (BOI15_net) | C++14 | 23 ms | 47964 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;
template< class T, class T2 > inline bool chkmin( T& a, const T2& b ){ return a > b ? a = b, 1 : 0; }
template< class T, class T2 > inline bool chkmax( T& a, const T2& b ){ return a < b ? a = b, 1 : 0; }
#ifndef LOCAL
#define cerr if( false )cerr
#endif
#define out(x) #x << " = " << x << " "
typedef long long ll;
const int MAX_N = 1e6 + 42;
const ll mod = 1e9 + 7;
std::vector< int > v[MAX_N];
int main (){
#ifndef LOCAL
std::ios_base::sync_with_stdio( false ); std::cin.tie( NULL ); std::cout.tie( NULL );
#endif
int n;
std::cin >> n;
if( n <= 3 ) while( true )
for( int i=0 ; i < n-1 ; i++ ){
int a, b;
std::cin >> a >> b;
a--; b--;
v[a].push_back( b );
v[b].push_back( a );
}
std::vector< int > leaves;
for( int i=0 ; i < n ; i++ ){
if( v[i].size() == 1 ) leaves.push_back( i );
}
ll nas = leaves.size() / 2;
if( leaves.size() & 1 ){
nas ++;
std::cout << nas << endl;
std::cout << leaves.back() +1 << " " << leaves[0] +1 << endl;
leaves.pop_back();
}else{
std::cout << nas << endl;
}
for( int i=0 ; i < leaves.size() ; i += 2 ){
std::cout << leaves[i] +1 << " " << leaves[i+1] +1 << endl;
}
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... |