POJ 3281 Dining
来源:互联网 发布:淘宝买家拒签怎么办 编辑:程序博客网 时间:2024/05/17 07:25
ISAP最大流...果粉专用的最大流
Description
Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others.
Farmer John has cooked fabulous meals for his cows, but he forgot to check his menu against their preferences. Although he might not be able to stuff everybody, he wants to give a complete meal of both food and drink to as many cows as possible.
Farmer John has cooked F (1 ≤ F ≤ 100) types of foods and prepared D (1 ≤ D ≤ 100) types of drinks. Each of his N (1 ≤ N ≤ 100) cows has decided whether she is willing to eat a particular food or drink a particular drink. Farmer John must assign a food type and a drink type to each cow to maximize the number of cows who get both.
Each dish or drink can only be consumed by one cow (i.e., once food type 2 is assigned to a cow, no other cow can be assigned food type 2).
Input
Lines 2..N+1: Each line i starts with a two integers Fi and Di, the number of dishes that cow i likes and the number of drinks that cow i likes. The next Fi integers denote the dishes that cow i will eat, and the Di integers following that denote the drinks that cow i will drink.
Output
Sample Input
4 3 32 2 1 2 3 12 2 2 3 1 22 2 1 3 1 22 1 1 3 3
Sample Output
3
Hint
Cow 1: no meal
Cow 2: Food #2, Drink #2
Cow 3: Food #1, Drink #1
Cow 4: Food #3, Drink #3
The pigeon-hole principle tells us we can do no better since there are only three kinds of food or drink. Other test data sets are more challenging, of course.
Source
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=500;const int maxm=maxn*maxn;const int INF=0x3f3f3f3f;struct Edge{ int to,next,cap,flow;}edge[maxm];int Size,Adj[maxn];int gap[maxn],dep[maxn],pre[maxn],cur[maxn];void init(){ Size=0; memset(Adj,-1,sizeof(Adj));}void addedge(int u,int v,int w,int rw=0){ edge[Size].to=v; edge[Size].cap=w; edge[Size].next=Adj[u]; edge[Size].flow=0; Adj[u]=Size++; edge[Size].to=u; edge[Size].cap=rw; edge[Size].next=Adj[v]; edge[Size].flow=0; Adj[v]=Size++;}int sap(int start,int end,int N){ memset(gap,0,sizeof(gap)); memset(dep,0,sizeof(dep)); memcpy(cur,Adj,sizeof(Adj)); int u=start; pre[u]=-1; gap[0]=N; int ans=0; while(dep[start]<N) { if(u==end) { int Min=INF; for(int i=pre[u];~i;i=pre[edge[i^1].to]) if(Min>edge[i].cap-edge[i].flow) Min=edge[i].cap-edge[i].flow; for(int i=pre[u];~i;i=pre[edge[i^1].to]) { edge[i].flow+=Min; edge[i^1].flow-=Min; } u=start; ans+=Min; continue; } bool flag=false; int v; for(int i=cur[u];~i;i=edge[i].next) { v=edge[i].to; if(edge[i].cap-edge[i].flow&&dep[v]+1==dep[u]) { flag=true; cur[u]=pre[v]=i; break; } } if(flag) { u=v; continue; } int Min=N; for(int i=Adj[u];~i;i=edge[i].next) if(edge[i].cap-edge[i].flow&&dep[edge[i].to]<Min) { Min=dep[edge[i].to]; cur[u]=i; } gap[dep[u]]--; if(!gap[dep[u]]) return ans; dep[u]=Min+1; gap[dep[u]]++; if(u!=start) u=edge[pre[u]^1].to; } return ans;}int N,F,D;bool linked[600][600];int main(){ while(scanf("%d%d%d",&N,&F,&D)!=EOF) { init(); memset(linked,false,sizeof(linked)); for(int i=1;i<=N;i++) { int nf,nd; scanf("%d%d",&nf,&nd); for(int j=0;j<nf;j++) { int x; scanf("%d",&x); if(linked[0][x]==false) { linked[0][x]=true; addedge(0,x,1); } if(linked[x][i+F]==false) { linked[x][i+F]=true; addedge(x,i+F,1); } } for(int j=0;j<nd;j++) { int x; scanf("%d",&x); if(linked[i+F+N][F+2*N+x]==false) { linked[i+F+N][F+2*N+x]=true; addedge(i+F+N,F+2*N+x,1); } if(linked[x+F+2*N][F+2*N+D+1]==false) { linked[x+F+2*N][F+2*N+D+1]=true; addedge(x+F+2*N,F+2*N+D+1,1); } } if(linked[i+F][i+F+N]==false) { linked[i+F][i+F+N]=true; addedge(i+F,i+F+N,1); } } printf("%d\n",sap(0,F+2*N+D+1,F+2*N+D+2)); } return 0;}
- poj 3281 Dining Maxflow
- POJ 3281 Dining
- poj 3281 Dining //SAP
- POJ 3281 Dining
- poj 3281 Dining
- poj 3281 Dining
- POJ 3281 Dining
- POJ 3281 Dining
- poj 3281 Dining
- POJ-3281-Dining
- poj(3281)Dining
- POJ 3281 Dining
- poj 3281 Dining
- poj 3281 Dining
- POJ 3281 Dining
- POJ 3281 Dining
- POJ 3281 Dining dinic
- POJ 3281 — Dining
- spring的RabbitTemplate 接收Message源码导读
- 连载《一个程序员的成长历程》-11.80后结婚,房子是悬在每个人心中的一块石头
- Annotation 使用笔记(二) 注解生成SQL脚本
- A program to check if a binary tree is BST or not
- Linux磁盘分区
- POJ 3281 Dining
- 简单的模态对话框ModalDialog -- 源码分享
- 函数与链表
- WCF 服务第一次调用慢的问题
- 《Head First Design Patterns》读书笔记之模板模式
- wifidog原理
- Android开发之解析XML并实现三级联动效果
- Oracle EBS避免长时间不登录重新登录
- android Google Map V2内容以及疑难杂症