![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
强连通
mengxiang000000
这个作者很懒,什么都没留下…
展开
-
Codeforces 876E National Property【思维建图+2-sat+输出可行解】好题~
E. National Propertytime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou all know that the Library of Bookla原创 2017-10-17 15:54:28 · 551 阅读 · 0 评论 -
Codeforces 427C Checkposts【Tarjan强连通+缩点染色】
C. Checkpoststime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYour city has n junctions. There are m one-way roads原创 2016-10-12 21:13:22 · 814 阅读 · 0 评论 -
Poj 3207 Ikki's Story IV - Panda's Trick【2-sat-------Tarjan强连通】
Ikki's Story IV - Panda's TrickTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 9609 Accepted: 3525Descriptionliympanda, one of Ikki’s friend, likes原创 2016-09-03 14:10:17 · 391 阅读 · 0 评论 -
hdu 1824 Let's go home【2-SAT------强连通Tarjan】
Let's go homeTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1795 Accepted Submission(s): 753Problem Description小时候,乡愁是一枚小小的邮票,我原创 2016-06-23 15:30:39 · 337 阅读 · 0 评论 -
hdu 3062 Party【2-SAT入门---强连通Tarjan+染色缩点】
PartyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5548 Accepted Submission(s): 1806Problem Description有n对夫妻被邀请参加一个聚会,因为场地的问题,每原创 2016-06-23 14:32:33 · 1206 阅读 · 0 评论 -
hdu 4421 Bit Magic【2--Sat----------Tarjan强连通】
Bit MagicTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3101 Accepted Submission(s): 875Problem DescriptionYesterday, my teacher原创 2016-07-07 20:04:27 · 358 阅读 · 0 评论 -
Fzu 1719 Spy Network【最小点基----Tarjan强连通】
Problem 1719 Spy NetworkAccept: 74 Submit: 263Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionDue to the large number of infiltration of foreign espionage, nationa原创 2016-07-05 21:30:16 · 866 阅读 · 0 评论 -
Poj 2749 Building roads【二分+2-Sat----------Tarjan强连通】
Building roadsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7148 Accepted: 2434DescriptionFarmer John's farm has N barns, and there原创 2016-07-15 15:44:39 · 428 阅读 · 0 评论 -
hdu 3622 Bomb Game【2-SAT-------Tarjan强连通】
Bomb GameTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4949 Accepted Submission(s): 1769Problem DescriptionRobbie is playing a原创 2016-07-03 11:47:34 · 646 阅读 · 0 评论 -
hdu 3639 Hawk-and-Chicken【强联通Tarjan+Dfs】
Hawk-and-ChickenTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2710 Accepted Submission(s): 815Problem DescriptionKids in kinder原创 2016-06-16 00:44:43 · 828 阅读 · 0 评论 -
hrbust 1797 Fly【Tarjan强连通+缩点染色+最长路SPFA】好题~
FlyTime Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 17(12 users)Total Accepted: 11(11 users)Rating: Special Judge: NoDescriptionLuck want原创 2016-11-03 21:37:41 · 335 阅读 · 0 评论 -
hdu 5934 Bomb【最小点基----Tarjan强连通+缩点染色】
BombTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionThere are N bombs needing exp原创 2016-10-29 16:26:04 · 1535 阅读 · 2 评论 -
51nod 1456 小K的技术【强连通Tarjan+缩点染色+并查集】好题~
1456 小K的技术题目来源: CodeForces基准时间限制:1 秒 空间限制:131072 KB 分值: 80 难度:5级算法题苏塞克王国是世界上创新技术的领先国家,在王国中有n个城市,标记为1到n。由于小K的研究,我们最终能过在两个城市之间建立传输管道,一个传输管道能单向连接两个城市,即,一个从城市x到城市y的传输管道不能被用于从城市y传输到原创 2016-12-15 15:04:21 · 873 阅读 · 3 评论 -
Hdu 2767 Proving Equivalences【强联通-Kosaraju+思维】
Proving EquivalencesTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5168 Accepted Submission(s): 1807Problem DescriptionC原创 2017-09-09 23:40:50 · 349 阅读 · 0 评论 -
Hdu 6165 FFF at Valentine【Tarjan强连通+暴搜】
FFF at ValentineTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 104 Accepted Submission(s): 45Problem DescriptionAt Valen原创 2017-08-22 18:48:22 · 461 阅读 · 0 评论 -
Hdu 6038 Function【思维+强连通找环】
FunctionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Problem DescriptionYou are given a permu原创 2017-07-25 17:03:24 · 604 阅读 · 0 评论 -
玲珑学院OJ 1130 - 喵哈哈村的魔法大师╳灬兲笙疯癫°月【强连通+可相交最小路径覆盖+背包】
1130 - 喵哈哈村的魔法大师╳灬兲笙疯癫°月Time Limit:1s Memory Limit:256MByteSubmissions:196Solved:23DESCRIPTION╳灬兲笙疯癫°月是月大叔的ID,他是一个掌握着429种魔法的魔法大师,最擅长的技能就是搞事,今天他又要开始搞事了。现在有一个由n个点,m条边组成的有原创 2017-06-02 11:39:18 · 584 阅读 · 0 评论 -
SDUT 3262 Circle of Friends【强连通Tarjan+缩点染色+最短路SPFA】
Circle of FriendsTime Limit: 2000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem DescriptionNowadays, "Circle of Friends" is a very popular social networking platform in WeChat原创 2017-04-29 17:28:51 · 470 阅读 · 0 评论 -
Codeforces Round #400 (Div. 1 + Div. 2, combined)D. The Door Problem【2-sat Tarjan+思维建图】
D. The Door Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMoriarty has trapped n people in n dist原创 2017-02-24 12:43:45 · 499 阅读 · 0 评论 -
Hrbust 2048 Thrall’s Dream【强连通+拓扑排序+思维】好题!
Thrall’s DreamTime Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 70(21 users)Total Accepted: 18(13 users)Rating: Special Judge: NoDescription原创 2017-01-26 19:12:02 · 490 阅读 · 0 评论 -
LightOJ 1251 Forming the Council【2-Sat+逆向拓扑排序输出可行解】好题!
1251 - Forming the Council PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBIn a city there are n voters, and m people formed the原创 2017-01-22 18:08:48 · 491 阅读 · 1 评论 -
BZOJ 1924 所驼门王的宝藏【思维建图+强连通缩点+DAG图上做最长路】这题好尼玛综合........
1924: [Sdoi2010]所驼门王的宝藏Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 913 Solved: 379[Submit][Status][Discuss]DescriptionInput第一行给出三个正整数 N, R, C。 以下 N 行,每行给出一扇传送门的信息,包含三个正整数xi, yi原创 2017-02-08 21:55:24 · 622 阅读 · 0 评论 -
hdu 4115 Eliminate the Conflict【2-SAT---------Tarjan强连通】
Eliminate the ConflictTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2130 Accepted Submission(s): 921Problem DescriptionConflict原创 2016-07-01 14:45:24 · 825 阅读 · 1 评论 -
hdu 4635 Strongly connected【强连通Kosaraju+缩点染色+思维】
Strongly connectedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2388 Accepted Submission(s): 1004Problem DescriptionGive a simp原创 2016-07-24 14:32:30 · 636 阅读 · 0 评论 -
Poj 2723 Go Deeper【2-SAT-----Tarjan强连通+二分】
Go DeeperTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2860 Accepted Submission(s): 916Problem DescriptionHere is a procedure's原创 2016-06-27 13:45:34 · 615 阅读 · 0 评论 -
POJ 2762 Going from u to v or from v to u?【强连通Kosaraju+拓扑排序】
Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16457 Accepted: 4382DescriptionIn order to make their原创 2016-06-10 18:01:09 · 958 阅读 · 0 评论 -
hdu 3861 The King’s Problem【强连通Kosaraju+最小路径覆盖】
The King’s ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2552 Accepted Submission(s): 917Problem DescriptionIn the Kingd原创 2016-06-10 16:12:06 · 679 阅读 · 0 评论 -
POJ 1236 Network of Schools【强连通Kosaraju+缩点+思维】
Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15028 Accepted: 5984DescriptionA number of schools are connected to原创 2016-06-09 18:21:19 · 881 阅读 · 1 评论 -
hdu 3836 Equivalent Sets【强连通Kosaraju+缩点染色】
Equivalent SetsTime Limit: 12000/4000 MS (Java/Others) Memory Limit: 104857/104857 K (Java/Others)Total Submission(s): 3889 Accepted Submission(s): 1379Problem DescriptionTo prove tw原创 2016-06-09 17:22:52 · 536 阅读 · 0 评论 -
Poj 3905 Perfect Election【2-SAT-------Tarjan强连通】
Perfect ElectionTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1382 Accepted: 536DescriptionIn a country (my memory fails to say whic原创 2016-06-25 17:01:16 · 341 阅读 · 0 评论 -
Poj 3678 Katu Puzzle【2-SAT----Tarjan强连通】
Katu PuzzleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9200 Accepted: 3422DescriptionKatu Puzzle is presented as a directed graph原创 2016-06-25 15:16:47 · 559 阅读 · 0 评论 -
POJ 2186 Popular Cows【强连通Kosaraju+缩点】
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 29593 Accepted: 11981DescriptionEvery cow's dream is to become the most po原创 2016-06-08 16:30:57 · 923 阅读 · 0 评论 -
Poj 2553 The Bottom of a Graph【强连通Kosaraju+缩点染色】
The Bottom of a GraphTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 10092 Accepted: 4173DescriptionWe will use the following (standar原创 2016-06-12 15:54:41 · 332 阅读 · 0 评论 -
hdu 1827 Summer Holiday【强连通Kosaraju+缩点染色+思维】
Summer HolidayTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2714 Accepted Submission(s): 1270Problem DescriptionTo see a World原创 2016-06-12 16:54:57 · 838 阅读 · 0 评论 -
Poj 2723 Get Luffy Out【2-SAT---------Tarjan强连通】
Get Luffy OutTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8270 Accepted: 3190DescriptionRatish is a young man who always dreams of原创 2016-06-28 15:03:17 · 359 阅读 · 0 评论 -
Poj 3592 Instantaneous Transference【强连通Tarjan+染色缩点+SPFA】
Instantaneous TransferenceTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6367 Accepted: 1439DescriptionIt was long ago when we played原创 2016-06-15 18:01:51 · 614 阅读 · 0 评论 -
Poj 2533 The Bottom of a Graph【强连通Tarjan】
The Bottom of a GraphTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 10099 Accepted: 4175DescriptionWe will use the following (standar原创 2016-06-14 16:25:33 · 675 阅读 · 0 评论 -
Poj 3160 Father Christmas flymouse【强连通Tarjan+SPFA+超级源点】
Father Christmas flymouseTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 3134 Accepted: 1059DescriptionAfter retirement as contestant原创 2016-06-14 13:02:50 · 794 阅读 · 0 评论 -
hdu 1269 迷宫城堡【强连通Tarjan】
迷宫城堡Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11917 Accepted Submission(s): 5346Problem Description为了训练小希的方向感,Gardon建立了一座大城原创 2016-06-14 10:37:28 · 696 阅读 · 0 评论 -
Poj 3180 The Cow Prom【求强连通分量中元素个数大于1的个数】
The Cow PromTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1648 Accepted: 1029DescriptionThe N (2 Only cows can perform the Round原创 2016-06-13 15:01:32 · 981 阅读 · 0 评论