图论
文章平均质量分 80
安庆闪耀
这个作者很懒,什么都没留下…
展开
-
hdu 5339 Untitled (dfs)
UntitledTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1294 Accepted Submission(s): 759Problem DescriptionThere is an intege原创 2016-05-02 17:33:31 · 1816 阅读 · 0 评论 -
poj 1915 Knight Moves(bfs)
Knight MovesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23624 Accepted: 11099DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but h原创 2015-12-22 23:49:43 · 350 阅读 · 0 评论 -
hdu 1372 Knight Movies(bfs)
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8854 Accepted Submission(s): 5210Problem DescriptionA friend原创 2015-12-22 23:38:55 · 297 阅读 · 0 评论 -
poj 2387 Til the Cows Come Home(最短路)
Til the Cows Come HomeDescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie ne原创 2015-12-22 19:41:06 · 283 阅读 · 0 评论 -
poj 2421&&hdu 1102 Constructing Roads(最小生成树)
Constructing RoadsDescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two villag原创 2015-12-22 16:59:37 · 528 阅读 · 0 评论 -
poj 1469&&hdu 1803 Courses(最大匹配数)
CoursesProblem DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committ原创 2015-12-22 11:36:09 · 568 阅读 · 0 评论 -
hdu 2066 一个人的旅行(最短路)
一个人的旅行Problem Description虽然草儿是个路痴(就是在杭电待了一年多,居然还会在校园里迷路的人,汗~),但是草儿仍然很喜欢旅行,因为在旅途中 会遇见很多人(白马王子,^0^),很多事,还能丰富自己的阅历,还可以看美丽的风景……草儿想去很多地方,她想要去东京铁塔看夜景,去威尼斯看电影,去阳明山上看海芋,去纽约纯粹看雪景,去巴黎喝咖啡写信,去北京探望孟姜女……眼看寒原创 2015-12-22 11:18:15 · 775 阅读 · 0 评论 -
poj 1979 &&hdu 1312Red and Black (bfs)
Red and BlackDescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one原创 2015-12-21 00:07:37 · 560 阅读 · 0 评论 -
hdu 1151 &&poj 1422 Air Raid (二分图匹配 最小路径覆盖)
Air RaidDescriptionConsider 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 thr原创 2015-12-20 22:17:25 · 530 阅读 · 0 评论 -
poj 1466 && hdu 1068Girls and Boys(最大独立集)
DescriptionIn the second year of the university somebody started a study on the romantic relations between the students. The relation "romantically involved" is defined between one girl and one原创 2015-12-20 21:04:54 · 817 阅读 · 0 评论 -
poj 2395 Out of Hay(最小生成树)
Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13571 Accepted: 5251DescriptionThe cows have run out of hay, a horrible event that must be remedied immediately. Bessie原创 2015-12-23 12:42:39 · 300 阅读 · 0 评论 -
hdu 3046 Pleasant sheep and big big wolf(最小割)
Pleasant sheep and big big wolf时间限制2秒 内存限制64MProblemDescriptionIn BIT, there is a well-known prairie. And it attractspleasant sheep and his companions to have a holiday. Big big wolf and his原创 2015-12-23 17:02:32 · 349 阅读 · 0 评论 -
poj 3281 Dining(最大流)
Dining时间限制2秒 内存限制64MDescriptionCows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.Farmer John has cooked fabulous meal原创 2015-12-23 17:06:16 · 280 阅读 · 0 评论 -
hdu 5311 Hidden String(dfs)
Hidden StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1801 Accepted Submission(s): 642Problem DescriptionToday is th原创 2016-05-02 17:35:02 · 4041 阅读 · 0 评论 -
hdu 5438 Ponds(拓扑排序+dfs)
PondsTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2918 Accepted Submission(s): 917Problem DescriptionBetty owns a lot of原创 2016-05-02 20:33:05 · 1713 阅读 · 0 评论 -
poj 2771 Guardian of Decency(最大独立集)
Guardian of DecencyTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 5397 Accepted: 2268DescriptionFrank N. Stein is a very conservative high-school teach原创 2016-05-28 14:16:54 · 506 阅读 · 0 评论 -
hdu 1501 Zipper(dfs或dp)
Problem DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitra原创 2016-03-28 17:05:59 · 423 阅读 · 0 评论 -
hdu 1016 Prime Ring Problem(dfs)
Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime原创 2016-03-28 16:20:17 · 224 阅读 · 0 评论 -
poj 3169 Layout(差分约束)
DescriptionLike everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a straight line waiting for feed. The c原创 2016-03-27 21:57:12 · 626 阅读 · 0 评论 -
poj 1062 昂贵的聘礼(最短路)
Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币原创 2016-03-17 18:56:51 · 292 阅读 · 0 评论 -
NYOJ 1058 部分和问题(dfs)
部分和问题时间限制:1000 ms | 内存限制:65535 KB 难度:2描述给定整数a1、a2、.......an,判断是否可以从中选出若干数,使它们的和恰好为K。输入首先,n和k,n表示数的个数,k表示数的和。接着一行n个数。(1输出如果和恰好可以为k,输出“YES”,并按输入顺序依次输出是由哪几个数的和组成,否则“NO”样例输入原创 2016-02-29 20:41:17 · 386 阅读 · 0 评论 -
CF 616C The Labyrinth(dfs)
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with '.', impassable cells are marked with '*'. Let's call原创 2016-01-14 12:50:07 · 910 阅读 · 0 评论 -
hdu 5706 GirlCat(dfs)
GirlCatTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 88 Accepted Submission(s): 71Problem DescriptionAs a cute girl, Kotori原创 2016-06-10 19:02:57 · 634 阅读 · 0 评论