网络流
qq_37383726
这个作者很懒,什么都没留下…
展开
-
Dining 【dicnic 求最大流】+【拆点 建模】(解匹配问题)
Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10755 Accepted: 4930 Description Cows are such finicky eaters. Each cow has a preference for certain foods and drinks,原创 2017-04-30 12:33:00 · 345 阅读 · 0 评论 -
【HDU - 3046】Pleasant sheep and big big wolf 【最大流-最小割】
In ZJNU, there is a well-known prairie. And it attracts pleasant sheep and his companions to have a holiday. Big big wolf and his families know about this, and quietly hid in the big lawn. As ZJNU ACM/原创 2017-10-30 13:38:04 · 398 阅读 · 0 评论 -
【POJ - 245】Secret Milking Machine 【网络流+二分】
Farmer John is constructing a new milking machine and wishes to keep it secret as long as possible. He has hidden in it deep within his farm and needs to be able to get to the machine without being det原创 2017-10-30 13:20:42 · 265 阅读 · 0 评论 -
【ZOJ - 3885】 The Exchange of Items 【费用流】
Bob lives in an ancient village, where transactions are done by one item exchange with another. Bob is very clever and he knows what items will become more valuable later on. So, Bob has decided to do原创 2017-10-26 12:45:11 · 220 阅读 · 0 评论 -
【POJ 2289】 Jamie's Contact Groups 【网络流+二分】
Jamie is a very popular girl and has quite a lot of friends, so she always keeps a very long contact list in her cell phone. The contact list has become so long that it often takes a long time for her原创 2017-10-26 16:45:15 · 632 阅读 · 0 评论 -
【poj 3469 】 Dual Core CPU 【最大流+最小割建图】
Dual Core CPU Time Limit: 15000MS Memory Limit: 131072K Total Submissions: 20854 Accepted: 9011 Case Time Limit: 5000MS Description As more and more computers are equipped with dual cor原创 2017-10-22 19:34:10 · 594 阅读 · 0 评论 -
【POJ - 3422】Kaka's Matrix Travels 【拆点费用流+经典建图】
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-bottom one, takin原创 2017-10-26 17:35:32 · 257 阅读 · 0 评论 -
Flow Problem 【最大流 dinic】模版
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 input contains an integer...原创 2017-04-27 21:37:12 · 295 阅读 · 0 评论 -
【hdoj 5294】 Tricks Device 【最小割+最短路spfa】
Innocent Wu follows Dumb Zhang into a ancient tomb. Innocent Wu’s at the entrance of the tomb while Dumb Zhang’s at the end of it. The tomb is made up of many chambers, the total number is N. And ther...原创 2017-07-25 09:28:55 · 249 阅读 · 0 评论 -
【Wannafly交流赛1】 A B【思维】 D【平面图最小割转最短路】
A-有理数链接:https://www.nowcoder.com/acm/contest/69/A 来源:牛客网时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 有一个问题如下: 给你一个有理数v,请找到小于v的最大有理数。 但这个问题的答案对于任意v都是无解的! ...原创 2018-03-04 10:13:58 · 295 阅读 · 0 评论 -
【HDU 3879 】 Base Station 【最小割建图 - 最大权闭合图】
A famous mobile communication company is planning to build a new set of base stations. According to the previous investigation, n places are chosen as the possible new locations to build those new sta...原创 2018-04-14 17:56:32 · 203 阅读 · 0 评论 -
【POJ - 2987 】Firing 【最大权闭合图有唯一的 势 】
You’ve finally got mad at “the world’s most stupid” employees of yours and decided to do some firings. You’re now simply too mad to give response to questions like “Don’t you think it is an even more ...原创 2018-04-14 18:08:18 · 1670 阅读 · 0 评论 -
【CSU - 1319】 CX‘s dreams 【最大权闭合图 -- 最大化正点权个数】
CX有很多的梦想,但是没有付出拿来的收获。比如CX想拥有巧克力般的八块腹肌,就要在健身房举哑铃以及跑步,这是很累的。比如CX要成为ACM大犇,就要刷题1000道,但CX是很享受刷题的,所以并不一定所有的付出都会让CX感到很累、不喜欢。于是CX对每个梦想和每个付出进行了估值,每个梦想有其权值(非负数),代表实现这个梦想能收获的权值,而每个梦想可能需要多个付出来满足,并且一个付出不一定只对应一个梦想,...原创 2018-04-16 20:26:54 · 135 阅读 · 0 评论 -
【ZOJ - 2587】 Unique Attack 【最小割是否唯一】
N supercomputers in the United States of Antarctica are connected into a network. A network has a simple topology: M different pairs of supercomputers are connected to each other by an optical fibre. ...原创 2018-04-17 13:52:34 · 216 阅读 · 0 评论 -
【HDU - 3987】Harry Potter and the Forbidden Forest 【最小割 -- 最小化割边数】
Harry Potter notices some Death Eaters try to slip into Castle. The Death Eaters hide in the most depths of Forbidden Forest. Harry need stop them as soon as. The Forbidden Forest is mysterious. It ...原创 2018-04-17 14:20:26 · 269 阅读 · 0 评论 -
【HDU - 3251 】 Being a Hero 【最小割建图--输出割边】
You are the hero who saved your country. As promised, the king will give you some cities of the country, and you can choose which ones to own! But don’t get too excited. The cities you take should N...原创 2018-04-18 17:46:23 · 223 阅读 · 0 评论 -
【POJ- 2112】Optimal Milking 【floyd+二分+最大流】
FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths runs among the cows and the milking machines. The milkin原创 2017-10-12 13:42:06 · 202 阅读 · 0 评论 -
【HDU - 3605 】Escape 【状态压缩 构图+最大流 or 多重匹配】
2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of the planet. Now scientists wan原创 2017-10-20 22:24:31 · 413 阅读 · 0 评论 -
Task Schedule 【最大流 判断是否满流】
Our geometry princess XMM has stoped her study in computational geometry to concentrate on her newly opened factory. Her factory has introduced M new machines in order to process the coming N tasks. Fo原创 2017-07-19 09:42:36 · 351 阅读 · 0 评论 -
【 zoj 3348 】Schedule 【网络流经典建图】
DD enters the top-level pingpong match! As the game going on, he wonders if there is possibility for him to get the champion(excluding joint champions). Now provide you the results of previous matches,原创 2017-08-01 10:16:05 · 237 阅读 · 0 评论 -
【HDU - 4183 】 Pahom on Water 【最大流】
Pahom on Water is an interactive computer game inspired by a short story of Leo Tolstoy about a poor man who, in his lust for land, forfeits everything. The game’s starting screen displays a number of原创 2017-07-23 21:08:46 · 243 阅读 · 0 评论 -
【hduoj 3416 】Marriage Match IV 【最小割dinic+最短路spfa】
Problem Description Do not sincere non-interference。 Like that show, now starvae also take part in a show, but it take place between city A and B. Starvae is in city A and girls are in city B. Every原创 2017-07-26 15:20:12 · 463 阅读 · 0 评论 -
【 hdoj 4240】 Route Redundancy 【dinic+spfa】
Problem Description A city is made up exclusively of one-way steets.each street in the city has a capacity,which is the minimum of the capcities of the streets along that route.The redundancy ratio fr原创 2017-07-26 09:47:27 · 432 阅读 · 0 评论 -
【HDU - 3277】Marriage Match III 【网络流经典建图+拆点+二分+并查集or floyd】
Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the ever game of play-house . What a happy time as so many friends play together. And it原创 2017-07-28 11:23:51 · 284 阅读 · 0 评论 -
【hdoj 3081】Marriage Match II 【并查集orfloyd +完美匹配】or【最大流+二分+并查集】
Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the game of playing house we used to play when we are kids. What a happy time as so many原创 2017-07-27 10:54:00 · 402 阅读 · 0 评论 -
【HDU 6201】transaction transaction transaction 【费用流】
transaction transaction transactionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others) Total Submission(s): 962 Accepted Submission(s): 474Problem Description Kel原创 2017-09-12 08:25:16 · 307 阅读 · 0 评论 -
【2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛】 J Our Journey of Dalian Ends 【拆点费用流】
Life is a journey, and the road we travel has twists and turns, which sometimes lead us to unexpected places and unexpected people.Now our journey of Dalian ends. To be carefully considered are the fol原创 2017-09-12 21:25:53 · 296 阅读 · 0 评论 -
【HDU - 2686 and HDU4322 】 Matrix 【拆点最大费用流】
Yifenfei 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 yifenfei should to do is that choose a detour which frome the top left原创 2017-10-03 13:51:32 · 282 阅读 · 0 评论 -
【HDU - 1533】 Going Home 【 MCMF or KM 】
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 man, you need to原创 2017-10-08 21:12:35 · 310 阅读 · 0 评论 -
【 HDU 1853】Cyclic Tour 【MCMF or KM 解哈密顿环】
There are N cities in our country, and M one-way roads connecting them. Now Little Tom wants to make several cyclic tours, which satisfy that, each cycle contain at least two cities, and each city belo原创 2017-10-09 21:37:12 · 282 阅读 · 0 评论 -
【HDU - 3667 】Transportation 【最小费用流+费用为c*x^2】
There are N cities, and M directed roads connecting them. Now you want to transport K units of goods from city 1 to city N. There are many robbers on the road, so you must be very careful. The more goo原创 2017-10-19 22:13:30 · 208 阅读 · 0 评论 -
【POJ 2391 】Ombrophobic Bovines 【floyd +二分+最大流】
FJ’s cows really hate getting wet so much that the mere thought of getting caught in the rain makes them shake in their hooves. They have decided to put a rain siren on the farm to let them know when r原创 2017-10-10 23:32:01 · 279 阅读 · 0 评论 -
【Loj】 三种 带有上下界的网络流
题目描述 这是一道模板题。n n n 个点,m m m 条边,每条边 e e e 有一个流量下界 lower(e) \text{lower}(e) lower(e) 和流量上界 upper(e) \text{upper}(e) upper(e),求一种可行方案使得在所有点满足流量平衡条件的前提下,所有边满足流量限制。输入格式 第一行两个正整数 n n n、m m m。之后的 m m...原创 2018-06-07 11:05:39 · 295 阅读 · 0 评论