图论
文章平均质量分 74
LLawliet
代码人生
展开
-
URAL1099:Work Scheduling(任意图匹配,带花树)
1099. Work SchedulingTime Limit: 0.5 secondMemory Limit: 16 MBThere is certain amount of night guards that are available to protect the local junkyard from possible junk robberies. These原创 2011-10-31 22:29:05 · 631 阅读 · 0 评论 -
ZOJ3204:Connect them(字典序最小生成树)
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原创 2011-11-08 11:25:09 · 569 阅读 · 0 评论 -
FOJ1898:Cows Arrangement(差分约束系统)
Problem 1898 Cows ArrangementAccept: 41 Submit: 82Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionLike everyone else, cows like to stand close to their friends.原创 2011-11-07 23:27:14 · 339 阅读 · 0 评论 -
POI2005:ska Piggy banks
1529: [POI2005]ska Piggy banksTime Limit: 5 Sec Memory Limit: 64 MBSubmit: 563 Solved: 224[Submit][Status][Discuss]DescriptionByteazar 有 N 个小猪存钱罐. 每个存钱罐只能用钥匙打开或者砸开. Byteazar 已经把每个存钱罐的钥匙放原创 2011-11-08 00:10:52 · 536 阅读 · 0 评论 -
POJ1201:Intervals(差分约束系统)
IntervalsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14900 Accepted: 5553DescriptionYou are given n closed, integer intervals [ai, bi] and n integ原创 2011-11-08 21:28:09 · 366 阅读 · 0 评论 -
Minimal Steiner Tree 简介
MinimalSteinerTree 的意思是:在图中找出一个生成树,需要将指定的数个点连接,边权总值最小。最小生成树是 MinimalSteinerTree 的一种特殊情况。此问题是NP完全问题。在POJ 3123中的标程给出了一个递归的算法来解决这个问题。首先用floyd算法求出两两之间的最短路径。然后把所有点都两两链接起来,权值就是它们的最短路径。假设指定必须原创 2011-11-09 21:43:07 · 3769 阅读 · 0 评论 -
2011 ACM/ICPC 北京赛区现场赛解题: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): 216 Accepted Submission(s): 105Problem Descri原创 2011-11-09 01:27:29 · 1304 阅读 · 0 评论 -
POJ3123:Ticket to Ride(Minimal Steiner Tree)
题目传送门:http://poj.org/problem?id=3123题目大意是:给出一个无向图,和四对数据。每对数据分别为图中的两个点。要求添加一些边,使每对点都能连通,让总边权最小。首先考虑一个子问题:指定一些点,添加一些边,让它们连通,并且总边权最小。这个问题就是Minimal Steiner Tree(最小斯坦纳树)问题,什么是Minimal Steine原创 2011-11-10 22:54:23 · 1946 阅读 · 0 评论 -
2011 ACM/ICPC 北京赛区现场赛解题:Peach Blossom Spring
题目传送门:http://acm.hdu.edu.cn/showproblem.php?pid=4085在做这道题之前,建议先看下POJ3123,相关的信息在这里和这里。说一下这道题的思路吧。首先判断无解情况,这个很简单,把两个点集做一次二分图匹配看是否全部连通就OK了。之后用Minimal Steiner Tree那种DP思想求解出dp[i][j]所有结果,其中i原创 2011-11-12 20:24:35 · 1382 阅读 · 0 评论 -
JOJ2737:狼与羊的故事(求图上任意两点间的桥边)
2737: 狼与羊的故事ResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s65536K5310Standard村长要召开羊族大会,讨论羊族未来的发展,要求羊羊们到指定地点集合。小羊们收到通知后从家里出发到达指定地点。每个羊的家都是与其他羊的家原创 2011-11-05 23:43:49 · 830 阅读 · 0 评论 -
POJ3164:Command Network
Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 7267 Accepted: 2160DescriptionAfter a long lasting war on words, a war o原创 2011-10-31 22:32:01 · 488 阅读 · 0 评论 -
JOJ1871:Jogging Trails
1871: Jogging TrailsResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K5917StandardGord is training for a marathon. Behind his hou原创 2011-10-31 22:24:02 · 386 阅读 · 0 评论 -
ZOJ3316:Game
ZOJ Problem Set - 3316GameTime Limit: 1 Second Memory Limit: 32768 KBFire and Lam are addicted to the game of Go recently. Go is one of the oldest board games. It is rich in strategy原创 2011-10-31 22:31:25 · 491 阅读 · 0 评论 -
HDU2121: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): 938 Accepted Submission(s): 192Problem DescriptionAfter a原创 2011-10-31 22:32:50 · 425 阅读 · 0 评论 -
HDU4009:Transfer water
Transfer waterTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1770 Accepted Submission(s): 650Problem DescriptionXiaoA lives原创 2011-10-31 22:33:30 · 284 阅读 · 0 评论 -
POJ2449:Remmarguts' Date
Remmarguts' DateTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 12450 Accepted: 3422Description"Good man never makes girls wait or breaks原创 2011-10-31 22:34:42 · 627 阅读 · 0 评论 -
POJ3522:Slim Span
Slim SpanTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4023 Accepted: 2116DescriptionGiven an undirected weighted graph G, you should原创 2011-10-31 22:35:15 · 428 阅读 · 0 评论 -
ZOJ2697:Electricity
ElectricityTime Limit: 10 Seconds Memory Limit: 32768 KB Special JudgeAfter recent blackouts in some regions in North America, the government has decided to reorganize the power su原创 2011-10-31 22:23:34 · 458 阅读 · 0 评论 -
POJ3463:Sightseeing
SightseeingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4917 Accepted: 1688DescriptionTour operator Your Personal Holiday organises g原创 2011-10-31 22:35:43 · 359 阅读 · 0 评论 -
POJ1679:The Unique MST
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11943 Accepted: 4112DescriptionGiven a connected undirected graph, tell if i原创 2011-10-31 22:36:24 · 421 阅读 · 1 评论 -
POJ3013:Big Christmas Tree
将模型转化一下,用dist[i](也就是每条边的单位价格)作为系数,这的话,ans = ∑dist[i] * weight[i],weight[i]是每个点的重量固定的,所以求出dist[i]最下就行了,所以以1为根节点求最短路,边权值就是单位价格。#include #include #include #include using namespace std;const long原创 2012-01-27 20:31:23 · 356 阅读 · 0 评论