转载请注明出处:http://blog.csdn.net/drecik__/article/details/7400577
/*
* 第一道最大流, 写的有点挫, 按照Ford算法来做;
* 也没用什么改进的最短增广算法;
* 转化为网络流的模型时稍微有点麻烦;
*/
#include <iostream>
#include <queue>
#include <cstring>
#include <cstdio>
using namespace std;
#define MAXN 1005
#define INF 9999999
#define INF2 999999
#define MIN( a, b ) ( (a) <= (b)? (a):(b) )
#define ABS( a ) ( (a) >= 0? (a) : -(a) )
// 边的属性结构;
struct EdgeType
{
int c;
int f; // 容量和流量;
};
EdgeType Edges[MAXN][MAXN]; // 邻接矩阵, 当两点之间不存在边时,c和f都赋值为INF;
int flag[MAXN]; // 标记, -1:未标记,0:已标记未检查,1:标记并检查;
int prar[MAXN]; // 标号的第一个分量,用于存放父节点;
int alpha[MAXN]; // 标号的第二个分量,存放可改进a;
// 第一个参数为源点,第二个为汇点;
int Ford( int s, int t, int iPointNum )
{
// 进行寻找增广路径;
while( true )
{
// 对标号进行初始化;
memset( flag, 0xff, sizeof(flag) );
// 对分量进行初始化;
memset( prar, 0xff, sizeof(prar) );
memset( alpha, 0xff, sizeof(alpha) );
// 初始化源点;
flag[s] = 0;
prar[s] = s;
alpha[s] = INF;
queue<int> queInt;
queInt.push( s );
while( !queInt.empty() && flag[t] == -1 )
{
int u = queInt.front();
queInt.pop();
// 循环每条边;
for ( int i = 0; i < iPointNum; ++i )
{
// 未标号;
if ( flag[i] == -1 )
{
// 正向且未满;
if ( Edges[u][i].c < INF && Edges[u][i].f < Edges[u][i].c )
{
// 进行标记;
flag[i] = 0;
prar[i] = u;
alpha[i] = MIN( alpha[u], Edges[u][i].c-Edges[u][i].f );
queInt.push( i );
}
// 反向且有流量;
if ( Edges[i][u].c < INF && Edges[i][u].f > 0 )
{
// 进行标记;
flag[i] = 0;
prar[i] = -u;
alpha[i] = MIN( alpha[u], Edges[i][u].f );
queInt.push( i );
}
}
}
flag[u] = 1; // 标号为检查完毕;
}
// 当汇点没有进行标号,或调整量为0, 退出循环;
if ( flag[t] == -1 || alpha[t] == 0 )
break;
// 进行调整;
int k1 = t, k2 = ABS(prar[t]);
while ( true )
{
if ( Edges[k2][k1].f < INF ) // 正向;
Edges[k2][k1].f = Edges[k2][k1].f + alpha[t];
else
Edges[k1][k2].f = Edges[k1][k2].f - alpha[t];
if ( k2 == s )
break;
k1 = k2;
k2 = ABS( prar[k1] );
}
}
// 存放最大流;
int iMaxFlow = 0;
for ( int i = 0; i < iPointNum; ++i )
{
if ( Edges[0][i].f < INF )
iMaxFlow += Edges[0][i].f;
}
return iMaxFlow;
}
int main()
{
int iSet[MAXN] = {0};
int Pigs[MAXN] = {0};
int m;
int n;
scanf( "%d%d", &m, &n );
for ( int i = 0; i < n+2; ++i )
{
for ( int j = 0; j < n+2; ++j )
Edges[i][j].c = Edges[i][j].f = INF;
}
for ( int i = 1; i <= m; ++i )
scanf( "%d", &Pigs[i] );
for ( int i = 1; i <= n; ++i )
{
int t;
scanf( "%d", &t );
int num;
while ( t-- )
{
scanf( "%d", &num );
if ( iSet[num] != 0 )
{
Edges[iSet[num]][i].f = 0;
Edges[iSet[num]][i].c = INF2;
iSet[num] = i;
}
else
{
iSet[num] = i;
if ( Edges[0][i].c != INF )
Edges[0][i].c += Pigs[num];
else
{
Edges[0][i].c = Pigs[num];
Edges[0][i].f = 0;
}
}
}
scanf( "%d", &Edges[i][n+1].c );
Edges[i][n+1].f = 0;
}
cout << Ford( 0, n+1, n+2 ) << endl;
return 0;
}
/*
* 改写用最短路增广算法;
* 效率有点提高, 上面的为63ms, 这个为47ms;
* 接下去再写个连续最短增广路试试;
*/
#include <iostream>
#include <queue>
#include <cstring>
#include <cstdio>
using namespace std;
#define MAXN 1005
#define INF 9999999
#define INF2 999999
#define MIN( a, b ) ( (a) <= (b)? (a):(b) )
#define ABS( a ) ( (a) >= 0? (a) : -(a) )
// 边的属性结构;
struct EdgeType
{
int c;
int f; // 容量和流量;
};
EdgeType Edges[MAXN][MAXN]; // 邻接矩阵, 当两点之间不存在边时,c和f都赋值为INF;
int flag[MAXN]; // 标记, -1:未标记,0:已标记未检查,1:标记并检查;
int prar[MAXN]; // 标号的第一个分量,用于存放父节点;
int alpha[MAXN]; // 标号的第二个分量,存放可改进a;
int level[MAXN]; // 各个顶点的等级;
void BFS( int s, int n )
{
memset( level, 0, sizeof(level) );
queue<int> queInt;
queInt.push( s );
while ( !queInt.empty() )
{
int u = queInt.front();
queInt.pop();
for ( int i = 0; i < n; ++i )
{
if ( i == s )
continue;
if ( !level[i] && Edges[u][i].c < INF && Edges[u][i].f < Edges[u][i].c )
{
level[i] = level[u]+1;
queInt.push(i);
}
if ( !level[i] && Edges[i][u].c < INF && Edges[i][u].f > 0 )
{
level[i] = level[u]+1;
queInt.push(i);
}
}
}
}
// 第一个参数为源点,第二个为汇点, 第三个为顶点个数;
int Ford( int s, int t, int n )
{
// 进行寻找增广路径;
while ( true )
{
BFS( s, n );
if ( !level[t] )
break;
while( true )
{
// 对标号进行初始化;
memset( flag, 0xff, sizeof(flag) );
// 对分量进行初始化;
memset( prar, 0xff, sizeof(prar) );
memset( alpha, 0xff, sizeof(alpha) );
// 初始化源点;
flag[s] = 0;
prar[s] = s;
alpha[s] = INF;
queue<int> queInt;
queInt.push( s );
while( !queInt.empty() && flag[t] == -1 )
{
int u = queInt.front();
queInt.pop();
// 循环每条边;
for ( int i = 0; i < n; ++i )
{
// 未标号;
if ( flag[i] == -1 && level[i] == level[u]+1 )
{
// 正向且未满;
if ( Edges[u][i].c < INF && Edges[u][i].f < Edges[u][i].c )
{
// 进行标记;
flag[i] = 0;
prar[i] = u;
alpha[i] = MIN( alpha[u], Edges[u][i].c-Edges[u][i].f );
queInt.push( i );
}
// 反向且有流量;
if ( Edges[i][u].c < INF && Edges[i][u].f > 0 )
{
// 进行标记;
flag[i] = 0;
prar[i] = -u;
alpha[i] = MIN( alpha[u], Edges[i][u].f );
queInt.push( i );
}
}
}
flag[u] = 1; // 标号为检查完毕;
}
// 当汇点没有进行标号,或调整量为0, 退出循环;
if ( flag[t] == -1 || alpha[t] == 0 )
break;
// 进行调整;
int k1 = t, k2 = ABS(prar[t]);
while ( true )
{
if ( Edges[k2][k1].f < INF ) // 正向;
Edges[k2][k1].f = Edges[k2][k1].f + alpha[t];
else
Edges[k1][k2].f = Edges[k1][k2].f - alpha[t];
if ( k2 == s )
break;
k1 = k2;
k2 = ABS( prar[k1] );
}
}
}
// 存放最大流;
int iMaxFlow = 0;
for ( int i = 0; i < n; ++i )
{
if ( Edges[0][i].f < INF )
iMaxFlow += Edges[0][i].f;
}
return iMaxFlow;
}
int main()
{
int iSet[MAXN] = {0};
int Pigs[MAXN] = {0};
int m;
int n;
scanf( "%d%d", &m, &n );
for ( int i = 0; i < n+2; ++i )
{
for ( int j = 0; j < n+2; ++j )
Edges[i][j].c = Edges[i][j].f = INF;
}
for ( int i = 1; i <= m; ++i )
scanf( "%d", &Pigs[i] );
for ( int i = 1; i <= n; ++i )
{
int t;
scanf( "%d", &t );
int num;
while ( t-- )
{
scanf( "%d", &num );
if ( iSet[num] != 0 )
{
Edges[iSet[num]][i].f = 0;
Edges[iSet[num]][i].c = INF2;
iSet[num] = i;
}
else
{
iSet[num] = i;
if ( Edges[0][i].c != INF )
Edges[0][i].c += Pigs[num];
else
{
Edges[0][i].c = Pigs[num];
Edges[0][i].f = 0;
}
}
}
scanf( "%d", &Edges[i][n+1].c );
Edges[i][n+1].f = 0;
}
cout << Ford( 0, n+1, n+2 ) << endl;
return 0;
}
/*
* 用了连续最短增广算法;
* 之前WA了一次, 也不知道改了哪里, 就稀里糊涂的对了;
* 用了16ms, 果然要快点;
*/
#include <iostream>
#include <queue>
#include <cstring>
#include <cstdio>
using namespace std;
#define MAXN 1005
#define INF 9999999
#define INF2 999999
#define MIN( a, b ) ( (a) <= (b)? (a):(b) )
#define ABS( a ) ( (a) >= 0? (a) : -(a) )
// 边的属性结构;
struct EdgeType
{
int c;
int f; // 容量和流量;
};
EdgeType Edges[MAXN][MAXN]; // 邻接矩阵, 当两点之间不存在边时,c和f都赋值为INF;
int flag[MAXN]; // 标记, -1:未标记,0:已标记未检查,1:标记并检查, 回溯之后要标记为-1;
int prar[MAXN]; // 标号的第一个分量,用于存放父节点;
int alpha[MAXN]; // 标号的第二个分量,存放可改进a;
int level[MAXN]; // 各个顶点的等级;
void BFS( int s, int n )
{
memset( level, 0, sizeof(level) );
queue<int> queInt;
queInt.push( s );
while ( !queInt.empty() )
{
int u = queInt.front();
queInt.pop();
for ( int i = 0; i < n; ++i )
{
if ( i == s )
continue;
if ( !level[i] && Edges[u][i].c < INF && Edges[u][i].f < Edges[u][i].c )
{
level[i] = level[u]+1;
queInt.push(i);
}
if ( !level[i] && Edges[i][u].c < INF && Edges[i][u].f > 0 )
{
level[i] = level[u]+1;
queInt.push(i);
}
}
}
}
// 进行深搜, 搜索的点, 汇点, 顶点个数;
int DFS( int s, int t, int n )
{
if ( s == t )
return alpha[t];
// 标记为已读;
flag[s] = 0;
// 用于存放回溯是的增量;
int sumAlpha = 0;
for ( int i = 0; i < n; ++i )
{
if ( flag[i] == -1 && level[i] == level[s]+1 )
{
// 正向边;
if ( Edges[s][i].c < INF && Edges[s][i].f < Edges[s][i].c )
{
// 进行标记;
prar[i] = s;
alpha[i] = MIN( alpha[s], Edges[s][i].c-Edges[s][i].f );
int x = DFS( i, t, n );
Edges[s][i].f += x;
alpha[s] -= x;
sumAlpha += x;
}
// 反向边;
if ( Edges[i][s].c < INF && Edges[i][s].f > 0 )
{
// 进行标记;
prar[i] = s;
alpha[i] = MIN( alpha[s], Edges[i][s].f );
int x = DFS( i, t, n );
Edges[i][s].f -= x;
alpha[s] -= x;
sumAlpha += x;
}
}
}
flag[s] = -1;
return sumAlpha;
}
// 第一个参数为源点,第二个为汇点;
int Ford( int s, int t, int n )
{
// 进行寻找增广路径;
while ( BFS( s, n ), level[t] )
{
// 对标号进行初始化;
memset( flag, 0xff, sizeof(flag) );
// 对分量进行初始化;
memset( prar, 0xff, sizeof(prar) );
memset( alpha, 0xff, sizeof(alpha) );
alpha[s] = INF;
prar[s] = s;
DFS( s, t, n );
}
// 存放最大流;
int iMaxFlow = 0;
for ( int i = 0; i < n; ++i )
{
if ( Edges[s][i].f < INF )
iMaxFlow += Edges[s][i].f;
}
return iMaxFlow;
}
int main()
{
int iSet[MAXN] = {0};
int Pigs[MAXN] = {0};
int m;
int n;
scanf( "%d%d", &m, &n );
for ( int i = 0; i < n+2; ++i )
{
for ( int j = 0; j < n+2; ++j )
Edges[i][j].c = Edges[i][j].f = INF;
}
for ( int i = 1; i <= m; ++i )
scanf( "%d", &Pigs[i] );
for ( int i = 1; i <= n; ++i )
{
int t;
scanf( "%d", &t );
int num;
while ( t-- )
{
scanf( "%d", &num );
if ( iSet[num] != 0 )
{
Edges[iSet[num]][i].f = 0;
Edges[iSet[num]][i].c = INF2;
iSet[num] = i;
}
else
{
iSet[num] = i;
if ( Edges[0][i].c != INF )
Edges[0][i].c += Pigs[num];
else
{
Edges[0][i].c = Pigs[num];
Edges[0][i].f = 0;
}
}
}
scanf( "%d", &Edges[i][n+1].c );
Edges[i][n+1].f = 0;
}
cout << Ford( 0, n+1, n+2 ) << endl;
return 0;
}