图论
文章平均质量分 77
小坏蛋_千千
im0qianqian_站在回忆的河边看着摇晃的渡船终年无声地摆渡,它们就这样安静地画下黄昏画下清晨......
展开
-
蓝桥杯 城市建设 (Kruskal)
问题描述 栋栋居住在一个繁华的 C 市中,然而,这个城市的道路大都年久失修。市长准备重新修一些路以方便市民,于是找到了栋栋,希望栋栋能帮助他。 C 市中有 n 个比较重要的地点,市长希望这些地点重点被考虑。现在可以修一些道路来连接其中的一些地点,每条道路可以连接其中的两个地点。另外由于 C 市有一条河从中穿过,也可以在其中的一些地点建设码头,所有建了码头的地点可以通过河道连接。...原创 2018-03-21 22:00:21 · 466 阅读 · 0 评论 -
HDU 6118 度度熊的交易计划 (最小费用最大流)
Description 度度熊参与了喵哈哈村的商业大会,但是这次商业大会遇到了一个难题: 喵哈哈村以及周围的村庄可以看做是一共由n个片区,m条公路组成的地区。 由于生产能力的区别,第i个片区能够花费a[i]元生产1个商品,但是最多生产b[i]个。 同样的,由于每个片区的购买能力的区别,第i个片区也能够以c[i]的价格出售最多d[i]个物品。 由于这些因素,原创 2017-08-13 19:55:20 · 1238 阅读 · 0 评论 -
HDU 6041 I Curse Myself (仙人掌图)
Description There is a connected undirected graph with weights on its edges. It is guaranteed that each edge appears in at most one simple cycle. Assuming that the weight of a weighted spanning原创 2017-07-31 21:48:12 · 517 阅读 · 0 评论 -
『图论』LCA 最近公共祖先
转载记得告诉千千哦~同步更新:https://www.dreamwings.cn/lca/4874.html概述篇LCA (Least Common Ancestors) ,即最近公共祖先,是指这样的一个问题:在一棵有根树中,找出某两个节点 u 和 v 最近的公共祖先。 LCA 可分为在线算法与离线算法在线算法:指程序可以以序列化的方式一个一个处理输入,也就是说在一开始并不需要知道所有的输入。离原创 2017-08-07 19:56:17 · 4332 阅读 · 6 评论 -
HDU 3594 Cactus (仙人掌图、Tarjan)
Description It is a Strongly Connected graph. Each edge of the graph belongs to a circle and only belongs to one circle. We call this graph as CACTUS. There is an example as t原创 2017-07-30 17:05:19 · 571 阅读 · 0 评论 -
HDU 2255 奔小康赚大钱 (二分图最大权匹配)
Problem Description 传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。 这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。 另一方面,村长和另外的村领导希望得到最大的效益,这样村里的机构才原创 2017-04-27 21:31:28 · 699 阅读 · 0 评论 -
POJ 3308 Paratroopers (最小割)
Description It is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are informed by their spies that the invaders of Mars原创 2017-04-25 21:43:03 · 539 阅读 · 0 评论 -
POJ 1679 The Unique MST (次小生成树)
Description Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of原创 2017-05-02 20:52:26 · 542 阅读 · 0 评论 -
山东省第七届 ACM 省赛 Proxy (最短路)
Problem Description Because of the GFW (Great Firewall), we cannot directly visit many websites, such as Facebook, Twitter, YouTube, etc. But with the help of proxy and proxy server, we can easily ge原创 2017-04-27 09:10:54 · 661 阅读 · 0 评论 -
HDU 6152 Friend-Graph (最大团)
Description It is well known that small groups are not conducive of the development of a team. Therefore, there shouldn’t be any small groups in a good team. In a team with n members,if there ar原创 2017-08-20 14:59:28 · 745 阅读 · 2 评论 -
HDU 6214 Smallest Minimum Cut (最小割)
Description Consider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V into two parts such that s and t belong to different parts. The cut set is the subset of E wi原创 2017-09-20 22:09:34 · 340 阅读 · 0 评论 -
HDU 1814 Peaceful Commission (2-SAT)
Description The Public Peace Commission should be legislated in Parliament of The Democratic Republic of Byteland according to The Very Important Law. Unfortunately one of the obstacles is the fact t原创 2017-09-29 15:08:11 · 273 阅读 · 0 评论 -
CCF 201712-4 行车路线 (spfa)
问题描述 小明和小芳出去乡村玩,小明负责开车,小芳来导航。 小芳将可能的道路分为大道和小道。大道比较好走,每走 1 公里小明会增加 1 的疲劳度。小道不好走,如果连续走小道,小明的疲劳值会快速增加,连续走 s 公里小明会增加 s^2 的疲劳度。 例如:有 5 个路口,1 号路口到 2 号路口为小道,2 号路口到 3 号路口为小道,3 号路口到 4 号路口为大道,4 号路...原创 2018-03-15 12:46:00 · 981 阅读 · 0 评论 -
HDU 5988 Coding Contest (最小费用流)
Description A coding contest will be held in this university, in a huge playground. The whole playground would be divided into N blocks, and there would be M directed paths linking these blocks. The原创 2017-10-14 10:58:21 · 325 阅读 · 0 评论 -
51nod 1693 水群 (spfa)
Description 总所周知,水群是一件很浪费时间的事,但是其实在水群这件事中,也可以找到一些有意思的东西。 比如现在,bx2k就在研究怎样水表情的问题。 首先,bx2k在对话框中输入了一个表情��,接下来,他可以进行三种操作。 第一种,是全选复制,把所有表情全选然后复制到剪贴板中。 第二种,是粘贴,把剪贴板中的表情粘贴到对话框中。 第三种,原创 2017-10-06 15:50:31 · 586 阅读 · 0 评论 -
Codeforces 876 E. National Property (2-SAT)
Description You all know that the Library of Bookland is the largest library in the world. There are dozens of thousands of books in the library. Some long and uninteresting story was removed…原创 2017-10-19 21:05:08 · 1908 阅读 · 0 评论 -
POJ 2186 Popular Cows (缩点)
Description 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) ordered pairs of the form (A, B) that tel原创 2017-10-02 11:24:42 · 365 阅读 · 0 评论 -
POJ 3352 Road Construction (缩点)
Description It’s almost summer time, and that means that it’s almost summer construction time! This year, the good people who are in charge of the roads on the tropical island paradise of Remote Isla原创 2017-09-09 08:22:51 · 517 阅读 · 0 评论 -
POJ 3683 Priest John's Busiest Day (2-SAT)
Description John is the only priest in his town. September 1st is the John’s busiest day in a year because there is an old legend in the town that the couple who get married on that day will be forev原创 2017-09-29 21:19:35 · 280 阅读 · 0 评论 -
POJ 3207 Ikki's Story IV - Panda's Trick (2-SAT)
Description liympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tired of such easy games and wants to play another game原创 2017-09-29 16:52:11 · 362 阅读 · 0 评论 -
POJ 2400 Supervisor, Supervisee (二分图最大权匹配)
Description Suppose some supervisors each get to hire a new person for their department. There are N people to be placed in these N departments. Each supervisor interviews all N people, and ranks the原创 2017-04-30 19:38:41 · 567 阅读 · 0 评论 -
HDU 4857 逃生 (拓扑排序)
Problem Description 糟糕的事情发生啦,现在大家都忙着逃命。但是逃命的通道很窄,大家只能排成一行。 现在有n个人,从1标号到n。同时有一些奇怪的约束条件,每个都形如:a必须在b之前。 同时,社会是不平等的,这些人有的穷有的富。1号最富,2号第二富,以此类推。有钱人就贿赂负责人,所以他们有一些好处。 负责人现在可以安排大家排队的顺序,由于收了好处,所原创 2017-03-12 19:23:11 · 1290 阅读 · 0 评论 -
POJ 3422 Kaka's Matrix Travels (最小费用流)
Description On an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix travels with SUM = 0. For each travel, Kaka moves one rook from the left-upper grid to the right-bot原创 2017-03-14 11:16:11 · 462 阅读 · 0 评论 -
HDU 3549 Flow Problem (最大流)
Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.Input The first line of inpu原创 2016-12-04 18:56:23 · 522 阅读 · 0 评论 -
POJ 2135 Farm Tour (最小费用流)
Description When FJ’s friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of whi原创 2016-12-01 20:44:33 · 827 阅读 · 0 评论 -
HDU 3394 Railway (点双联通分量+桥)
Problem Description There are some locations in a park, and some of them are connected by roads. The park manger needs to build some railways along the roads, and he would like to arrange tourist rou原创 2016-12-11 21:35:21 · 530 阅读 · 0 评论 -
POJ 1459 Power Network (最大流)
Description A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce a原创 2016-12-11 10:45:39 · 693 阅读 · 1 评论 -
POJ 1273:Drainage Ditches (最大流)
Description Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to reg原创 2016-12-11 09:38:27 · 530 阅读 · 0 评论 -
POJ 3469:Dual Core CPU (最大流)
Description As more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to update their famous product - SWODNIW. The rou原创 2016-12-10 20:33:59 · 744 阅读 · 0 评论 -
HDU 1269:迷宫城堡 (Tarjan强连通分量)
Problem Description 为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和M条通道(M<=100000),每个通道都是单向的,就是说若称某通道连通了A房间和B房间,只说明可以通过这个通道由A房间到达B房间,但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否任意两个房间都是相互连通的,即:对于任意的i和j,至少存在原创 2016-12-01 09:49:24 · 558 阅读 · 0 评论 -
UVA 11396:Claw Decomposition(二分图判定)
问题描述:A claw is defined as a pointed curved nail on the end of each toe in birds, somereptiles, and some mammals. However, if you are a graph theory enthusiast, youmay understand the following specia原创 2016-09-06 14:30:16 · 528 阅读 · 0 评论 -
HDU 3376 Matrix Again (最小费用最大流)
Problem Description Starvae very like play a number game in the n*n Matrix. A positive integer number is put in each area of the Matrix. Every time starvae should to do is that choose a detour w原创 2016-12-04 14:04:28 · 853 阅读 · 0 评论 -
POJ 1094 Sorting It All Out (拓扑排序)
Description An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence原创 2017-02-08 18:28:13 · 513 阅读 · 0 评论 -
POJ 3026 Borg Maze (最小生成树)
Description The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg ci原创 2017-02-12 13:49:33 · 455 阅读 · 0 评论 -
POJ 3687 Labeling Balls (拓扑排序)
Description Windy has N balls of distinct weights from 1 unit to N units. Now he tries to label them with 1 to N in such a way that: No two balls share the same label. The labeling satisfie原创 2017-02-08 16:33:13 · 497 阅读 · 0 评论 -
POJ 2195 Going Home (最小费用最大流)
Description On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little ma原创 2017-03-13 19:21:38 · 478 阅读 · 0 评论 -
POJ 2516 Minimum Cost (最小费用最大流)
Description Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy has M sup原创 2017-03-11 20:19:09 · 388 阅读 · 0 评论 -
POJ 1364 King (差分约束)
Description Once, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ”If my child was a son and if only he was a sound king.” After nine months her child was bor原创 2017-03-09 21:10:29 · 661 阅读 · 0 评论 -
POJ 3159 Candies (差分约束)
Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute原创 2017-03-09 18:25:24 · 450 阅读 · 0 评论 -
POJ 1789 Truck History (最小生成树)
Description Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each原创 2017-02-13 20:52:11 · 290 阅读 · 0 评论