Rikka with Minimum Spanning Trees徐州区域赛a题

最新推荐文章于 2021-04-23 21:02:27 发布

cwb丶

最新推荐文章于 2021-04-23 21:02:27 发布

阅读量783

点赞数

分类专栏：最小生成树

本文链接：https://blog.csdn.net/caowenbo2311694605/article/details/88088118

版权

这是一道关于最小生成树（MST）的题目，Rikka提供了通过随机数生成器构造的图。你需要计算所有MST的边权重之和的模(10^9 + 7)，并利用Kirchhoff's矩阵树定理和Kruskal算法的性质来解决。输入包含多个测试用例，每个用例给出图的节点数、边数以及随机种子。

摘要由CSDN通过智能技术生成

Hello everyone! I am your old friend Rikka. Welcome to Xuzhou. This is the first problem, which is a problem about the minimum spanning tree (MST). I promise you all that this should be the \textbf{easiest problem}easiest problem for most people.

A minimum spanning tree, or minimum weight spanning tree, is a subset of edges from an edge-weighted undirected graph, which forms a tree with the minimum possible total edge weight that connects all the vertices together without any cycles.

In this problem, Rikka wants you to calculate the summation of total edge weights through all MSTs for a given graph, which obviously equals to the product of the total edge weight in an MST and the total number of different MSTs. Note that two spanning trees are different if the sets of their edges are different. In addition, a disconnected graph could have no MSTs, the number of whose different MSTs is zero.

To decrease the size of the input, Rikka provides an edge-weighted undirected graph via a random number generator with given random seeds, denoted by two integers k_1k
1

and k_2k
2

. Supposing the number of vertices and edges in the graph are nn and mm respectively, the following code in C++ tells you how to generate the graph and store the ii-th edge between the vertex u[i]u[i] and v[i]v[i] with weight w[i]w[i] in corresponding arrays. You can use the code directly in your submissions.

1
unsigned long long k1, k2;
2

3
unsigned long long xorShift128Plus() {