摘要:The Unique MSTTime Limit:1000MSMemory Limit:10000KTotal Submissions:16984Accepted:5892DescriptionGiven 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 G is a subgraph of G, s
阅读全文
摘要:Borg MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:6634Accepted:2240DescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. Each Borg
阅读全文
摘要:OutletsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18Accepted Submission(s): 11Problem DescriptionIn China, foreign brand commodities are often much more expensive than abroad. The main reason is that we Chinese people tend to think foreign thi
阅读全文
摘要:Connect themTime Limit: 1 Second Memory Limit: 32768 KBYou have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as connecting computers j and i). The cost of connect.
阅读全文