图论
hncu__lz
既然坚持了这么久,就要坚持到最后~
展开
-
poj 3311 Hie with the Pie (弗洛伊德+状态压缩)
DescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the deliveries原创 2016-10-09 20:27:21 · 294 阅读 · 0 评论 -
poj 3013 Big Christmas Tree (最短路)
DescriptionChristmas is coming to KCM city. Suby the loyal civilian in KCM city is preparing a big neat Christmas tree. The simple structure of the tree is shown in right picture.The tree can原创 2016-09-27 09:48:48 · 294 阅读 · 0 评论 -
poj 1511 Invitation Cards (最短路)
DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique原创 2016-09-27 09:44:02 · 216 阅读 · 0 评论 -
poj 1847 Tram (最短路)
DescriptionTram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out of the原创 2016-09-27 09:37:36 · 439 阅读 · 0 评论 -
hdu 2112 HDU Today (map+DIJ)
Problem Description经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,XHD夫妇也退居了二线,并在风景秀美的诸暨市浬浦镇陶姚村买了个房子,开始安度晚年了。这样住了一段时间,徐总对当地的交通还是不太了解。有时很郁闷,想去一个地方又不知道应该乘什么公交车,在什么地方转车,在原创 2016-09-27 09:23:13 · 212 阅读 · 0 评论 -
poj 1797 Heavy Transportation (DIJ)
DescriptionBackground Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from t原创 2016-09-26 23:02:26 · 184 阅读 · 0 评论 -
hdu 3790 最短路径问题 (最短路径问题)
Problem Description 给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。Input 输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为0时输入结束。 (1#incl原创 2016-09-26 22:51:47 · 167 阅读 · 0 评论 -
hdu 2066 一个人的旅行 (DIJ)
Problem Description虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能丰富自己的阅历,还可以看美丽的风景……草儿想去很多地方,她想要去东京铁塔看夜景,去威尼斯看电影,去阳明山上看海芋,去纽约纯粹看雪景,去巴黎喝咖啡写信,去北京探望孟姜女……眼看寒假就快到了,这么一大段时原创 2016-09-26 22:44:33 · 188 阅读 · 0 评论 -
hdu2544 最短路
Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗? Input输入包括多组数据。每组数据第一行是两个整数N、M(N输入保证至少存在1条商店到赛场的路线。 O原创 2016-09-26 22:42:01 · 273 阅读 · 0 评论 -
POJ 3343 Against Mammoths (二分匹配)
DescriptionBack to year 3024, humans finally developed a new technology that enables them to conquer the alien races. The new technology made it possible to produce huge spaceships known as Saber原创 2016-10-12 19:07:21 · 237 阅读 · 0 评论 -
hdu 1845 Jimmy’s Assignment (二分匹配)
Problem DescriptionJimmy is studying Advanced Graph Algorithms at his university. His most recent assignment is to find a maximum matching in a special kind of graph. This graph is undirected, has N原创 2016-10-11 21:39:45 · 399 阅读 · 1 评论 -
hdu 2768 Cat vs. Dog (二分匹配)
Problem DescriptionThe latest reality show has hit the TV: ``Cat vs. Dog''. In this show, a bunch of cats and dogs compete for the very prestigious Best Pet Ever title. In each episode, the cats and原创 2016-10-11 20:11:20 · 438 阅读 · 0 评论 -
hdu 1150 Machine Schedule ( 二分匹配)
Font Size: ← →Problem DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely原创 2016-10-10 19:41:22 · 248 阅读 · 0 评论 -
poj 2060 Taxi Cab Scheme (二分匹配)
Problem DescriptionRunning a taxi station is not all that simple. Apart from the obvious demand for a centralised coordination of the cabs in order to pick up the customers calling to get a cab as s原创 2016-10-10 21:24:32 · 303 阅读 · 0 评论 -
hdu 3605 Escape (二分图多重匹配)
Problem Description2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of the plan原创 2016-10-10 21:34:07 · 302 阅读 · 0 评论 -
hdu 1151 Air Raid (二分匹配,最小路径覆盖)
Problem DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through t原创 2016-10-09 21:43:10 · 232 阅读 · 0 评论 -
poj 3463 Sightseeing(最短路次短路)
DescriptionTour operator Your Personal Holiday organises guided bus trips across the Benelux. Every day the bus moves from one city S to another city F. On this way, the tourists in the bus can se原创 2016-09-27 20:15:58 · 305 阅读 · 0 评论