这三题简直一模一样:
P1402 酒店之王
P1231 教辅的组成
P2891 [USACO07OPEN]吃饭Dining
网络流-最大流-最大匹配
感觉就是三分图匹配(雾
注意,三分图中间的那一层需要拆点,不然一个点可能被访问多次
代码:
P2891 [USACO07OPEN]吃饭Dining
#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
const int Maxn=50000+20,Maxm=999999,inf=0x3f3f3f3f;
int nxt[Maxm],flow[Maxm],to[Maxm];
int head[Maxn],d[Maxn];
int n,m,k,s,t;
int ans,edgecnt=1;
inline int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')w=-1;ch=getchar();}
while(ch>='0' && ch<='9')s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
inline void add(int x,int y,int c)
{
++edgecnt;
nxt[edgecnt]=head[x];
to[edgecnt]=y;
flow[edgecnt]=c;
head[x]=edgecnt;
}
bool bfs()
{
queue <int> q;
memset(d,0,sizeof(d));
d[s]=1,q.push(s);
while(q.size())
{
int x=q.front();
q.pop();
for(int i=head[x];i;i=nxt[i])
{
int y=to[i];
if(d[y] || !flow[i])continue;
d[y]=d[x]+1;
if(y==t)return 1;
q.push(y);
}
}
return 0;
}
int dinic(int x,int cur)
{
if(x==t)return cur;
int ret=cur;
for(int i=head[x];i && ret;i=nxt[i])
{
int y=to[i];
if(d[y]!=d[x]+1 || !flow[i])continue;
int tmp=dinic(y,min(ret,flow[i]));
if(!tmp)d[y]=0;
flow[i]-=tmp,flow[i^1]+=tmp,ret-=tmp;
}
return cur