图论
文章平均质量分 86
xieshimao
topcoder
展开
-
swust oj 2620
ACM,马尔科夫矩阵,图论原创 2017-06-13 16:58:59 · 1374 阅读 · 0 评论 -
HDU 1824 Let's go home 2-sat
Let's go homeTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 624 Accepted Su原创 2011-09-27 14:32:14 · 1236 阅读 · 0 评论 -
HDU 2066 一个人的旅行
一个人的旅行Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6427 Accepted Submissio原创 2011-09-25 20:53:58 · 1096 阅读 · 0 评论 -
HDU/HDOJ 1217 Arbitrage University of Ulm Local Contest 1996
ArbitrageTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1373 Accepted Submis原创 2011-09-19 20:32:14 · 1535 阅读 · 0 评论 -
RQNOJ 28 LCA问题
查看题目 Show Problem[Donate]您的捐助,让RQNOJ明天更美好!题目:[Stupid]愚蠢的宠物问题编号:28 题目描述背景大家都知道,sheep有两只可爱的宠物(一只叫神牛,一只叫神菜)。有一天,sheep带着两只宠物到狗狗家时原创 2011-09-16 16:21:32 · 1194 阅读 · 0 评论 -
HDOJ/HDU 4034 2011成都网络赛D题
GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 355 Accepted Submission(原创 2011-09-12 15:52:38 · 1172 阅读 · 0 评论 -
HDU/HDOJ 3440 差分约束 2010年多校联合第一场
House ManTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 805 Accepted Submiss原创 2011-08-14 00:38:14 · 1295 阅读 · 0 评论 -
HDU/HDOJ 3592 差分约束 World Exhibition 2010年多校联合第15场
World ExhibitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 572 Accepted原创 2011-08-13 17:13:53 · 1122 阅读 · 0 评论 -
HDU/HDOJ 3666 差分约束 2010 Asia Regional Harbin
THE MATRIX PROBLEMTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3000 Accept原创 2011-08-13 11:54:52 · 1129 阅读 · 0 评论 -
UESTC ACM 1529 并查集+贪心
题目连接:http://acm.uestc.edu.cn/problem.php?pid=1529这个题我先开始就联想到以前做过的UVA上面的一道题目:求最大的最小边,但是那个题是利用floyd算法过的。面对这个题N=1000的挑战。所以floyd我试都没有试 后原创 2011-08-11 00:34:16 · 1798 阅读 · 0 评论 -
POJ 2377 最大生成树 prim实现
Bad CowtractorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6904 Accepted: 3008<br />DescriptionBessie has been hired to build原创 2011-02-14 14:46:00 · 6002 阅读 · 0 评论 -
POJ/PKU 2513 并查集+字典树+欧拉回路
Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 20750 Accepted: 5482Description原创 2011-08-10 01:00:12 · 1226 阅读 · 0 评论 -
POJ 3522 暴力+图论
Slim SpanTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2967 Accepted: 1579DescriptionGiven an undirected weighted graph G, you s原创 2010-11-21 14:29:00 · 1484 阅读 · 0 评论 -
POJ 1719 最大匹配
题目连接:http://poj.org/problem?id=1719很明显的最大匹配题目。而且题目是SPJ的,可以直接用匈牙利算法计算从行到列的最大匹配数 我的代码:Source CodeProblem: 1719 User: bingshenMemory: 1160K Tim原创 2011-07-11 16:27:18 · 1016 阅读 · 0 评论 -
HDU 1598 并查集
find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 79原创 2011-09-28 12:12:50 · 998 阅读 · 0 评论 -
HDU 1879 最小生成树
继续畅通工程Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5604 Accepted Submissio原创 2011-09-28 15:23:10 · 1139 阅读 · 0 评论 -
百度之星2006年初赛 座位调整
1366:座位调整Time Limit:1000MS Memory Limit:65536KTotal Submit:3 Accepted:2 Page View:20[Submit] [Status] [Discuss]Font Size:AaAaAaDescription百度办公区里到处摆放着各种各样的零食。百度人力原创 2011-11-29 09:55:23 · 3268 阅读 · 0 评论 -
BUPT 238 2011ACM北京赛区现场赛A题
A. Qin Shi Huang's National Road SystemDescriptionDuring the Warring States Period of ancient China(476 BC to 221 BC), there were sevenkingdoms in China ---- they were Qi, Chu, Yan, Han, Zhao, W原创 2011-10-27 16:44:04 · 1539 阅读 · 0 评论 -
POJ 3660 floyd算法统计无关点个数
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3613 Accepted: 1911DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are partici原创 2011-02-11 02:54:00 · 1030 阅读 · 2 评论 -
POJ 1144 求关键点
NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5883 Accepted: 2773DescriptionA Telephone Line Company (TLC) is establishing a new telephone cable原创 2011-10-27 22:03:30 · 1045 阅读 · 0 评论 -
POJ 2771 最大独立集
Guardian of DecencyTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 3293 Accepted: 1375Descriptio原创 2010-12-31 20:22:00 · 1465 阅读 · 0 评论 -
HDU 3342 图论
Legal or NotTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1522 Accepted Sub原创 2011-10-09 22:36:31 · 1154 阅读 · 0 评论 -
HDU 3072 2009多校联合17 强连通
Intelligence SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 466 Accept原创 2011-10-09 16:51:55 · 1075 阅读 · 0 评论 -
POJ 3207 2-sat
Ikki's Story IV - Panda's TrickTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 3680 Accepted: 1330原创 2011-02-23 16:30:00 · 1143 阅读 · 0 评论 -
HDU 3488 2010多校联合6 图论
TourTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 725 Accepted Submission(s原创 2011-10-08 22:16:22 · 1260 阅读 · 0 评论 -
HDU 3279 2010ACM天津赛区现场赛 图论 最大匹配
I'm Telling the TruthTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 340 Acce原创 2011-10-08 20:14:19 · 2865 阅读 · 0 评论 -
HDU 3478 2010多校联合5 图论
CatchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 859 Accepted Submission(原创 2011-10-08 16:37:46 · 1443 阅读 · 0 评论 -
ZOJ 2588 双连通分量
Burning BridgesTime Limit: 5 Seconds Memory Limit: 32768 KB Ferry Kingdom is a nice little country located on N islands that原创 2011-10-15 11:11:52 · 1056 阅读 · 0 评论 -
HDU/HDOJ 3836 Equivalent Sets 多校联合1
这个题,读完之后我立即就想到了POJ上面一个我曾经做过的一道关于强连通的题目首先第一步肯定是进行强连通分量缩点在一个强连通分量中,很显然不需要我们添加额外的边然后分量与分量之间。我们就要考虑了方法是统计每一个分量的出度和入度。令A=出度为0的个数,B=入度为0原创 2011-08-02 16:36:07 · 1001 阅读 · 1 评论 -
HDU/HDOJ 2255 奔小康赚大钱 HDOJ 2008 Summer Exercise(4)- Buffet Dinner
水题,直接套用KM模板就可以过掉了。我的代码:#include#include#include#define inf 99999999using namespace std;int map[305][305];int lx[305],ly[原创 2011-08-04 19:21:31 · 1263 阅读 · 0 评论 -
POJ 1661 SPFA过的。。。感谢各种牛贴出来的数据。。。
Help JimmyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6228 Accepted: 1939<br />Description"Help Jimmy" 是在下图所示的场景上完成的游戏。 <br /><br />场景中包括多个长度和高度各不相同的平台。地面是最低的平台,高度为零,长度无限。 <br /><br />Jimmy老鼠在时刻0从高于所有平台的某处开始下落,它的下落速度始终为1米/秒。当Jimmy落到某个平台上时,游戏者原创 2011-03-27 17:37:00 · 1706 阅读 · 0 评论 -
POJ 3697 BFS暴力
USTC campus networkTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 3316 Accepted: 1023<br />Description<br />USTC campus network is a huge network. There is a bi-directional link between every pair of computers in the network. One of the computer原创 2011-03-10 19:02:00 · 1743 阅读 · 0 评论 -
POJ 2112 floyd+二分答案+网络流
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 4895 Accepted: 1874Case Time Limit: 1000MS<br />DescriptionFJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of path原创 2011-02-22 17:33:00 · 1119 阅读 · 0 评论 -
POJ 1459 网络流算法(EK)
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 12578 Accepted: 6846<br />DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an a原创 2011-02-20 21:46:00 · 1391 阅读 · 0 评论 -
POJ 2631 最长路搜索,BFS
Roads in the NorthTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1352 Accepted: 666<br />DescriptionBuilding and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such that ther原创 2011-02-19 20:38:00 · 1559 阅读 · 0 评论 -
POJ 1904 强连通
King's QuestTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 3719 Accepted: 1251Case Time Limit: 2000MS<br />DescriptionOnce upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about原创 2011-02-15 17:53:00 · 1262 阅读 · 0 评论 -
POJ 1789 最小生成树问题
Truck HistoryTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8416 Accepted: 3027<br />DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The co原创 2011-02-06 20:14:00 · 1920 阅读 · 0 评论 -
TOJ 比赛C题 Visiting Cows (TJU 2011 Exercise Contest 04)
C. Visiting CowsTime Limit: 1.0 Seconds Memory Limit: 65536K<br />Total Runs: 61 Accepted Runs: 21 Multiple test files<br /><br /><br />Description<br />After many weeks of hard work, Bessie is finally getting a vacation! Being the most social cow原创 2011-01-30 16:48:00 · 1044 阅读 · 0 评论 -
POJ 3683 2-sat问题,不过要输出路径用topsort
Priest John's Busiest DayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3985 Accepted: 1394 Special Judge<br />Description<br />John is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend原创 2011-02-24 20:25:00 · 1119 阅读 · 0 评论 -
POJ 1486 二分图的最大匹配(强化)
Sorting SlidesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1801 Accepted: 648<br />DescriptionProfessor Clumsey is going to give an important talk this afternoon. Unfortunately, he is not a very tidy person and has put all his transparencies o原创 2011-01-14 21:57:00 · 1078 阅读 · 0 评论