图的连通性
理想主义文艺青年
理想主义源于对生活的憧憬 文艺是对生活的态度
展开
-
poj 3204 Ikki's Story I - Road Reconstruction(最大流求割边)
Language:DefaultIkki's Story I - Road ReconstructionTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 7093 Accepted: 2042DescriptionIkki is the k原创 2015-03-26 00:42:12 · 659 阅读 · 0 评论 -
poj 1904 King's Quest(Tarjan+匹配)
Language:DefaultKing's QuestTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 7653 Accepted: 2781Case Time Limit: 2000MSDescriptionOnce upon a原创 2015-03-31 16:10:44 · 674 阅读 · 0 评论 -
poj 3117&&poj 3352 (边双连通分量+缩点 Tarjan算法 )
分析:在同一个边双连通分量中,任意两点都有至少两条独立路可达,所以同一个边双连通分量里的所有点可以看做同一个点。缩点后,新图是一棵树,树的边就是原无向图的桥。现在问题转化为:在树中至少添加多少条边能使图变为双连通图。结论:添加边数=(树中度为1的节点数+1)/2具体方法为,首先把两个最近公共祖先最远的两个叶节点之间连接一条边,这样可以把这两个点到祖先的路径上所有点收原创 2015-03-25 08:38:51 · 764 阅读 · 0 评论 -
hdu 4685 Prince and Princess(Tarjan+二分匹配)
Prince and PrincessTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1224 Accepted Submission(s): 350Problem DescriptionThere a原创 2015-03-31 21:49:27 · 735 阅读 · 0 评论 -
poj 2942 Knights of the Round Table(边双连通分量)
Knights of the Round TableTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 10346 Accepted: 3403DescriptionBeing a knight is a very attractive career: sea原创 2015-03-24 17:16:12 · 604 阅读 · 0 评论 -
poj 1966 zoj 2182 Cable TV Network(无向图顶点连通度(sap求最大流))
Cable TV NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4062 Accepted: 1902DescriptionThe interconnection of the relays in a cable TV network原创 2015-03-23 18:42:39 · 886 阅读 · 0 评论 -
zoj 1311 poj 1144 Network(无向图顶点联通度)
NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10137 Accepted: 4723DescriptionA Telephone Line Company (TLC) is establishing a new telephone c原创 2015-03-23 18:23:50 · 727 阅读 · 0 评论 -
zoj 3316 Game(带花树+完美匹配)
GameTime Limit: 1 Second Memory Limit: 32768 KBFire and Lam are addicted to the game of Go recently. Go is one of the oldest board games. It is rich in strategy despite its simple rules原创 2015-04-01 21:59:09 · 921 阅读 · 0 评论 -
zoj Burning Bridges(无向图割边)
Burning BridgesTime Limit: 5 Seconds Memory Limit: 32768 KBFerry Kingdom is a nice little country located on N islands that are connected by M bridges. All bridges are very beautiful an原创 2015-03-23 23:07:04 · 622 阅读 · 0 评论 -
poj 1523 SPF(无向图求关节点)
SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6609 Accepted: 3019DescriptionConsider the two networks shown below. Assuming that data moves around原创 2015-03-22 22:15:15 · 1065 阅读 · 0 评论 -
csu 1526: Beam me out!(强连通分量 Tarjan)
Beam me out!Time Limit: 2000ms, Special Time Limit:5000ms, Memory Limit:65536KBTotal submit users: 4, Accepted users: 3Problem 13245 : No special judgementProblem description原创 2015-03-28 18:32:48 · 1053 阅读 · 2 评论 -
poj 2553 zoj 1979 The Bottom of a Graph(强联通分量 Tarjan)
The Bottom of a GraphTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 9176 Accepted: 3808DescriptionWe will use the following (standard) definitions from原创 2015-03-28 00:37:53 · 703 阅读 · 0 评论 -
poj 2186 Popular Cows(Tarjan)
Popular CowsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 24548 Accepted: 10072DescriptionEvery cow's dream is to become the most popular cow in t原创 2015-03-28 00:09:14 · 563 阅读 · 0 评论 -
poj 1236 Network of Schools(强连通分量 Tarjan)
Network of SchoolsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12080 Accepted: 4811DescriptionA number of schools are connected to a computer network原创 2015-03-28 00:45:06 · 706 阅读 · 0 评论 -
poj 3694 Network(Tarjan+LCA)
NetworkTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7127 Accepted: 2575DescriptionA network administrator manages a large network. The network cons原创 2015-03-27 00:04:53 · 635 阅读 · 0 评论 -
poj 2762 Going from u to v or from v to u?(Tarjan+拓扑排序)
Language:DefaultGoing from u to v or from v to u?Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15059 Accepted: 3976DescriptionIn order to make the原创 2015-03-27 00:12:12 · 599 阅读 · 0 评论 -
zoj 2532 Internship(最大流求割边)
InternshipTime Limit: 5 Seconds Memory Limit: 32768 KBCIA headquarter collects data from across the country through its classified network. They have been using optical fibres long befo原创 2015-03-26 00:33:57 · 775 阅读 · 1 评论 -
poj 3160 Father Christmas flymouse(Tarjan+SPFA)
Language:DefaultFather Christmas flymouseTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 2784 Accepted: 929DescriptionAfter retirement as conte原创 2015-04-03 16:39:33 · 592 阅读 · 0 评论