二分图最大匹配裸题 纯粹是为了练模板 做这道题就是凑数
今天发现cogs其实很好用而且比bzoj好看 以后试着刷cogs好了
从今天起开始刷网络流24题 虽然很水但是我网络流学的太烂了对不对 做做水题也是好事
不知道匈牙利存在的意义是什么 根本没有dinic快呀= =
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;
const int N=300,S=298,T=299,INF=1e9;
int n=0,n1=0;
int head[N],to[N*N],next[N*N],c[N*N],f[N*N],edge=1;
int d[N];
int q[N*N],front=0,back=0;
inline void addEdge(int u,int v,int argc) {
to[edge]=v,c[edge]=argc,next[edge]=head[u],head[u]=edge++;
to[edge]=u,c[edge]=0,next[edge]=head[v],head[v]=edge++;
}
inline void build() {
memset(head,-1,sizeof(head));
int u=0,v=0;
for (int i=1;i<=n1;++i)
addEdge(S,i,1);
for (int i=n1+1;i<=n;++i)
addEdge(i,T,1);
while (scanf("%d %d",&u,&v)==2)
addEdge(u,v,1);
}
int bfs() {
front=back=0;
memset(d,-1,sizeof(d));
d[S]=0;
q[back++]=S;
while (front<back) {
int x=q[front++];
for (int e=head[x];~e;e=next[e]) {
int v=to[e];
if (d[v]==-1 && c[e]>f[e]) {
d[v]=d[x]+1;
q[back++]=v;
}
}
}
return d[T]!=-1;
}
int dfs(int x,int mn) {
if (x==T || !mn)
return mn;
int flow=0;
for (int e=head[x];~e;e=next[e]) {
int v=to[e];
if (d[v]==d[x]+1 && c[e]>f[e]) {
int f0=dfs(v,min(mn,c[e]-f[e]));
f[e]+=f0;
f[e^1]-=f0;
flow+=f0;
mn-=f0;
if (!mn)
return flow;
}
}
if (mn)
d[x]=-1;
return flow;
}
int dinic() {
int flow=0;
while (bfs())
flow+=dfs(S,INF);
return flow;
}
int main(void) {
freopen("flyer.in","r",stdin);
freopen("flyer.out","w",stdout);
scanf("%d %d",&n,&n1);
build();
printf("%d\n",dinic());
fclose(stdin);
fclose(stdout);
return 0;
}
网络流24题:
http://218.28.19.228/cogs/problem/index.php?key=%E7%BD%91%E7%BB%9C%E6%B5%8124%E9%A2%98