ACM 图论----拓扑
文章平均质量分 84
青山绿水之辈
奋斗青春年华
展开
-
ZOJ3524Crazy Shopping(完全背包+拓扑排序)经典
H - Crazy ShoppingTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionBecause of the 90th anniversary of the Coherent & Cute Patchouli原创 2015-01-17 22:43:35 · 1453 阅读 · 0 评论 -
POJ1128 Frame Stacking(拓扑排序)经典
Frame StackingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4454 Accepted: 1509DescriptionConsider the following 5 picture frames placed on an 9 x 8 a原创 2015-04-28 21:24:16 · 805 阅读 · 0 评论 -
POJ3553 Task schedule (拓扑排序+优先队列)经典
Task scheduleTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 306 Accepted: 193 Special JudgeDescriptionThere are n preemptive jobs to be processed o原创 2015-04-28 00:09:11 · 1593 阅读 · 0 评论 -
HDU3231 Box Relations(拓扑排序)经典
Box RelationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1042 Accepted Submission(s): 389Special JudgeProblem DescriptionTher原创 2015-05-01 00:13:00 · 1343 阅读 · 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: 15196 Accepted: 4013DescriptionIn order to make their sons brave, Jiaji原创 2015-04-27 17:16:44 · 927 阅读 · 0 评论 -
POJ1270 Following Orders(拓扑排序)
Following OrdersTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4059 Accepted: 1623DescriptionOrder is an important concept in mathematics and in comput原创 2015-04-29 13:38:22 · 853 阅读 · 0 评论 -
POJ1420 Spreadsheet(拓扑排序)注意的是超内存
SpreadsheetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 617 Accepted: 290DescriptionIn 1979, Dan Bricklin and Bob Frankston wrote VisiCalc, the first原创 2015-04-29 21:46:16 · 1142 阅读 · 0 评论 -
CSU1580: Outing(强连通+拓扑排序+dp)
DescriptionInputOutputSample Input4 41 2 3 4Sample Output4HINTSourceNCPC 2014#include#include#includeusing namespace原创 2015-04-26 19:14:32 · 853 阅读 · 0 评论 -
HDU 2094产生冠军(拓扑排序)
产生冠军Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10374 Accepted Submission(s): 4857Problem Description有一群人,打乒乓球比赛,两两捉对撕杀,每两个人之原创 2015-04-21 19:48:23 · 817 阅读 · 0 评论 -
HDU3342 Legal or Not(拓扑排序)
Legal or NotTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5152 Accepted Submission(s): 2360Problem DescriptionACM-DIY is a larg原创 2015-04-21 22:11:37 · 683 阅读 · 0 评论 -
HDU2647 Reward(拓扑排序)反向建图
RewardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4638 Accepted Submission(s): 1416Problem DescriptionDandelion's uncle is a原创 2015-04-21 21:45:48 · 779 阅读 · 0 评论 -
HDU1285 确定比赛名次(拓扑排序)
确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14558 Accepted Submission(s): 5814Problem Description有N个比赛队(1 Input原创 2015-04-21 19:19:16 · 733 阅读 · 0 评论 -
POJ3687 Labeling Balls (拓扑排序)经典
Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11469 Accepted: 3295DescriptionWindy has N balls of distinct weights from 1 unit to N un原创 2015-04-24 17:27:00 · 825 阅读 · 0 评论 -
POJ 3660Cow Contest(并查集+拓扑排序)
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7567 Accepted: 4206DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participa原创 2015-04-22 22:16:54 · 1334 阅读 · 0 评论 -
POJ1094 Sorting It All Out(拓扑排序)每输入条关系判断一次
Sorting It All OutTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29182 Accepted: 10109DescriptionAn ascending sorted sequence of distinct values is one原创 2015-04-22 14:19:02 · 736 阅读 · 0 评论 -
POJ 2367 Genealogical tree(拓扑排序)
Genealogical treeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3332 Accepted: 2233 Special JudgeDescriptionThe system of Martians' blood relations i原创 2015-04-22 15:28:12 · 745 阅读 · 0 评论 -
HDU1811Rank of Tetris(并查集+拓扑排序)
Rank of TetrisTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5683 Accepted Submission(s): 1622Problem Description自从Lele开发了Rating原创 2015-03-07 00:01:01 · 1094 阅读 · 0 评论 -
HNU13247Connected Caves (拓扑)
Connected CavesTime Limit: 2000ms, Special Time Limit:5000ms,Memory Limit:65536KBTotal submit users: 6, Accepted users:5Problem 13247 : Special judgeProblem description原创 2015-03-21 17:42:18 · 1128 阅读 · 2 评论 -
HDU 3191How Many Paths Are There(TOPE排序 求次短路及条数)
How Many Paths Are ThereTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1266 Accepted Submission(s): 437Problem Description oooc原创 2015-07-18 15:07:39 · 1045 阅读 · 0 评论