当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
4896：Minimal Spanning Tree
题目描述
Given a connected, undirected, weight graph G, your task is to select a subset of edges so that after deleting all the other edges, the graph G is still connected. If there are multiple ways to do this, you should choose the way that minimize the sum of the weight of these selected edges.
Please note that the graph G might be very large. we'll give you two numbers: N, and seed, N is number of nodes in graph G, the following psuedo-code shows how to to generate graph G.
Here ⊕ represents bitwise xor (exclusive-or).
Please note that the graph G might be very large. we'll give you two numbers: N, and seed, N is number of nodes in graph G, the following psuedo-code shows how to to generate graph G.
Here ⊕ represents bitwise xor (exclusive-or).
输入解释
Input contains several test cases, please process till EOF.
For each test case, the only line contains two numbers: N and seed.(1 ≤ N ≤ 10000000, 1 ≤ seed ≤ 2333332)
For each test case, the only line contains two numbers: N and seed.(1 ≤ N ≤ 10000000, 1 ≤ seed ≤ 2333332)
输出解释
For each test case output one number, the minimal sum of weight of the edges you selected.
输入样例
6 2877 2 17886 3 22452
输出样例
2157810 259637 1352144
来自杭电HDUOJ的附加信息
| Author | Fudan University |
| Recommend |
最后修改于 2020-10-25T23:17:53+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
| 时间上限 | 内存上限 |
| 12000/6000MS(Java/Others) | 65536/65536K(Java/Others) |
登陆或注册以提交代码