强联通分量
关注
分享
扫一扫
文章平均质量分 87
阿阿阿阿_欢
勿忘初心
展开
-
HDU 1269 -- 迷宫城堡【有向图求SCC的数目 && 模板】
迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9893 Accepted Submission(s): 4433Problem Description为了训练小希的方向感，Gardon建立了一座大城堡原创 2015-08-19 09:15:23 · 939 阅读 · 0 评论 -
POJ 3592--Instantaneous Transference【SCC缩点新建图 && SPFA求最长路 && 经典】
Instantaneous TransferenceTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6177 Accepted: 1383DescriptionIt was long ago when we played the game Red Al原创 2015-08-21 14:10:53 · 1608 阅读 · 0 评论 -
POJ 3126 --Father Christmas flymouse【scc缩点构图 && SPFA求最长路】
Father Christmas flymouseTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 3007 Accepted: 1021DescriptionAfter retirement as contestant from WHU ACM原创 2015-08-20 18:02:34 · 932 阅读 · 1 评论 -
POJ 1904--King's Quest 【经典建模 && SCC】
题意：有n个王子，每个王子都有k个喜欢的妹子，每个王子只能和喜欢的妹子结婚，大臣给出一个匹配表，每个王子都和一个妹子结婚，但是国王不满意，他要求大臣给他另一个表，每个王子可以和几个妹子结婚，按序号升序输出妹子的编号，这个表应满足所有的王子最终都有妹子和他结婚。解析：好经典的图论题，还以是为二分匹配问题，但是枚举+二分匹配肯定会超时，回来看大牛的解析发现竟然用强联通，瞬间膜拜了。首先建图，如果王子u喜欢妹子v，则建一条边u指向v(u,v)，对于大臣给出的初始完美匹配，如果王子u和妹子v结婚，则建一条边原创 2015-09-24 17:40:59 · 509 阅读 · 0 评论 -
HDU 3072--Intelligence System【SCC缩点新构图 && 求连通所有SCC的最小费用】
Intelligence SystemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1859 Accepted Submission(s): 799Problem DescriptionAfter a day原创 2015-08-21 18:09:59 · 991 阅读 · 0 评论 -
POJ 2553--The Bottom of a Graph【scc缩点构图 && 求出度为0的scc && 输出scc中的点】
The Bottom of a GraphTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9575 Accepted: 3984DescriptionWe will use the following (standard) definitions fr原创 2015-08-20 09:20:38 · 715 阅读 · 0 评论 -
HDU 3861--The King’s Problem【scc缩点构图 && 二分匹配求最小路径覆盖】
The King’s ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2137 Accepted Submission(s): 763Problem DescriptionIn the Kingd原创 2015-08-21 09:29:11 · 1115 阅读 · 0 评论 -
POJ 1236--Network of Schools【scc缩点构图 && 求scc入度为0的个数 && 求最少加几条边使图变成强联通】
Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13325 Accepted: 5328DescriptionA number of schools are connected to a computer netwo原创 2015-08-20 11:10:04 · 1189 阅读 · 0 评论 -
HDU 3836--Equivalent Sets【求有向图最少增加多少边使图强连通 && Scc缩点新建图】
Equivalent SetsTime Limit: 12000/4000 MS (Java/Others) Memory Limit: 104857/104857 K (Java/Others)Total Submission(s): 3502 Accepted Submission(s): 1211Problem DescriptionTo prove tw原创 2015-08-19 21:27:02 · 623 阅读 · 0 评论 -
HDU 2767--Proving Equivalences【scc缩点构图 && 求向图中最少增加多少条边才可以使新图强连通】
Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4129 Accepted Submission(s): 1466Problem DescriptionConsider原创 2015-08-19 17:35:50 · 1243 阅读 · 0 评论 -
POJ 2762--Going from u to v or from v to u?【scc缩点新建图 && 判断是否是弱连通图】
Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15755 Accepted: 4172DescriptionIn order to make their sons brave, Jia原创 2015-08-19 12:35:03 · 786 阅读 · 0 评论 -
POJ 2186 -- Popular Cows【强连通分支 && Tarjan缩点】
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 27198 Accepted: 10963DescriptionEvery cow's dream is to become the most popular cow in the原创 2015-08-19 16:41:18 · 720 阅读 · 0 评论 -
HDU 1827--Summer Holiday【强连通缩点新建图】
Summer HolidayTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2199 Accepted Submission(s): 1023Problem DescriptionTo see a World原创 2015-08-19 11:14:21 · 588 阅读 · 0 评论 -
HPU 3639--Hawk-and-Chicken【SCC缩点反向建图 && 求传递的最大值】
Hawk-and-ChickenTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2409 Accepted Submission(s): 712Problem DescriptionKids in kinder原创 2015-08-22 01:14:57 · 2858 阅读 · 4 评论