模板链接
这里特别注意!!!第一个题解有致命漏洞!虽然可以过模板,但是大部分题RE!!这里改正:
在模板hlpp中,原题解:
if (!--gap[h[now]])
应改为:
if (h[now] != inf && !--gap[h[now]])
更新(2020.5.14):下面这个已经不可以过洛谷的模板了, 所以追(piao)加(qie)了个更快的.
下面是模板代码:
const int N = 1e5+5;
const int inf = 0x3f3f3f3f;
int tot = 1;
int ver[N<<1], w[N<<1], he[N], ne[N<<1];
int h[N], e[N], gap[N<<1], inq[N];
int n, m, k;
int s, t;
int all;//all为最大节点编号,从0或1开始需要改遍历范围。
struct cmp
{
bool operator () (int a, int b)
{
return h[a] < h[b];
}
};
queue<int> q;
priority_queue<int , vector<int>, cmp> p;
void add(int x, int y, int _w = 1)
{
ver[++tot] = y;
ne[tot] = he[x];
w[tot] = _w;
he[x] = tot;
ver[++tot] = x;
ne[tot] = he[y];
w[tot] = 0;
he[y] = tot;
}
bool bfs()
{
memset(h, 0x3f, sizeof(h));
h[t] = 0; q.push(t);
while(q.size())
{
int now = q.front(); q.pop();
for (int i = he[now]; i; i = ne[i])
{
if (w[i^1] && h[ver[i]] > h[now]+1)
h[ver[i]] = h[now]+1,q.push(ver[i]);
}
}
return h[s] != inf;
}
void _push(int now)
{
for (int i = he[now]; i; i = ne[i])
{
if (w[i] && h[ver[i]] +1 == h[now])
{
int d = min(e[now], w[i]);
w[i] -= d; w[i^1] += d; e[now] -= d; e[ver[i]] += d;
if (ver[i] != s && ver[i] != t && !inq[ver[i]])
p.push(ver[i]), inq[ver[i]] = 1;
if (!e[now]) break;
}
}
}
void relabel(int now)
{
h[now] = inf;
for (int i = he[now]; i; i = ne[i])
{
if (w[i] && h[ver[i]]+1 < h[now])
h[now] = h[ver[i]]+1;
}
}
int hlpp()
{
if (!bfs())
return 0;
int d, now;
h[s] = all;
memset(gap, 0, sizeof(gap));
for(int i = 0; i <= all; i++)
if (h[i] < inf)
++gap[h[i]];
for (int i = he[s]; i; i = ne[i])
{
if (d = w[i])
{
w[i] -= d; w[i^1] += d; e[s] -= d; e[ver[i]] += d;
if (ver[i] != s && ver[i] != t && !inq[ver[i]])
p.push(ver[i]), inq[ver[i]] = 1;
}
}
while(p.size())
{
inq[now = p.top()] = 0;
p.pop(); _push(now);
if (e[now])
{
if (h[now] != inf && !--gap[h[now]])
for (int i = 0; i <= all; i++)
if (i != s && i != t && h[i] > h[now] && h[i] < all+1)
h[i] = all+1;
relabel(now); ++gap[h[now]];
p.push(now);inq[now] = 1;
}
}
return e[t];
}
一个更快的板子(按理说比赛的时候没有出题人会卡的这么死吧):
下面是模板代码:
const int INF = 0x7fffffff;
std::vector<int>list[1203],h,cnt,que,e;
typedef std::list<int> List;
std::vector<List::iterator>iter;
List dlist[1203];
typedef std::vector<edge>::iterator Iterator;
int hst,nowh;
int he[1203], ver[24000010], ne[2400010], c[2400010], tot = 1;
inline void addEdge(const int x,const int y,const int w)
{
ver[++tot] = y;
ne[tot] = he[x];
he[x] = tot;
c[tot] = w;
ver[++tot] = x;
ne[tot] = he[y];
he[y] = tot;
c[tot] = 0;
}
inline void relabel(int n,int t)
{
h.assign(n,n);h[t]=0;
cnt.assign(n,0);
que.clear();
que.resize(n+1);
int qh=0,qt=0;
for(que[qt++]=t;qh<qt;)
{
int u=que[qh++],het=h[u]+1;
for(int i = he[u]; i; i = ne[i])
{
int y = ver[i];
if(h[y]==n&&c[i^1] > 0)
{
cnt[h[y]=het]++;
que[qt++]= y;
}
}
}
for(register int i=0;i<=n;++i){list[i].clear();dlist[i].clear();}
for(register int u=0;u<n;++u)
{
if(h[u]<n)
{
iter[u]=dlist[h[u]].insert(dlist[h[u]].begin(),u);
if(e[u]>0)list[h[u]].push_back(u);
}
}
hst=(nowh=h[que[qt-1]]);
}
inline void push(int u, int i)
{
int v= ver[i];
int df=std::min(e[u],c[i]); c[i] -= df;
c[i^1] += df;
e[u]-=df;e[v]+=df;
if(0<e[v]&&e[v]<=df)list[h[v]].push_back(v);
}
inline void _push(int n,int u)
{
int nh=n;
for(int i = he[u]; i; i = ne[i])
{
if(c[i] > 0)
{
int y = ver[i];
if(h[u]==h[y]+1){push(u, i);if(e[u]==0)return;}
else nh=std::min(nh,h[y]+1);
}
}
int het=h[u];
if(cnt[het]==1)
{
for(register int i=het;i<=hst;++i)
{
for(List::iterator it=dlist[i].begin();it!=dlist[i].end();++it){cnt[h[*it]]--;h[*it]=n;}
dlist[i].clear();
}
hst=het-1;
}
else
{
cnt[het]--;
iter[u]=dlist[het].erase(iter[u]);
h[u]=nh;
if(nh==n)return;
cnt[nh]++;
iter[u]=dlist[nh].insert(dlist[nh].begin(),u);
hst=std::max(hst,nowh=nh);
list[nh].push_back(u);
}
}
inline int hlpp(int n,int s,int t)
{
if(s==t)return 0;
nowh=0;hst=0;
h.assign(n,0);h[s]=n;
iter.resize(n);
for(register int i=0;i<n;++i)if(i!=s)iter[i]=dlist[h[i]].insert(dlist[h[i]].begin(),i);
cnt.assign(n,0);cnt[0]=n-1;
e.assign(n,0);e[s]=INF;e[t]=-INF;
for (int i = he[s]; i; i = ne[i]) _push(s, ver[i]);
relabel(n,t);
for(int u;nowh>=0;)
{
if(list[nowh].empty()){nowh--;continue;}
u=list[nowh].back();
list[nowh].pop_back();
_push(n,u);
}
return e[t]+INF;
}
int n,m,s,t,u,v,f;
signed main()
{
scanf("%d%d%d%d", &n, &m, &s, &t);
for(register int i=m;i>0;--i)
{
scanf("%d%d%d", &u, &v, &f); addEdge(u,v,f);
}
printf("%d",hlpp(n+1,s,t));
return 0;
}
一个最快的板子,(下面的那个存图用vector, 这两个的都来着洛谷题解中的大佬, 上面那个是我重构的,俺也不知道为啥向前星慢,我也不是第一次遇见这种情况了 )
下面是模板代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include <map>
#include <queue>
#include <set>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <time.h>
#define ll long long
#define int ll
#define ull unsigned ll
#define _min(x, y) ((x)>(y)?(y):(x))
#define _max(x, y) ((x)>(y)?(x):(y))
#define max3(x, y, z) ( max( (x), max( (y), (z) ) ) )
#define min3(x, y, z) ( min( (x), min( (y), (z) ) ) )
#define pr(x, y) (make_pair((x), (y)))
//using namespace std;
const int INF = 0x7fffffff;
struct edge
{
int to,flow,next;
edge(int to,int flow,int next):to(to),flow(flow),next(next){}
};
std::vector<edge>a[1203];
std::vector<int>list[1203],h,cnt,que,e;
typedef std::list<int> List;
std::vector<List::iterator>iter;
List dlist[1203];
typedef std::vector<edge>::iterator Iterator;
int hst,nowh;
inline void addEdge(const int u,const int v,const int f)
{
a[u].push_back(edge(v,f,a[v].size()));
a[v].push_back(edge(u,0,a[u].size()-1));
}
inline void relabel(int n,int t)
{
h.assign(n,n);h[t]=0;
cnt.assign(n,0);
que.clear();
que.resize(n+1);
int qh=0,qt=0;
for(que[qt++]=t;qh<qt;)
{
int u=que[qh++],het=h[u]+1;
for(Iterator p=a[u].begin();p!=a[u].end();++p)
{
if(h[p->to]==n&&a[p->to][p->next].flow>0)
{
cnt[h[p->to]=het]++;
que[qt++]=p->to;
}
}
}
for(register int i=0;i<=n;++i){list[i].clear();dlist[i].clear();}
for(register int u=0;u<n;++u)
{
if(h[u]<n)
{
iter[u]=dlist[h[u]].insert(dlist[h[u]].begin(),u);
if(e[u]>0)list[h[u]].push_back(u);
}
}
hst=(nowh=h[que[qt-1]]);
}
inline void push(int u,edge &ed)
{
int v=ed.to;
int df=std::min(e[u],ed.flow);ed.flow-=df;
a[v][ed.next].flow+=df;
e[u]-=df;e[v]+=df;
if(0<e[v]&&e[v]<=df)list[h[v]].push_back(v);
}
inline void push(int n,int u)
{
int nh=n;
for(Iterator p=a[u].begin();p!=a[u].end();++p)
{
if(p->flow>0)
{
if(h[u]==h[p->to]+1){push(u,*p);if(e[u]==0)return;}
else nh=std::min(nh,h[p->to]+1);
}
}
int het=h[u];
if(cnt[het]==1)
{
for(register int i=het;i<=hst;++i)
{
for(List::iterator it=dlist[i].begin();it!=dlist[i].end();++it){cnt[h[*it]]--;h[*it]=n;}
dlist[i].clear();
}
hst=het-1;
}
else
{
cnt[het]--;
iter[u]=dlist[het].erase(iter[u]);
h[u]=nh;
if(nh==n)return;
cnt[nh]++;
iter[u]=dlist[nh].insert(dlist[nh].begin(),u);
hst=std::max(hst,nowh=nh);
list[nh].push_back(u);
}
}
inline int hlpp(int n,int s,int t)
{
if(s==t)return 0;
nowh=0;hst=0;
h.assign(n,0);h[s]=n;
iter.resize(n);
for(register int i=0;i<n;++i)if(i!=s)iter[i]=dlist[h[i]].insert(dlist[h[i]].begin(),i);
cnt.assign(n,0);cnt[0]=n-1;
e.assign(n,0);e[s]=INF;e[t]=-INF;
for(register int i=0;i<(int)a[s].size();++i)push(s,a[s][i]);
relabel(n,t);
for(int u;nowh>=0;)
{
if(list[nowh].empty()){nowh--;continue;}
u=list[nowh].back();
list[nowh].pop_back();
push(n,u);
}
return e[t]+INF;
}
inline int read()
{
int f=0,fu=1;
char c=getchar();
while(c<'0'||c>'9'){if(c=='-')fu=-1;c=getchar();}
while(c>='0'&&c<='9'){f=(f<<3)+(f<<1)+c-48;c=getchar();}
return f*fu;
}
int n,m,s,t,u,v,f;
signed main()
{
n=read(),m=read(),s=read(),t=read();
for(register int i=m;i>0;--i){u=read(),v=read(),f=read();addEdge(u,v,f);}
printf("%d",hlpp(n+1,s,t));
return 0;
}