生成树
文章平均质量分 87
Mr_Treeeee
这个作者很懒,什么都没留下…
展开
-
HDU 6060 RXD and dividing
RXD and dividingTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1253 Accepted Submission(s): 527Problem DescriptionRXD has原创 2017-08-02 22:12:32 · 213 阅读 · 0 评论 -
湖南大学ACM程序设计新生杯大赛 - B Build
时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 32768K,其他语言65536K64bit IO Format: %lld题目描述 In country A, some roads are to be built to connect the cities。However, due to limited funds, only原创 2018-01-23 19:39:07 · 620 阅读 · 0 评论 -
Codeforces Beta Round #25 (Div. 2 Only) - D. Roads not only in Berland (生成树)
D. Roads not only in Berlandtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland Government decided to原创 2017-12-07 23:06:21 · 204 阅读 · 0 评论 -
HDU 4786 - Fibonacci Tree(生成树)
Fibonacci TreeTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5838 Accepted Submission(s): 1821Problem Description Coach Pan原创 2017-11-27 11:03:50 · 290 阅读 · 0 评论 -
HDU 4081 Qin Shi Huang's National Road System (次小生成树)
Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8709 Accepted Submission(s): 3084Problem Desc原创 2017-09-12 19:30:44 · 245 阅读 · 0 评论 -
POJ 1679 The Unique MST(次小生成树)
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 31994 Accepted: 11572DescriptionGiven a connected undirected graph, tell if its minimum sp原创 2017-09-08 17:48:47 · 226 阅读 · 0 评论 -
HDU 4009 Transfer water(最小树形图)
Transfer waterTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 5373 Accepted Submission(s): 1947Problem DescriptionXiaoA lives原创 2017-09-15 18:56:41 · 248 阅读 · 0 评论 -
HDU 2121 Ice_cream’s world II(不定根最小树形图)
Ice_cream’s world IITime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5665 Accepted Submission(s): 1437Problem DescriptionAfter原创 2017-09-14 19:37:38 · 249 阅读 · 0 评论 -
POJ 3164 Command Network (最小树形图)
Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 18879 Accepted: 5434DescriptionAfter a long lasting war on words, a war on arms finall原创 2017-09-13 21:46:14 · 253 阅读 · 0 评论 -
UVA 11183 Teen Girl Squad(最小树形图)
You are part of a group ofn teenage girls armed with cellphones. You have some news you wantto tell everyone in the group. The problem is that no two of you are in the same room, and you mustcommu原创 2017-09-13 21:27:28 · 395 阅读 · 0 评论 -
ZOJ Monthly, June 2018 - I District Division
点击打开链接题意:把有n个节点的一棵树分成n/k棵树。保证b%k=0。输出每棵树的节点序号。否则输出NO。POINT:输出序号可以借助stack。对于每个根节点,看每条子树还有多少节点。因为每个子树要形成一个树(假设他们合起来为个数为k),必须要用到根节点。所以对于每个子树的节点加起来,在加上1(根节点)。如果大于k,就NO了。要正好等于k,才符合题意。若小于k,那么回溯往前面合并。#includ...原创 2018-07-09 19:25:27 · 233 阅读 · 0 评论