网络流
文章平均质量分 83
u010660276
这个作者很懒,什么都没留下…
展开
-
网络流Dinic邻接表(模板)--hdu4280
Island TransportTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3215 Accepted Submission(s): 1064Problem Description In th原创 2013-08-23 20:33:46 · 861 阅读 · 0 评论 -
网络流拆点upc
http://acm.upc.edu.cn/problem.php?cid=1051&pid=47题意:问最多可以有多少个WIN思路:要把I拆成两个点,然后就是最大流#include#include#include#includeusing namespace std;const int maxn=3610;const int INF=1000000000;char gr原创 2014-03-13 14:11:15 · 702 阅读 · 0 评论 -
网络流hdu4888(多校联合)
Redraw Beautiful DrawingsTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 881 Accepted Submission(s): 148Problem DescriptionAlice原创 2014-07-30 11:29:47 · 590 阅读 · 0 评论 -
二分图最小点权覆盖(输出覆盖的点)poj2025
Language:DefaultDestroying The GraphTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7319 Accepted: 2321 Special JudgeDescriptionAlice and Bo原创 2014-09-05 20:36:20 · 864 阅读 · 0 评论 -
网络流(好)hdu4183
Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu原创 2014-08-18 20:14:27 · 419 阅读 · 0 评论 -
2014多校训练第十场(最大权闭合问题)
最后一场做的很消极原创 2014-09-03 16:39:04 · 412 阅读 · 0 评论 -
网络流+删边判环hdu4975
Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu原创 2014-09-03 20:28:27 · 631 阅读 · 0 评论 -
2015编程之美初赛
#1156 : 彩色的树时间限制:2000ms单点时限:1000ms内存限制:256MB描述给定一棵n个节点的树,节点编号为1, 2, …, n。树中有n - 1条边,任意两个节点间恰好有一条路径。这是一棵彩色的树,每个节点恰好可以染一种颜色。初始时,所有节点的颜色都为0。现在需要实现两种操作:1. 改变节点x的颜色为y;2. 询原创 2015-04-27 19:29:57 · 492 阅读 · 0 评论 -
最小割模型(hdu5076 2014鞍山)
MemoryTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 279 Accepted Submission(s): 59Special JudgeProblem DescriptionLittle Bob’原创 2015-05-17 19:59:15 · 697 阅读 · 0 评论 -
Codeforces Round #304 (Div. 2)E. Soldier and Traveling 网络流
E. Soldier and Travelingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the country there are n cities and m bid原创 2015-05-26 14:37:06 · 835 阅读 · 0 评论 -
2008 Asia Regional Beijing (网络流+树状数组+贪心)hdu2485 - 2494
Destroying the bus stationsProblem DescriptionGabiluso is one of the greatest spies in his country. Now he’s trying to complete an “impossible” mission —– to make it slow for the army of City Colugu to原创 2015-07-27 16:54:28 · 449 阅读 · 0 评论 -
hdu 5294 - Tricks Device(2015 Multi-University Training Contest 1 )最短路+网络流
Tricks DeviceProblem DescriptionInnocent 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,原创 2015-07-27 10:47:58 · 419 阅读 · 0 评论 -
网络流Dinic模板
struct Edge{ int from,to,cap,flow; Edge(int f=0,int t=0,int c=0,int fl=0):from(f),to(t),cap(c),flow(fl){}};struct Dinic{ int n,m,s,t; vector<Edge> edges; vector<int> G[maxn];原创 2015-08-01 15:28:23 · 331 阅读 · 0 评论 -
2015暑假训练赛团体赛(DLX+Trie模糊匹配+费用流)
A - Sudoku ExtensionSudoku is a logic-based, combinatorial number-placement puzzle. The objective is to fill a 9 x 9 grid so that each column, each row, and each of the nine 3 x 3 boxes (also called bl原创 2015-08-03 20:04:54 · 1522 阅读 · 0 评论 -
最小费用最小流uva10746
比较简单的最小费用最大流,主要是精度问题,一直wa#include#include#include#includeusing namespace std;const int maxm=500050;const int maxn=50;const int INF=1000000000;const int eps=1e-6;struct node{ int u,v,ne原创 2014-02-20 16:46:17 · 534 阅读 · 0 评论 -
无向图最小费用最大流+uva10594
思路:无向图,加边时需要两个方向,然后加一个超级源点0,0到1的容量为D,然后求最小费用最大流,如果=D,则输出最小费用,否则Impossible.注意数据的范围,要用long long。附代码:#include#include#include#includeusing namespace std;typedef long long LL;const LL INF=1000原创 2014-02-18 18:52:03 · 3295 阅读 · 1 评论 -
网络流+拆点+ISAP+uva563
题意:有一个矩形城市,坐标为整数的的点为路口,之间的连线为街道,现在有b个银行要被抢劫,能不能在经过每个路口至多一次的情况下,劫匪能逃到城市边缘思路:网络流。建立一个源点s和一个汇点t。将n*m个点的每个点A拆成两个点A1和A2且A1向A2连一条边。如果点A处是银行那么s与A1连一条边,如果B与A相邻,那么A2与B1连一条边,对于所有的边界点C,C2与汇点t连一条边,所有的边的容量都是1,最后原创 2014-02-18 15:34:12 · 660 阅读 · 0 评论 -
最大流算法总结
Edmonds-Karp:http://blog.csdn.net/moon_1st/article/details/5305524这个网站上讲解了一些概念,可以了解一下。Edmonds-Karp算法是Ford-Fulkerson方法的bfs实现,每次找增广路,把这条路上的所有点的流量加上这条路上的残余容量,再找新的增广路,直到找不到为止。下面时代码,其中fa存储的是增光路径,f是原创 2013-08-12 15:42:43 · 938 阅读 · 0 评论 -
最大流--poj1273
裸的最大流,没什么好说的,第一次做,总结一下这次犯的错误。首先queue开在了全局变量,然后就是没考虑重边,应该说还没接触过重边,以后要注意,据说写重边应该是没错,所以以后就写上,f[i][j]+=c,反正初始化后f是0。下面是代码,目前最大流只会这一种算法,接着学其他算法!#include#include#include#include#include#includeus原创 2013-08-12 15:13:10 · 482 阅读 · 0 评论 -
最大流(EK)--poj1149
Language:DefaultPIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14318 Accepted: 6375DescriptionMirko works on a pig farm that consists of M原创 2013-08-23 15:41:41 · 576 阅读 · 0 评论 -
网络流-poj3469
Language:DefaultDual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 16933 Accepted: 7292Case Time Limit: 5000MSDescriptionAs mo原创 2013-10-05 21:26:16 · 710 阅读 · 0 评论 -
网络流sap(模板)--poj3469
Language:DefaultDual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 16935 Accepted: 7294Case Time Limit: 5000MSDescriptionAs mo原创 2013-10-06 22:48:07 · 683 阅读 · 0 评论 -
最大权闭合图-poj2987
最大权闭合图(讲解转自http://www.cnblogs.com/wuyiqi/archive/2012/03/12/2391960.html):在一个图中,我们选取一些点构成集合,记为V,且集合中的出边(即集合中的点的向外连出的弧),所指向的终点(弧头)也在V中,则我们称V为闭合图。最大权闭合图即在所有闭合图中,集合中点的权值之和最大的V,我们称V为最大权闭合图。上图中闭合图有原创 2013-10-07 19:24:10 · 644 阅读 · 0 评论 -
无向图最小割--poj2914
Stoer-Wagner算法一个无向连通网络,去掉一个边集可以使其变成两个连通分量则这个边集就是割集;最小割集当然就权和最小的割集。可以用最小切割最大流定理:1.min=MAXINT,确定一个源点2.枚举汇点3.计算最大流,并确定当前源汇的最小割集,若比min小更新min4.转到2直到枚举完毕5.min即为所求输出min不难看出复杂度很高:枚举汇点要O(n),最短增原创 2013-10-11 20:22:26 · 930 阅读 · 0 评论 -
最小费用流算法模板--SPFA(邻接表)
//最小费用流struct edge{ int x,y,f,c,nxt;}e[E];int en,head[N],pre[N],dist[N],visited[N];void add(int x,int y,int f,int c){ e[en].x=x; e[en].y=y; e[en].f=f; e[en].c=c; e[en].nx原创 2013-10-15 15:03:58 · 1254 阅读 · 1 评论 -
最小费用最大流--poj2195
Language:DefaultGoing HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16119 Accepted: 8255DescriptionOn a grid map there are n little men an原创 2013-10-18 19:39:33 · 671 阅读 · 0 评论 -
网络流+拆点+sap+uva10330
自己写了个sap,不知道哪错了,搜了一下,都是用的EK。。。#include#include#includeusing namespace std;const int maxn=210;const int INF=0x3f3f3f3f;struct node{ int v,next,f;} edge[maxn*maxn];int pre[maxn],cur[maxn]原创 2014-01-15 21:23:59 · 747 阅读 · 3 评论 -
最小费用最大流uva10806+spfa
Problem ?Dijkstra, Dijkstra.Time Limit: 10 secondsDexter: "You don't understand. I can't walk...they've tied my shoelaces together."Topper Harley: "A knot. Bastards!"Jim Abraha原创 2014-02-01 11:14:52 · 574 阅读 · 0 评论 -
网络流|二分图+uva11045
My T-shirt suits me Our friend Victor participates as an instructor in an environmental volunteer program. His boss asked Victor to distribute N T-shirts to M volunteers, one T-shirt eac原创 2014-02-02 00:11:30 · 680 阅读 · 0 评论 -
uva753最大流
思路:源点到插头容量为1的边,插头到插头(适配器)容量为INF的边,插头到电器容量为1,电器到汇点同容量为1.这样建图应该没错,但交上去挂了。。。#include#include#include#include#include#includeusing namespace std;const int maxm=10000;const int maxn=110;const原创 2014-02-02 23:55:47 · 618 阅读 · 0 评论 -
2015 Multi-University Training Contest 5(hdu5343 - 5352)网络流+yy+(哈夫曼树+dp)
MZL’s xorProblem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n)(A_i+A_j)(1\leq i,j\leq n) The xor of an array B is defi原创 2015-08-06 12:00:59 · 857 阅读 · 0 评论