ACM - Tarjan算法
LP_Cong
Python, Qt C++ Developer ACMer https://github.com/Linzecong
展开
-
2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 F. Islands
题意:已知一个有向图,问最少要补多少条边使得图强连通。解题思路:原题 HDU 2767 Proving Equivalences……(强连通 Tarjan+缩点)#include#include#include#include#include#include#include#include#inc原创 2017-09-09 20:53:48 · 469 阅读 · 0 评论 -
POJ - 1236 Network of Schools (强连通分量)
Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20402 Accepted: 8047DescriptionA number of schools are connected to a computer net原创 2018-01-26 15:01:14 · 200 阅读 · 0 评论 -
POJ - 2762 Going from u to v or from v to u? (Tarjan 缩点)
Going from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18552 Accepted: 4997DescriptionIn order to make their sons brave, J原创 2018-01-26 17:30:19 · 260 阅读 · 0 评论 -
POJ - 3177 Redundant Paths (双连通分量+缩点)
Redundant PathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17110 Accepted: 7117DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1.....原创 2018-03-03 14:25:41 · 338 阅读 · 0 评论 -
HDU - 4612 Warm up (树的直径)
Warm upTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 7778 Accepted Submission(s): 1785Problem Description N planets are connected by M b...原创 2018-03-03 15:27:50 · 243 阅读 · 0 评论 -
HDU - 6280 From Tree to Graph (并查集+LCA)(2018CCPC湘潭邀请赛E)
From Tree to GraphTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 327680/327680 K (Java/Others)Total Submission(s): 11 Accepted Submission(s): 6Problem DescriptionBobo has a tree of n vert...原创 2018-05-24 16:59:27 · 471 阅读 · 0 评论 -
CodeForces - 1000E We Need More Bosses(无向图缩点 + 树的直径)
E. We Need More Bossestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYour friend is developing a computer game. He has already ...原创 2018-10-20 14:50:22 · 293 阅读 · 0 评论 -
CodeForces - 1046B Hyperspace Highways (广义圆方树)
B. Hyperspace Highwaystime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn an unspecified solar system, there are NN planets. A spa...原创 2018-11-10 17:28:03 · 381 阅读 · 0 评论 -
Gym - 101986F Pizza Delivery (最短路必经路径)
题意:给你一个有向图,每一条边在第i天都会反向,问反向后的最短路是否有变化。每次反向都是独立的。 解题思路:我们先把起点到所有点的最短路求出来,然后把所有边反向,然后求终点到所有点的最短路。这样我们就记录了两个数组d1,d2,分别记录起点和终点到所有点的最短路。然后用s记录刚开始的最短路。当我们反向一条边的时候只需要判断 d1[v]+d2[u]+w<s,如果小于s,那么...原创 2018-11-21 13:25:17 · 995 阅读 · 1 评论