图论
文章平均质量分 87
听自己心跳的声音
一生大自在,万事将无同。
展开
-
NOOJ61 传纸条(一)(双线dp+费用流)
传纸条(一)时间限制:2000 ms | 内存限制:65535 KB难度:5描述小渊和小轩是好朋友也是同班同学,他们在一起总有谈不完的话题。一次素质拓展活动中,班上同学安排做成一个m行n列的矩阵,而小渊和小轩被安排在矩阵对角线的两端,因此,他们就无法直接交谈了。幸运的是,他们可以通过传纸条来进行交流。纸条要经由许多同学传到对方手里,小渊坐在矩阵的左上角,原创 2014-09-18 13:21:49 · 922 阅读 · 0 评论 -
poj3259 Wormholes(SPFA)
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 32160 Accepted: 11680DescriptionWhile exploring his many farms, Farmer John has discovered a nu原创 2014-12-13 15:50:10 · 527 阅读 · 0 评论 -
NYOJ349 Sorting It All Out(拓扑排序)
Sorting It All Out时间限制:3000 ms | 内存限制:65535 KB难度:3描述An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements原创 2014-12-12 19:58:05 · 565 阅读 · 0 评论 -
杭电1811 Rank of Tetris(拓扑排序+并查集缩点)
Rank of TetrisTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5490 Accepted Submission(s): 1540Problem Description自从Lele开发了Rating原创 2014-12-03 08:34:42 · 723 阅读 · 2 评论 -
poj1094 Sorting It All Out(拓扑排序)
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28422 Accepted: 9822DescriptionAn ascending sorted sequence of distinct values is one原创 2014-12-05 20:32:48 · 492 阅读 · 0 评论 -
poj1182 食物链(并查集)
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 46841 Accepted: 13615Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都原创 2014-12-11 22:30:25 · 574 阅读 · 0 评论 -
南阳42 一笔画问题(欧拉回路+并查集)
一笔画问题时间限制:3000 ms | 内存限制:65535 KB难度:4描述zyc从小就比较喜欢玩一些小游戏,其中就包括画一笔画,他想请你帮他写一个程序,判断一个图是否能够用一笔画下来。规定,所有的边都只能画一次,不能重复画。 输入第一行只有一个正整数N(N每组测试数据的第一行有两个正整数P,Q(P随后的Q行,每行有原创 2014-06-06 22:03:30 · 843 阅读 · 0 评论 -
poj1679 The Unique MST(次小生成树)
The Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20475 Accepted: 7201DescriptionGiven a connected undirected graph, tell if its minimum spann原创 2014-08-14 16:16:04 · 524 阅读 · 0 评论 -
zoj1586 QS Network(最小生成树)
QS NetworkTime Limit: 2 Seconds Memory Limit: 65536 KB Sunny Cup 2003 - Preliminary RoundApril 20th, 12:00 - 17:00 Problem E: QS NetworkIn the planet w-503 of galaxy cgb, ther原创 2015-01-15 21:42:09 · 597 阅读 · 0 评论 -
uva10766 Organising the Organisation(生成树计数模板)
Problem HOrganising the OrganisationInput: Standard InputOutput: Standard OutputTime Limit: 2 Second I am the chief of the Personnel Division of a moderate-sized company that wishes to rem原创 2015-02-01 01:33:35 · 649 阅读 · 0 评论 -
poj2377 Bad Cowtractors(最小生成树)
Bad CowtractorsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10891 Accepted: 4591DescriptionBessie has been hired to build a cheap internet network am原创 2014-12-06 18:09:22 · 530 阅读 · 0 评论 -
poj2139 Six Degrees of Cowvin Bacon(Flyod)
Six Degrees of Cowvin BaconTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3155 Accepted: 1464DescriptionThe cows have been making movies lately, so the原创 2014-12-06 19:06:28 · 705 阅读 · 0 评论 -
uva11183 Teen Girl Squad(最小树形图)
Teen Girl Squad Input: Standard InputOutput: Standard Output -- 3 spring rolls please.-- MSG'D!!-- Oh! My stomach lining!Strong BadYou are part of a group of n teen原创 2015-01-28 20:05:04 · 1189 阅读 · 0 评论 -
poj1149 PIGS(网络流)
PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16859 Accepted: 7563DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mi原创 2014-12-19 12:38:42 · 511 阅读 · 0 评论 -
杭电4725 The Shortest Path in Nya Graph(Dijkstra+堆优化)
The Shortest Path in Nya GraphTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2752 Accepted Submission(s): 658Problem Description原创 2015-01-08 08:46:58 · 669 阅读 · 0 评论 -
spoj104 Highways(生成树计数模板)
SPOJ Problem Set (classical)104. HighwaysProblem code: HIGHIn some countries building highways takes a lot of time... Maybe that's because there are many possiblities to construct原创 2015-01-27 17:45:20 · 916 阅读 · 0 评论 -
杭电5154 Harry and Magical Computer(拓扑排序)
Harry and Magical ComputerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 37 Accepted Submission(s): 18Problem DescriptionIn rewa原创 2015-01-03 21:26:24 · 864 阅读 · 0 评论 -
poj2253 Frogger(最短路变形)
FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26934 Accepted: 8763DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenl原创 2015-01-04 15:10:56 · 555 阅读 · 0 评论 -
poj1860 Currency Exchange(bellman_flod判环)
Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20988 Accepted: 7521DescriptionSeveral currency exchange points are working in our city原创 2015-01-05 13:25:40 · 507 阅读 · 0 评论 -
poj 2186 Popular Cows(强连通缩点)
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 23392 Accepted: 9580DescriptionEvery cow's dream is to become the most popular cow in the he原创 2014-08-16 19:13:16 · 554 阅读 · 0 评论 -
NYOJ120 校园网络(强联通)
校园网络时间限制:3000 ms | 内存限制:65535 KB难度:5描述南阳理工学院共有M个系,分别编号1~M,其中各个系之间达成有一定的协议,如果某系有新软件可用时,该系将允许一些其它的系复制并使用该软件。但该允许关系是单向的,即:A系允许B系使用A的软件时,B未必一定允许A使用B的软件。现在,请你写一个程序,根据各个系之间达成的协议情况,原创 2014-10-17 14:19:33 · 701 阅读 · 0 评论 -
poj3180 The Cow Prom(强连通)
The Cow PromTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1183 Accepted: 746DescriptionThe N (2 Only cows can perform the Round Dance which requir原创 2014-08-17 16:43:36 · 603 阅读 · 0 评论 -
杭电1269 迷宫城堡(强联通)
迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7453 Accepted Submission(s): 3312Problem Description为了训练小希的方向感,Gardon建立了一座大城堡原创 2014-08-24 16:12:07 · 745 阅读 · 0 评论 -
杭电2767 Proving Equivalences(强连通)
Proving Equivalences Time Limit : 4000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 1Problem DescriptionConsider the followi原创 2014-08-17 11:08:55 · 593 阅读 · 0 评论 -
poj2762 Going from u to v or from v to u?(强联通+拓扑排序)
Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14564 Accepted: 3845DescriptionIn order to make their sons brave, Jiaji原创 2014-10-05 17:34:02 · 839 阅读 · 0 评论 -
poj1236 Network of Schools(强连通-缩点)
Network of Schools Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 1Problem DescriptionA number of schools ar原创 2014-08-16 23:38:39 · 610 阅读 · 0 评论 -
poj3352 Road Construction (双连通)
Road ConstructionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8735 Accepted: 4357DescriptionIt's almost summer time, and that means that it's almost原创 2014-08-17 15:25:11 · 596 阅读 · 0 评论 -
hdu2112 HDU Today(最短路)
HDU TodayTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17191 Accepted Submission(s): 4052Problem Description经过锦囊相助,海东集团终于度过了危机原创 2015-04-23 10:51:55 · 522 阅读 · 0 评论 -
poj3268 Silver Cow Party(最短路变形)
Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13243 Accepted: 5959DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently原创 2015-01-04 18:12:35 · 632 阅读 · 0 评论 -
poj3159 Candies(SPFA+stack)
CandiesTime Limit: 1500MS Memory Limit: 131072KTotal Submissions: 23664 Accepted: 6409DescriptionDuring the kindergarten days, flymouse was the monitor of his c原创 2015-01-06 15:39:47 · 528 阅读 · 0 评论 -
poj2240 Arbitrage(bellman)
ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16371 Accepted: 6877DescriptionArbitrage is the use of discrepancies in currency exchange rates原创 2015-01-05 22:30:47 · 506 阅读 · 0 评论 -
poj3660 Cow Contest(Floy判关系)
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7198 Accepted: 3979DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participa原创 2015-01-05 16:35:44 · 652 阅读 · 0 评论 -
poj1502 MPI Maelstrom(最短路中的最大值)
MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5710 Accepted: 3551DescriptionBIT has recently taken delivery of their new supercomputer, a原创 2015-01-05 15:46:36 · 533 阅读 · 0 评论 -
poj1797 Heavy Transportation(最短路变形)
Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 21274 Accepted: 5646DescriptionBackground Hugo Heavy is happy. After the breakdown原创 2015-01-04 17:08:20 · 523 阅读 · 0 评论 -
poj1062 昂贵的聘礼(最短路变形)
昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37924 Accepted: 10958Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给原创 2015-01-06 21:09:06 · 575 阅读 · 0 评论 -
uva 10600 ACM Contest and Blackout(次小生成树)
Problem AACM CONTEST AND BLACKOUT In order to prepare the “The First National ACM School Contest”(in 20??) the major of the city decided to provide all the schools with a reliable source of po原创 2015-01-25 16:56:49 · 788 阅读 · 0 评论 -
杭电3549 Flow Problem(最大流Dinic+前向星模板)
Flow ProblemTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 8276 Accepted Submission(s): 3849Problem DescriptionNetwork flow is a原创 2014-09-26 11:52:51 · 899 阅读 · 0 评论 -
poj3164 Command Network(最小树形图)
Command NetworkTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 12893 Accepted: 3737DescriptionAfter a long lasting war on words, a war on arms finall原创 2014-09-02 17:51:09 · 624 阅读 · 0 评论 -
poj1273 Drainage Ditches(最大流入门 EK+Dinic模板)
Drainage DitchesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 56697 Accepted: 21784DescriptionEvery time it rains on Farmer John's fields, a pond form原创 2014-09-10 23:15:32 · 645 阅读 · 0 评论 -
杭电4009 Transfer water(最小树形图)
Transfer waterTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 3853 Accepted Submission(s): 1380Problem DescriptionXiaoA lives in原创 2014-09-11 21:16:59 · 760 阅读 · 0 评论