网络最大流
题目来源:洛谷P3376
题目背景:
请注意,一般的 dinic/ISAP 通过本题的单测试点用时不超过 50ms,为了避免评测波动导致程序超时,本题时间限制设为 300ms,如果您的单测试点用时超过 100ms,请您检验您的代码是否存在错误。
题目描述:
如题,给出一个网络图,以及其源点和汇点,求出其网络最大流。
输入格式:
第一行包含四个正整数 n,m,s,t,分别表示点的个数、有向边的个数、源点序号、汇点序号。
接下来M行每行包含三个正整数 ui,vi,wi ,表示第 ii 条有向边从 ui出发,到达 vi,边权为 wi (即该边最大流量为 wi)。
输出格式:
一行,包含一个正整数,即为该网络的最大流。
样例输入:
4 5 4 3
4 2 30
4 3 20
2 3 20
2 1 30
1 3 40
样例输出:
50
网络最大流模板题,网络流的关键在于加入一个各条边权值都是0的“反向图”,以及不断地bfs标记分层和dfs“寻路”(寻路完成后,其各边减去其公共权值,并为其反向边加上相同权值)。加入“当前弧优化”,可以忽略前面已经跑过的弧(相当于剪枝),但注意每次bfs前,当前弧优化的标记数组都应该重新初始化。
#pragma GCC optimize(3,"Ofast","inline")
#pragma G++ optimize(3)
#include<bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <sstream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef queue<int> q_i;
typedef queue<string> q_s;
typedef queue<double> q_d;
typedef queue<ll> q_ll;
typedef queue<char> q_c;
typedef priority_queue<int> pq_i;
typedef priority_queue<string> pq_s;
typedef priority_queue<double> pq_d;
typedef priority_queue<ll> pq_ll;
typedef stack<int> s_i;
typedef stack<string> s_s;
typedef stack<double> s_d;
typedef stack<ll> s_ll;
typedef stack<char> s_c;
typedef map<ll,ll> m_ll_ll;
typedef map<int,ll> m_i_ll;
typedef map<int,int> m_i_i;
typedef map<string,ll> m_s_ll;
typedef map<char,int> m_c_i;
typedef map<char,ll> m_c_ll;
const ll INF=0x3f3f3f3f;
#define rep(i,l,r) for(register int i=l;i<=r;i++)
#define per(i,l,r) for(register int i=r;i>=l;i--)
#define eif else if
#define N 100005
#define mm(dp) memset(dp,0,sizeof(dp))
#define mm1(dp) memset(dp,-1,sizeof(dp))
#define mm2(dp) memset(dp,0x3f,sizeof(dp))
#define IT set<int>::iterator
#define fs(n) fixed<< setprecision(n)
const double E=2.71828182845;
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
const double pi = acos(-1.0);
const ll mod=1000000007;
void read(int &x)
{
char ch=getchar();
x=0;
for(; ch<'0'||ch>'9'; ch=getchar());
for(; ch>='0'&&ch<='9'; x=x*10+ch-'0',ch=getchar());
}
inline void write(ll x)
{
if(x<0)
putchar('-'),x=-x;
if(x>9)
write(x/10);
putchar(x%10+'0');
}
float SqrtByCarmack( float number )
{
int i;
float x2, y;
const float threehalfs = 1.5F;
x2 = number * 0.5F;
y = number;
i = * ( int * ) &y;
i = 0x5f375a86 - ( i >> 1 );
y = * ( float * ) &i;
y = y * ( threehalfs - ( x2 * y * y ) );
y = y * ( threehalfs - ( x2 * y * y ) );
y = y * ( threehalfs - ( x2 * y * y ) );
return number*y;
}
ll qpow(ll a,ll b,ll mod)
{
ll sum=1;
while(b)
{
if(b%2==1)
{
sum=sum*a%mod;
}
b/=2;
a=a*a%mod;
}
return sum;
}
int erfen(int *a,int start,int endd,int l)//小于等于l的最大值的角标
{
int mid=(start+endd)/2;
if((a[mid]<=l&&a[mid+1]>l)||(mid==endd&&a[mid]<=l))
return mid;
else if(a[mid]<=l)
return erfen(a,mid+1,endd,l);
else if(a[mid]>l)
{
if(start!=mid)
return erfen(a,start,mid,l);
else
return start-1;
}
}
ll prime[6] = {2, 3, 5, 233, 331};
ll qmul(ll x, ll y, ll mod)
{
return (x * y - (long long)(x / (long double)mod * y + 1e-3) *mod + mod) % mod;
}
bool Miller_Rabin(ll p)
{
if(p < 2)
return 0;
if(p != 2 && p % 2 == 0)
return 0;
ll s = p - 1;
while(! (s & 1))
s >>= 1;
for(int i = 0; i < 5; ++i)
{
if(p == prime[i])
return 1;
ll t = s, m = qpow(prime[i], s, p);
while(t != p - 1 && m != 1 && m != p - 1)
{
m = qmul(m, m, p);
t <<= 1;
}
if(m != p - 1 && !(t & 1))
return 0;
}
return 1;
}
ll gcd(ll x,ll y)
{
if(y==0)
return x;
else
return gcd(y,x%y);
}
int n;
int book[10005];
int cur[10005];
int dis[10005];
typedef struct
{
ll to,value,next;
}STU;
STU e[20005];
int flag=0;
inline void add(int u,int v,int k)
{
flag++;
e[flag].to=v;
e[flag].value=k;
e[flag].next=book[u];
book[u]=flag;
}
inline bool bfs(int s,int t)
{
rep(i,1,n)
dis[i]=-1;
dis[s]=0;
queue<int>que;
que.push(s);
//cur[s]=book[s];
while(!que.empty())
{
int top=que.front();
que.pop();
for(int i=book[top];i;i=e[i].next)
{
int j=e[i].to;
if(dis[j]==-1&&e[i].value)
{
dis[j]=dis[top]+1;
que.push(j);
//cur[j]=book[j];
}
}
}
if(dis[t]==-1)
return false;
else
return true;
}
inline ll dfs(int t,int u,ll flow)
{
if(u==t)
return flow;
ll sheng=flow;
for(int i=cur[u];i;i=e[i].next)
{
cur[u]=i;//当前弧优化
int j=e[i].to;
if(dis[j]==(1+dis[u])&&e[i].value)
{
ll d=dfs(t,j,min(sheng,e[i].value));
if(d==0)
dis[j]=-1;
e[i].value-=d;
if(i%2==0)
e[i-1].value+=d;
else
e[i+1].value+=d;
sheng-=d;
if(sheng==0)
break;
}
}
return flow-sheng;
}
inline ll dinic(int s,int t)
{
ll ans = 0;
while (bfs(s,t))
{
rep(i,1,n)
cur[i]=book[i];
ans += dfs(t,s,INF);
//cout<<ans<<endl;
}
return ans;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int m,s,t;
read(n);
read(m);
read(s);
read(t);
while(m--)
{
int u,v,w;
read(u);
read(v);
read(w);
add(u,v,w);
add(v,u,0);
}
ll num=dinic(s,t);
cout<<num<<endl;
return 0;
}