weixin_43179892的博客

洛谷 P3388 【模板】割点 （targan求割点模板) 题目描述 给出一个nn个点，mm条边的无向图，求图的割点。 输入格式 第一行输入n,mn,m 下面mm行每行输入x,yx,y表示xx到yy有一条边 输出格式 第一行输出割点个数 第二行按照节点编号从小到大输出节点，用空格隔开 输入输出样例 输入 #1 复制 6 7 1 2 1 3 1 4 2 5 3 5 4 5 5 6 输出 #1 复制 ...

洛谷 P2921 在农场万圣节Trick or Treat on the Farm （targan求强连通分量） 题目描述 每年，在威斯康星州，奶牛们都会穿上衣服，收集农夫约翰在N(1<=N<=100，000)个牛棚隔间中留下的糖果，以此来庆祝美国秋天的万圣节。 由于牛棚不太大，FJ通过指定奶牛必须遵循的穿越路线来确保奶牛的乐趣。为了实现这个让奶牛在牛棚里来回穿梭的方案，FJ在第i号隔...

POJ - 1236 - Network of Schools (targan求强联通分量缩点) A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to...

HDU - 4738 Caocao’s Bridges(targan 求桥 ＋判重边) Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn’t give up. Caocao’s army still was not good at water battles, so he cam...

HDU - 4635 Strongly connected（targan 差一强联通分量） Give a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is still a simple direct...

HDU-5934 Bomb（tarjan缩点） There are N bombs needing exploding. Each bomb has three attributes: exploding radius ri, position (xi,yi) and lighting-cost ci which means you need to pay ci cost making it e...