ACM_其他图论
LzyRapX
Just For Fun .
展开
-
Codeforces Round #362 (Div. 1) A. Lorenzo Von Matterhorn(map&LCA)
A. Lorenzo Von Matterhorntime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBarney lives in NYC. NYC has infin原创 2016-08-17 18:40:30 · 414 阅读 · 0 评论 -
Educational Codeforces Round 15 E. Analysis of Pathes in Functional Graph (倍增RMQ)
E. Analysis of Pathes in Functional Graphtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou are given a f原创 2016-08-18 23:09:17 · 562 阅读 · 0 评论 -
Codeforces Round #366 (Div. 1) B. Ant Man (贪心)
B. Ant Mantime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputScott Lang is at war with Darren Cross. There ar原创 2016-08-15 22:10:15 · 1050 阅读 · 0 评论 -
Codeforces Round #368 (Div. 2) B. Bakery (水题)
B. Bakerytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMasha wants to open her own bakery and bake muffi原创 2016-08-21 22:48:55 · 956 阅读 · 0 评论 -
求无向连通图的割点(图论)
1. 割点与连通度在无向连通图中,删除一个顶点v及其相连的边后,原图从一个连通分量变成了两个或多个连通分量,则称顶点v为割点,同时也称关节点(Articulation Point)。一个没有关节点的连通图称为重连通图(biconnected graph)。若在连通图上至少删去k 个顶点才能破坏图的连通性,则称此图的连通度为k。关节点和重连通图在实际中较多应用。显然,一个表示通信原创 2016-06-06 19:29:41 · 2132 阅读 · 2 评论 -
Codeforces Round #369 (Div. 2) A~D
A. Bus to Udaylandtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris the Baboon are tr原创 2016-09-04 02:55:04 · 1106 阅读 · 1 评论 -
CSU 1804: 有向无环图 (拓扑排序)
题目链接:点击打开链接1804: 有向无环图Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 421 Solved: 186[Submit][Status][Web Board]DescriptionBobo 有一个 n 个点,m 条边的有向无环图(即对于任意点 v,不存在从点 v 开始、点 v 结束的路原创 2016-12-09 00:02:10 · 1549 阅读 · 0 评论