Home
Problem
Status
Contest
Workbook
User
Group
Forum
Register
Login
{"workbook":{"problemsBrief":"{\"洛谷-P2921\":[\"Trick or Treat on the Farm G\",7995,\"USACO08DEC\"],\"洛谷-P2746\":[\"校园网Network of Schools\",12058,\"USACO5.3\"],\"CodeForces-1213F\":[\"Unstable String Sort\",2443,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1213\\\"\\u003eCodeforces Round 582 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-427C\":[\"Checkposts\",14125,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/427\\\"\\u003eCodeforces Round 244 (Div. 2)\\u003c/a\\u003e\"],\"CodeForces-949C\":[\"Data Center Maintenance\",2087,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/949\\\"\\u003eCodeforces Round 469 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-700C\":[\"Break Up\",1282,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/700\\\"\\u003eCodeforces Round 364 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-732F\":[\"Tourist Reform\",2396,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/732\\\"\\u003eCodeforces Round 377 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P8435\":[\"点双连通分量\",8432,\"模板\"],\"CodeForces-762F\":[\"Tree nesting\",388,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/762\\\"\\u003eEducational Codeforces Round 17\\u003c/a\\u003e\"],\"CodeForces-770C\":[\"Online Courses In BSU\",2891,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/770\\\"\\u003eVK Cup 2017 - Qualification 2\\u003c/a\\u003e\"],\"洛谷-P8436\":[\"边双连通分量\",8898,\"模板\"],\"CodeForces-962F\":[\"Simple Cycles Edges\",1372,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/962\\\"\\u003eEducational Codeforces Round 42 (Rated for Div. 2)\\u003c/a\\u003e\"],\"洛谷-P2272\":[\"最大半连通子图\",4902,\"ZJOI2007\"],\"洛谷-P1262\":[\"间谍网络\",11089,null],\"洛谷-P3388\":[\"割点(割顶)\",42092,\"模板\"],\"CodeForces-97E\":[\"Leaders\",428,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/97\\\"\\u003eYandex.Algorithm 2011: Finals\\u003c/a\\u003e\"],\"洛谷-P3225\":[\"矿场搭建\",7557,\"HNOI2012\"],\"CodeForces-1137C\":[\"Museums Tour\",1234,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1137\\\"\\u003eCodeforces Round 545 (Div. 1)\\u003c/a\\u003e\"],\"洛谷-P2656\":[\"采蘑菇\",3513,null],\"洛谷-P2515\":[\"软件安装\",5369,\"HAOI2010\"],\"CodeForces-402E\":[\"Strictly Positive Matrix\",2256,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/402\\\"\\u003eCodeforces Round 236 (Div. 2)\\u003c/a\\u003e\"],\"洛谷-P1407\":[\"稳定婚姻\",5651,\"国家集训队\"],\"洛谷-P1626\":[\"象棋比赛\",6403,null],\"CodeForces-1000E\":[\"We Need More Bosses\",4250,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1000\\\"\\u003eEducational Codeforces Round 46 (Rated for Div. 2)\\u003c/a\\u003e\"],\"CodeForces-1763E\":[\"Node Pairs\",1718,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1763\\\"\\u003eCodeforces Round 840 (Div. 2) and Enigma 2022 - Cybros LNMIIT\\u003c/a\\u003e\"],\"CodeForces-1547G\":[\"How Many Paths?\",2957,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1547\\\"\\u003eCodeforces Round 731 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-1133F2\":[\"Spanning Tree with One Fixed Degree\",3190,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1133\\\"\\u003eCodeforces Round 544 (Div. 3)\\u003c/a\\u003e\"],\"洛谷-P7251\":[\"强连通图\",858,\"JSOI2014\"],\"CodeForces-1914G2\":[\"Light Bulbs (Hard Version)\",1221,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/1914\\\"\\u003eCodeforces Round 916 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-999E\":[\"Reachability from the Capital\",6953,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/999\\\"\\u003eCodeforces Round 490 (Div. 3)\\u003c/a\\u003e\"],\"CodeForces-555E\":[\"Case of Computer Network\",2384,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/555\\\"\\u003eCodeforces Round 310 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-521E\":[\"Cycling City\",1024,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/521\\\"\\u003eCodeforces Round 295 (Div. 1)\\u003c/a\\u003e\"],\"CodeForces-652E\":[\"Pursuit For Artifacts\",2107,\"\\u003ca style\\u003d\\\"color: black\\\" href\\u003d\\\"https://codeforces.com/contest/652\\\"\\u003eEducational Codeforces Round 10\\u003c/a\\u003e\"],\"洛谷-P2341\":[\"受欢迎的牛 G\",28897,\"USACO03FALL / HAOI2006\"],\"洛谷-P5058\":[\"嗅探器\",5486,\"ZJOI2004\"]}","joined":false,"groups":{}},"managingGroups":{},"author":"Exile_code","updateTime":1712885497000,"title":"进阶图论(连通性系列题目)","dislikeCnt":0,"content":"一、相关视频:\n(1)[D14 强连通分量 Tarjan 算法](https://www.bilibili.com/video/BV1SY411M7Tv?vd_source\u003daffb7616e4b4bb9edc2495f2da9d64e9)\n二、相关文章:\n(1)[tarjan算法求解强连通分量](https://www.cnblogs.com/ljy-endl/p/11562352.html)\n三、刷题:\n### 1.强连通分量\n[problem:CodeForces-770C]1500 dfs\"在栈否\"先导题\n[problem:CodeForces-427C]1700 缩点的权值累计\n[problem:洛谷-P2341]绿 缩点与出入度结合\n[problem:洛谷-P2921]绿 缩点与反向建边\n[problem:CodeForces-949C]1900 思维,数值转化建边\n[problem:CodeForces-1133F2]1900 强连通分量的数量讨论\n[problem:CodeForces-999E]2000 缩点与出入度结合,类似P2341\n[problem:CodeForces-1547G]2100 实际是拓扑排序的题\n[problem:CodeForces-1213F]2100 缩点+拓扑排序\n[problem:CodeForces-402E]2200\n[problem:洛谷-P2656]蓝 缩点+权值处理+简单dp\n[problem:洛谷-P1262]蓝\n[problem:洛谷-P2746]蓝\n[problem:洛谷-P7251]蓝\n[problem:洛谷-P1407]蓝\n[problem:洛谷-P2515]蓝\n[problem:CodeForces-1914G2]2300\n[problem:洛谷-P2272]紫\n[problem:CodeForces-1137C]2500\n### 2.双连通分量\n[problem:洛谷-P1626]【模板】割边\n[problem:洛谷-P3388]【模板】割点(割顶)\n[problem:洛谷-P8436]【模板】边双连通分量\n[problem:洛谷-P8435]【模板】点双连通分量\n[problem:CodeForces-1000E] 2100\n[problem:CodeForces-1763E]2200\n[problem:CodeForces-97E]2200\n[problem:CodeForces-652E] 2300\n[problem:CodeForces-732F]2300\n[problem:CodeForces-962F]2400\n[problem:CodeForces-700C]2600\n[problem:洛谷-P3225]紫\n[problem:洛谷-P5058]紫\n[problem:CodeForces-555E] 2800\n[problem:CodeForces-762F]2800\n[problem:CodeForces-521E]3100\n### 3.圆方树\n","threadId":189072,"likeCnt":1,"createTime":1712557595000,"isWorkbook":true,"viewCnt":155,"openness":2,"fav":false,"id":4839,"trustable":false}