随笔分类 - ACM-桥&割顶&强连通分量&双连通分量
摘要：队友过的：https://blog.csdn.net/liufengwei1/article/details/101632506 Forest Program Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (
阅读全文
摘要：Problem Description TC (Tian Chao) is magical place, as you all know...The railways and the rail-stations in TC are fragile and always meet with diffe
阅读全文
摘要：考研路茫茫——空调教室 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4799 Accepted Submission(s): 1452 Pro
阅读全文
摘要：Proving Equivalences Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10665 Accepted Submission(s)
阅读全文
摘要：迷宫城堡 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26892 Accepted Submission(s): 11446 Problem
阅读全文
摘要：1051: [HAOI2006]受欢迎的牛 Description 每一头牛的愿望就是变成一头最受欢迎的牛。现在有N头牛，给你M对整数(A,B)，表示牛A认为牛B受欢迎。 这 种关系是具有传递性的，如果A认为B受欢迎，B认为C受欢迎，那么牛A也认为牛C受欢迎。你的任务是求出有多少头 牛被所有的牛认为
阅读全文
摘要：Given a directed graph G, con- sider the following transformation. First, create a new graph T(G) to have the same vertex set as G. Cre- ate a directe
阅读全文
摘要：Every cow's dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) orde
阅读全文
摘要：题目：http://acm.hdu.edu.cn/showproblem.php?pid=5934 There are NN bombs needing exploding. Each bomb has three attributes: exploding radius riri, positio
阅读全文
摘要：Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 16142 Accepted: 7305 Description A Telephone Line Company (TLC) is establishing a new telep
阅读全文
摘要：By Recognizing These Guys, We Find Social Networks Useful Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submi
阅读全文
摘要：割顶和桥：对于无向图G，如果删除某个节点u后，连通分量数目增加，则称u为图的割顶；如果删除某条边后，连通分量数目增加，则称该边为图的桥。对于连通图删除割顶或桥后都会使得图不再连通 以下我，我们利用dfs的性质来快速找出一个连通图中的所有的割顶和桥 首先我们要引入”时间戳”这个概念： 时间戳：表示在进
阅读全文
