ACM - 网络流问题
LP_Cong
Python, Qt C++ Developer ACMer https://github.com/Linzecong
展开
-
HDU - 6214 Smallest Minimum Cut (2017 ACM-ICPC 亚洲区 (青岛赛区) 网络赛 1009)
2017 ACM/ICPC Asia Regional Qingdao Online 1009Smallest Minimum CutProblem DescriptionConsider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes se原创 2017-09-17 20:14:32 · 648 阅读 · 0 评论 -
CodeChef - RIN Course Selection (最小割建模)
出处:国家集训队2016论文集题目链接:https://vjudge.net/problem/CodeChef-RIN代码:https://www.cnblogs.com/shenben/p/6624196.html 容量正无穷的边表示冲突(某种前置关系) ...原创 2018-09-19 19:18:54 · 294 阅读 · 0 评论 -
HYSBZ - 1061 志愿者招募 (利用网络流流量平衡进行等式建模)
1061: [Noi2008]志愿者招募Time Limit: 20 Sec Memory Limit: 162 MBSubmit: 5862 Solved: 3529[Submit][Status][Discuss]Description 申奥成功后,布布经过不懈努力,终于成为奥组委下属公司人力资源部门的主管。布布刚上任就遇到了一个难题:为即将启动的奥运新项目招募...原创 2018-09-19 20:40:52 · 390 阅读 · 0 评论 -
HDU - 6081 & 3691(无向图全局最小割)
用来保存全局最小割模板!全局最小割,即给定一个无向图,求得任意两点间的最小割。所有的最小割中最小的那个,就是全局最小割。接地气的讲,就是给定一个图,割掉某些边,使得整个图不再联通,权值最小的边集就是这个图的全局最小割。 Stoer-Wagner算法模板题,邻接表堆优化法理论复杂度O(nmlog(m))HDU - 6081#include <iostream...原创 2018-09-19 22:52:20 · 343 阅读 · 0 评论 -
牛客国庆集训派对Day6 A-Birthday (最小费用流)
链接:https://www.nowcoder.com/acm/contest/206/A来源:牛客网 题目描述恬恬的生日临近了。宇扬给她准备了一个蛋糕。正如往常一样,宇扬在蛋糕上插了n支蜡烛,并把蛋糕分为m个区域。因为某种原因,他必须把第i根蜡烛插在第ai个区域或第bi个区域。区域之间是不相交的。宇扬在一个区域内同时摆放x支蜡烛就要花费x2的时间。宇扬布置蛋糕所用的总时间是他在每个...原创 2018-10-06 19:27:57 · 264 阅读 · 0 评论 -
Kattis - catering(WF2015)(有源汇有上下界费用可行流)
Paul owns a catering company and business is booming. The company has kk catering teams, each in charge of one set of catering equipment. Every week, the company accepts nn catering requests for vario...原创 2018-10-18 22:46:02 · 254 阅读 · 0 评论 -
Gym - 101908G Gasoline (二分+网络流)
G. Gasolinetime limit per test0.5 smemory limit per test1024 MBinputstandard inputoutputstandard outputAfter the end of the truck drivers' strike, you and the rest of Nlogônia logist...原创 2018-10-18 22:50:07 · 345 阅读 · 0 评论 -
HYSBZ - 2960 跨平面 (平面图转对偶图 + 最小树形图)
2960: 跨平面Time Limit: 1 Sec Memory Limit: 256 MBSubmit: 387 Solved: 166[Submit][Status][Discuss]DescriptionInput 第一行两个整数n和m,表示点与线段的数目。 接下来n行,每行两个整数x和y,表示第i个点的坐标,点从1到n编号。 接下来m行,每行四个整数p...原创 2018-10-10 19:47:43 · 308 阅读 · 0 评论 -
CodeForces - 863F Almost Permutation(费用流)
F. Almost Permutationtime limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRecently Ivan noticed an array a while debugging his code. ...原创 2018-10-31 20:43:28 · 277 阅读 · 0 评论 -
CodeForces - 884F Anti-Palindromize(费用流)
F. Anti-Palindromizetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA string a of length m is called antipalindromic iff m is ev...原创 2018-10-31 22:43:33 · 261 阅读 · 0 评论 -
Gym - 101986H Homework (最大流和最小割)
题意:有N个作业,分别为A类和B类,每天最多只能选择AB中的一类做,如果该天有该类的作业,就必须要做一个,问最多能做多少作业,和最少要做多少作业。 解题思路:对于最多能做多少,很容易建图对于每一天建一个点对于每一个作业建一个点每个作业覆盖的天都跟该作业连边,流量为1源点跟每一天连边,流量为1每一个作业跟汇点连边,流量为1.最大流即最多能做的作业。其实就...原创 2018-11-21 13:40:04 · 438 阅读 · 0 评论 -
HDU - 6437 Problem L.Videos (费用流)
Problem L.VideosTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 818 Accepted Submission(s): 418 Problem DescriptionC-bacteria takes...原创 2018-09-13 19:57:55 · 196 阅读 · 0 评论 -
计蒜客 Fantastic Grap(2018 ICPC亚洲区域赛网络赛 沈阳 F)(有上下界网络流)
"Oh, There is a bipartite graph.""Make it Fantastic."X wants to check whether a bipartite graph is a fantastic graph. He has two fantastic numbers, and he wants to let all the degrees to between the...原创 2018-09-10 19:24:52 · 280 阅读 · 0 评论 -
POJ - 3436 ACM Computer Factory (最大流问题 + 拆点)
ACM Computer FactoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8767 Accepted: 3197 Special JudgeDescriptionAs you know, all the computers used for ACM contests must be identical, so the...原创 2018-03-07 19:10:09 · 286 阅读 · 0 评论 -
POJ - 2195 Going Home (最小费用最大流)
Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 24299 Accepted: 12196DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one ...原创 2018-03-07 22:17:37 · 263 阅读 · 0 评论 -
POJ - 2516 Minimum Cost (最小费用最大流)
Minimum CostTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 17879 Accepted: 6289DescriptionDearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area th...原创 2018-03-14 21:00:41 · 232 阅读 · 0 评论 -
POJ - 1459 Power Network (最大流模板)
Power NetworkTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 29759 Accepted: 15413DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power ...原创 2018-03-14 22:34:42 · 191 阅读 · 0 评论 -
HDU - 4280 Island Transport (最大流 邻接表)
Island TransportTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 10558 Accepted Submission(s): 3393Problem Description In the vast waters f...原创 2018-03-15 13:33:50 · 295 阅读 · 0 评论 -
UVA - 10480 Sabotage (最大流最小割定理)
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1421裸的最小割,学习了一下最小割,很容易明白最小割就是最大流。但是这题要输出路径,通过寻找最大流可以把点分为两类,即割后的点集,一个属于S,一个属于T,然后就可以输出割边...原创 2018-03-15 16:57:34 · 380 阅读 · 0 评论 -
Gym 101606K Knightsbridge Rises(最大流+输出路径)
High-rise buildings in the wealthy retail district of Knightsbridge are usually built with exotichoisting machines known, in construction circles, as cranes.While it is common to mount these devices o...原创 2018-04-04 13:54:28 · 545 阅读 · 0 评论 -
2018 ACM-ICPC 中国大学生程序设计竞赛线上赛 F. Clever King (最大权闭合子图)
Description: In order to increase the happiness index of people's lives, King Y has decided to develop the manufacturing industry vigorously. There are total n kinds of products that King can choos...原创 2018-04-23 22:40:27 · 829 阅读 · 0 评论 -
2018年上海金马五校程序设计竞赛 Problem G : Can I Find You
Problem G : Can I Find YouFrom: DHUOJ, 2018060907Submit (Out of Contest)Time Limit: 3 sDescriptionOnce by chance, Chris met a lovely girl Melinda. They had a very pleasant conversation. But Chris forg...原创 2018-06-09 17:27:47 · 571 阅读 · 0 评论 -
计蒜客 Modular Production Line(ACM-ICPC 2018 焦作赛区网络预赛 F)(最长k可重区间集问题 费用流)
An automobile factory has a car production line. Now the market is oversupply and the production line is often shut down. To make full use of resources, the manager divides the entire production line ...原创 2018-09-16 00:40:31 · 449 阅读 · 0 评论 -
Gym - 100548C The Problem Needs 3D Arrays (最大密度子图)
题意:求一个子序列,使得这个子序列的 逆序数/长度 最大 解题思路:如果知道什么是最大密度子图,那么这道题就是裸题了。这里保存一下模板~!感谢大佬的模板https://www.cnblogs.com/xiuwenli/p/9748771.html这个模板可以求 带点权带边权某些点必须用的最大密度子图 #include<bits/stdc++.h>...原创 2018-11-16 21:59:36 · 1076 阅读 · 2 评论