A12384 | Spanning Tree with Maximum Degree
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given an undirected unweighted connected graph consisting of $n$ vertices and $m$ edges. It is guaranteed that there are no self-loops or multiple edges in the given graph.
Your task is to find any spanning tree of this graph such that the maximum degree over all vertices is maximum possible. Recall that the degree of a vertex is the number of edges incident to it.
Your task is to find any spanning tree of this graph such that the maximum degree over all vertices is maximum possible. Recall that the degree of a vertex is the number of edges incident to it.
输入格式
The first line contains two integers $n$ and $m$ ( $2 \le n \le 2 \cdot 10^5$ , $n - 1 \le m \le min(2 \cdot 10^5, \frac{n(n-1)}{2})$ ) — the number of vertices and edges, respectively.
The following $m$ lines denote edges: edge $i$ is represented by a pair of integers $v_i$ , $u_i$ ( $1 \le v_i, u_i \le n$ , $u_i \ne v_i$ ), which are the indices of vertices connected by the edge. There are no loops or multiple edges in the given graph, i. e. for each pair ( $v_i, u_i$ ) there are no other pairs ( $v_i, u_i$ ) or ( $u_i, v_i$ ) in the list of edges, and for each pair $(v_i, u_i)$ the condition $v_i \ne u_i$ is satisfied.
The following $m$ lines denote edges: edge $i$ is represented by a pair of integers $v_i$ , $u_i$ ( $1 \le v_i, u_i \le n$ , $u_i \ne v_i$ ), which are the indices of vertices connected by the edge. There are no loops or multiple edges in the given graph, i. e. for each pair ( $v_i, u_i$ ) there are no other pairs ( $v_i, u_i$ ) or ( $u_i, v_i$ ) in the list of edges, and for each pair $(v_i, u_i)$ the condition $v_i \ne u_i$ is satisfied.
输出格式
Print $n-1$ lines describing the edges of a spanning tree such that the maximum degree over all vertices is maximum possible. Make sure that the edges of the printed spanning tree form some subset of the input edges (order doesn't matter and edge $(v, u)$ is considered the same as the edge $(u, v)$ ).
If there are multiple possible answers, print any of them.
If there are multiple possible answers, print any of them.
输入输出样例
输入 #1
5 5 1 2 2 3 3 5 4 3 1 5
输出 #1
3 5 2 1 3 2 3 4
输入 #2
4 6 1 2 1 3 1 4 2 3 2 4 3 4
输出 #2
4 1 1 2 1 3
输入 #3
8 9 1 2 2 3 2 5 1 6 3 4 6 5 4 5 2 7 5 8
输出 #3
3 2 2 5 8 5 6 1 2 7 1 2 3 4
Picture corresponding to the first example: 
In this example the number of edges of spanning tree incident to the vertex $3$ is $3$ . It is the maximum degree over all vertices of the spanning tree. It is easy to see that we cannot obtain a better answer.
Picture corresponding to the second example: 
In this example the number of edges of spanning tree incident to the vertex $1$ is $3$ . It is the maximum degree over all vertices of the spanning tree. It is easy to see that we cannot obtain a better answer.
Picture corresponding to the third example: 
In this example the number of edges of spanning tree incident to the vertex $2$ is $4$ . It is the maximum degree over all vertices of the spanning tree. It is easy to see that we cannot obtain a better answer. But because this example is symmetric, we can choose almost the same spanning tree but with vertex $5$ instead of $2$ .
In this example the number of edges of spanning tree incident to the vertex $3$ is $3$ . It is the maximum degree over all vertices of the spanning tree. It is easy to see that we cannot obtain a better answer.
Picture corresponding to the second example: 
In this example the number of edges of spanning tree incident to the vertex $1$ is $3$ . It is the maximum degree over all vertices of the spanning tree. It is easy to see that we cannot obtain a better answer.
Picture corresponding to the third example: 
In this example the number of edges of spanning tree incident to the vertex $2$ is $4$ . It is the maximum degree over all vertices of the spanning tree. It is easy to see that we cannot obtain a better answer. But because this example is symmetric, we can choose almost the same spanning tree but with vertex $5$ instead of $2$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted