GKHack's Blog

HighwaysTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11163 Accepted: 3174 Special JudgeDescriptionThe island nation of Flatopia is perfectly fl

Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。 Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( 当

DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of

DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing ea

总时间限制: 1000ms 内存限制: 65536kB描述The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is

题目链接:点击打开链接给出n - 1组边长, 构成一张图, 要求删除一些边使得边长和最小且任意两点可到达.最小生成树, 套一个kru模板即可. 并查集初始化, 读入数据后对边长进行排序, 若并查集确定两点不在同一连通分量则将两点连接并存储所得到的边.AC代码:#include "iostream"#include "cstdio"#include "cstring"

D. Lazy Studenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudent Vladislav came to his programming e