强连通分量
让我改变你的心智
这个作者很懒,什么都没留下…
展开
-
POJ 1236 Network of Schools 强连通分量
Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15812 Accepted: 6267DescriptionA number of schools are connected to a computer network原创 2016-08-11 20:12:08 · 308 阅读 · 0 评论 -
POJ2186 Popular Cows 强连通分量
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 30459 Accepted: 12365DescriptionEvery cow's dream is to become the most popular cow in the h原创 2016-08-12 15:27:14 · 263 阅读 · 0 评论 -
HDU4653 Strongly connected
Strongly connectedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2464 Accepted Submission(s): 1029Problem DescriptionGive a原创 2016-08-12 22:01:14 · 314 阅读 · 0 评论 -
POJ 3180 The Cow Prom 强连通分量
The Cow PromTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1691 Accepted: 1055DescriptionThe N (2 Only cows can perform the Round Dance which requi原创 2016-08-10 21:43:16 · 380 阅读 · 0 评论 -
1076 2条不相交的路径 双连通分量
1076 2条不相交的路径基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 收藏 关注给出一个无向图G的顶点V和边E。进行Q次查询,查询从G的某个顶点V[s]到另一个顶点V[t],是否存在2条不相交的路径。(两条路径不经过相同的边)(注,无向图中不存在重边,也就是说确定起点和终点,他们之间最多只有原创 2016-12-22 21:57:53 · 448 阅读 · 0 评论 -
HDU 3394 Railway 点双连通分量
RailwayTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2762 Accepted Submission(s): 943Problem DescriptionThere are some loca原创 2017-08-07 19:58:49 · 299 阅读 · 0 评论 -
1179: [Apio2009]Atm
DescriptionInput第一行包含两个整数N、M。N表示路口的个数,M表示道路条数。接下来M行,每行两个整数,这两个整数都在1到N之间,第i+1行的两个整数表示第i条道路的起点和终点的路口编号。接下来N行,每行一个整数,按顺序表示每个路口处的ATM机中的钱数。接下来一行包含两个整数S、P,S表示市中心的编号,也就是出发的路口。P表示酒吧数目。接下来的一行中有P个整数原创 2017-07-26 17:04:22 · 243 阅读 · 0 评论 -
POJ 1236 Network of Schools
Language:DefaultNetwork of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20538 Accepted: 8105DescriptionA number of schools are connect原创 2018-02-07 15:28:37 · 152 阅读 · 0 评论 -
POJ 3694 Network
NetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 10877 Accepted: 4064DescriptionA network administrator manages a large network. The network consists of N computers and M links between...原创 2018-02-08 17:21:06 · 157 阅读 · 0 评论