----网络流
Wang_128
这个作者很懒,什么都没留下…
展开
-
POJ1087-A Plug for UNIX
A Plug for UNIX Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16941 Accepted: 5840 Description You are in charge of setting up the press room for the ina原创 2017-05-02 14:52:31 · 329 阅读 · 0 评论 -
小Y写文章
时间限制:C/C++ 2秒,其他语言4秒空间限制:C/C++ 131072K,其他语言262144K64bit IO Format: %lld题目描述 小Y写了一篇文章,他对自己的文笔很有自信,尤其是自己总结出了一套计算文章通顺性的公式。文章共N段,对于文章的每一段小Y对它都能计算出一个估值,而一篇文章的不连贯值定义为,现在小Y想要发布他的文章,但是编辑小Z让他加入一些广告,具体来说就是M段估值分...原创 2018-04-20 23:17:40 · 319 阅读 · 0 评论 -
HDU5988-Coding Contest
Coding Contest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)原创 2017-10-05 22:22:33 · 338 阅读 · 0 评论 -
POJ3436-ACM Computer Factory
ACM Computer Factory Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 8159 Accepted: 2961 Special Judge Description As you know, all the computers use原创 2017-09-02 13:06:00 · 261 阅读 · 0 评论 -
POJ2987-Firing(最大权闭合图)
Firing Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 10904 Accepted: 3290 Description You’ve finally got mad at “the world’s most stupid” employees原创 2017-09-02 12:28:56 · 338 阅读 · 0 评论 -
POJ3204-Ikki's Story I - Road Reconstruction
Ikki's Story I - Road Reconstruction Time Limit: 2000MS Memory Limit: 131072K Total Submissions: 8020 Accepted: 2315 Description Ikki is the king of a small count原创 2017-09-02 12:39:49 · 289 阅读 · 0 评论 -
POJ3281-Dining(最大流)
Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16831 Accepted: 7473 Description Cows are such finicky eaters. Each cow has a preference for certa原创 2017-01-23 22:46:35 · 345 阅读 · 0 评论 -
POJ2195-Going Home
Going Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 22253 Accepted: 11235 Description On a grid map there are n little men and n houses. In each u原创 2017-02-06 16:13:44 · 297 阅读 · 0 评论 -
HDU6118-度度熊的交易计划(最小可行流)
度度熊的交易计划 Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)原创 2017-08-15 20:19:01 · 361 阅读 · 0 评论 -
POJ1149-PIGS
PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21699 Accepted: 9915 Description Mirko works on a pig farm that consists of M locked pig-houses and原创 2017-08-28 22:48:58 · 276 阅读 · 0 评论 -
POJ1459-Power Network
Power Network Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 28881 Accepted: 14972 Description A power network consists of nodes (power stations, consum原创 2017-08-28 22:26:24 · 245 阅读 · 0 评论 -
POJ2455-Secret Milking Machine
Secret Milking Machine Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12405 Accepted: 3623 Description Farmer John is constructing a new milking machine原创 2017-08-28 16:56:28 · 285 阅读 · 0 评论 -
POJ1273-Drainage Ditches
Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 77789 Accepted: 30315 Description Every time it rains on Farmer John's fields, a pond fo原创 2017-08-28 16:39:26 · 253 阅读 · 0 评论 -
POJ3680-Intervals
Intervals Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 8363 Accepted: 3569 Description You are given N weighted open intervals. The ith interval cover原创 2017-07-23 10:26:54 · 263 阅读 · 0 评论 -
POJ2112-Optimal Milking
Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 17153 Accepted: 6167 Case Time Limit: 1000MS Description FJ has moved his K (1 <= K原创 2017-03-13 23:37:36 · 318 阅读 · 0 评论 -
黑妹的游戏IV
题目链接:https://www.nowcoder.com/acm/contest/130/D解题思路:网络流,预处理出所有的(i,j)对和(p,q)对,源点S和(i,j)连容量为1的边,(p,q)和汇点T连容量为1的边,如果(i,j)和(p,q)可以同时选择则连容量为1的边。跑一遍最大流即可得出答案。边数可能很大,注意到(i,j)和(p,q)可以连边的条件是不互质,可以将质因子作为中间点,(i,...原创 2018-07-03 20:11:53 · 599 阅读 · 0 评论