图论
文章平均质量分 92
此间少年_leozp
这个作者很懒,什么都没留下…
展开
-
poj1511 Invitation Cards
题目:http://poj.org/problem?id=1511题意:就是求所有的节点到节点 1,然后从节点1返回的最小距离的和。简单SPFA,和poj 3268 无多少差异。#include#include#include#include#include#include#include#include#include#include#include#inclu原创 2014-08-20 16:15:38 · 783 阅读 · 0 评论 -
POJ 3281 Dining
DiningTime Limit: 2000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64uSubmit StatusDescriptionCows are such finicky eaters. Each cow has a preference f原创 2016-07-12 10:58:35 · 190 阅读 · 0 评论 -
poj 1274 (二分匹配)
The Perfect StallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20863 Accepted: 9417DescriptionFarmer John completed his new barn just last week, compl原创 2015-09-09 09:59:48 · 373 阅读 · 0 评论 -
zoj1586(prim)
QS NetworkTime Limit: 2 Seconds Memory Limit: 65536 KBSunny Cup 2003 - Preliminary RoundApril 20th, 12:00 - 17:00Problem E: QS NetworkIn the planet w-503 of galaxy cgb, there is原创 2015-08-28 10:03:10 · 344 阅读 · 0 评论 -
poj2031(prim)
欢迎参加hihoCoder挑战赛14和15,赢取100件Tshirt!Language:DefaultConstructing RoadsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20997 Accepted: 8875原创 2015-08-28 09:45:11 · 468 阅读 · 0 评论 -
poj 2031(prim)
欢迎参加hihoCoder挑战赛14和15,赢取100件Tshirt!Language:DefaultBuilding a Space StationTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5944 Accepted: 2952原创 2015-08-28 09:34:52 · 653 阅读 · 0 评论 -
zoj1456 Minimum Transport Cost
ZOJ Problem Set - 1456Minimum Transport CostTime Limit: 2 Seconds Memory Limit: 65536 KB These are N cities in Spring country. Between each pair of cities there may be one transportat原创 2014-08-17 15:09:25 · 1131 阅读 · 1 评论 -
poj1273
Drainage Ditches点击打开链接Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 56466 Accepted: 21694DescriptionEvery time it rains on Farmer John's fields, a p原创 2014-08-27 10:51:41 · 1004 阅读 · 0 评论 -
poj3259 Wormholes
题意:N块地,M条路,W个虫洞。判断有没有可以是时间倒流的路径。注意把W次输入的w[i]改成-w[i]。SPFA:判断有没有入队次数超过N的点。原创 2014-08-14 09:44:43 · 1251 阅读 · 0 评论 -
poj3268俩次SPFA。。。。。
俩次SPFA。。。。原创 2014-08-13 20:23:08 · 1091 阅读 · 8 评论 -
poj1679 The Unique MST
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20421 Accepted: 7183DescriptionGiven a connected undirected graph, tell if its minimum spann原创 2014-08-11 13:58:37 · 866 阅读 · 0 评论 -
Light oj 1074 - Extended Traffic
1074 - Extended Traffic PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBDhaka city is getting crowded and noisy day by day. Cert原创 2016-07-12 11:03:41 · 538 阅读 · 1 评论