强连通 双连通 LCA
文章平均质量分 85
KinFungYu
前SCAU ACM校队队员
展开
-
hdu 3836 Equivalent Sets(SCC,Kosaraju算法)
Equivalent SetsTime Limit: 12000/4000 MS (Java/Others) Memory Limit: 104857/104857 K (Java/Others)Total Submission(s): 1951 Accepted Submission(s): 659Problem DescriptionTo prove原创 2013-07-30 23:53:01 · 700 阅读 · 0 评论 -
poj 1438 One-way Traffic(混合图改有向图)
One-way TrafficTime Limit: 10000MS Memory Limit: 10000KTotal Submissions: 487 Accepted: 167 Special JudgeDescriptionIn a certain town there are n intersections原创 2013-08-23 14:19:00 · 1062 阅读 · 0 评论 -
hdu 3639 Hawk-and-Chicken(缩点+树dp)
Hawk-and-ChickenTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1418 Accepted Submission(s): 395Problem DescriptionKids in ki原创 2013-08-12 15:05:04 · 1076 阅读 · 0 评论 -
hdu 3594 Cactus(仙人掌图)
CactusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 887 Accepted Submission(s): 410Problem Description1. It is a Strongly C原创 2013-08-12 23:52:44 · 887 阅读 · 0 评论 -
poj 2186 Popular Cows(找出度为0的点)
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20288 Accepted: 8236DescriptionEvery cow's dream is to become the most popular cow in the herd原创 2013-08-14 14:24:42 · 768 阅读 · 0 评论 -
poj 2762 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: 12804 Accepted: 3311DescriptionIn order to make their sons brave, Jiajia原创 2013-08-14 17:43:19 · 688 阅读 · 0 评论 -
poj 3114 Countries in War(缩点+最短路)
Countries in WarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1932 Accepted: 607DescriptionIn the year 2050, after different attempts of the UN to mai原创 2013-08-14 23:34:48 · 752 阅读 · 0 评论 -
hdu 4685 Prince and Princess(最大匹配+强连通)
Prince and PrincessTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 263 Accepted Submission(s): 82Problem DescriptionThere are原创 2013-08-16 14:23:48 · 1126 阅读 · 0 评论 -
poj 3592 Instantaneous Transference(强连通+最长路)
Instantaneous TransferenceTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5076 Accepted: 1103DescriptionIt was long ago when we played the game Red Al原创 2013-08-16 20:07:07 · 812 阅读 · 0 评论 -
hdu 3849 By Recognizing These Guys, We Find Social Networks Useful(双连通求桥)
By Recognizing These Guys, We Find Social Networks UsefulTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1456 Accepted Submission(s): 39原创 2013-08-18 12:30:46 · 806 阅读 · 0 评论 -
poj 3177 Redundant Paths(构造边双连通)
Redundant PathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7598 Accepted: 3313DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing f原创 2013-08-18 17:39:54 · 712 阅读 · 0 评论 -
poj 1515 Street Directions(无向图改有向图)
Street DirectionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 586 Accepted: 316 Special JudgeDescriptionAccording to the Automobile Collision Monit原创 2013-08-22 21:53:16 · 989 阅读 · 0 评论 -
hdu 1269 迷宫城堡(tarjan模版)
迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5127 Accepted Submission(s): 2261Problem Description为了训练小希的方向感,Gardon建立了一座大城堡原创 2013-08-09 15:33:39 · 1132 阅读 · 0 评论 -
hdu 1827 Summer Holiday(传递的最小费用)
Summer HolidayTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1190 Accepted Submission(s): 529Problem DescriptionTo see a World原创 2013-08-09 16:56:35 · 859 阅读 · 0 评论 -
hdu 3861 The King’s Problem(缩点+最小路径覆盖)
The King’s ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1205 Accepted Submission(s): 453Problem DescriptionIn the Kingd原创 2013-08-04 22:57:14 · 923 阅读 · 0 评论 -
poj 1904 King's Quest(强连通)
King's QuestTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 6358 Accepted: 2225Case Time Limit: 2000MSDescriptionOnce upon a time there lived a kin原创 2013-08-05 22:39:46 · 943 阅读 · 0 评论 -
hdu 2586 How far away ?(LCA 求两点距离)
How far away ?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3252 Accepted Submission(s): 1222Problem DescriptionThere are n原创 2013-08-18 20:35:16 · 788 阅读 · 0 评论 -
poj 1330 Nearest Common Ancestors(求LCA)
Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14763 Accepted: 7884DescriptionA rooted tree is a well-known data structure in com原创 2013-08-19 15:45:15 · 682 阅读 · 0 评论 -
poj 1470 Closest Common Ancestors(tarjan离线求lca)
Closest Common AncestorsTime Limit: 2000MS Memory Limit: 10000KTotal Submissions: 13257 Accepted: 4310DescriptionWrite a program that takes as input a rooted tree a原创 2013-08-19 16:39:57 · 778 阅读 · 0 评论 -
poj 1986 Distance Queries(LCA求两点距离模版)
Distance QueriesTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 7673 Accepted: 2702Case Time Limit: 1000MSDescriptionFarmer John's cows refused to r原创 2013-08-19 22:07:02 · 995 阅读 · 0 评论 -
poj 3417 Network(统计边被环覆盖的次数)
NetworkTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3460 Accepted: 984DescriptionYixght is a manager of the company called SzqNetwork(SN). Now she'原创 2013-08-21 13:30:00 · 863 阅读 · 0 评论 -
poj 3694 Network(双连通求桥+lca)
NetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 5874 Accepted: 2052DescriptionA network administrator manages a large network. The network cons原创 2013-08-21 15:07:17 · 951 阅读 · 0 评论 -
hdu 2242 考研路茫茫——空调教室
考研路茫茫——空调教室Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1663 Accepted Submission(s): 486Problem Description众所周知,HDU的考研教室是没原创 2013-08-21 22:33:11 · 1346 阅读 · 0 评论 -
hdu 2767 Proving Equivalences(至少加几条边让整个图变成强连通)
Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2088 Accepted Submission(s): 796Problem DescriptionConsider t原创 2013-08-09 16:29:42 · 766 阅读 · 0 评论 -
ural 1750 Tree 2(树的直径 + 倍增)
Tree 2Time Limit: 1000MS Memory Limit: 65536KB 64bit IO Format: %I64d & %I64u[Submit] [Go Back] [Status] DescriptionConsider a tree consisting of n verti原创 2014-08-27 00:48:17 · 789 阅读 · 0 评论