제출 #1137892

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1137892		PlayVoltz	Network (BOI15_net)	C++20	0 / 100	0 ms	324 KiB

net

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

vector<vector<int> > graph;
vector<int> leaf;

void dfs(int node, int par){
	if (graph[node].size()==1)leaf.pb(node);
	for (auto num:graph[node])if (num!=par)dfs(num, node);
}

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, a, b;
	cin>>n;
	graph.resize(n+1);
	for (int i=1; i<n; ++i){
		cin>>a>>b;
		graph[a].pb(b);
		graph[b].pb(a);
	}
	dfs(1, -1);
	cout<<(leaf.size()+1)/2<<"\n";
	for (int i=0; i+1<leaf.size(); i+=2)cout<<leaf[i]<<" "<<leaf[i+1]<<"\n";
	if (leaf.size()%2)cout<<leaf[0]<<" "<<leaf.back();
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 45
• Subtask 3: 0 / 37