题意:

  一些人,和他们可能加入的组号。问每个组,最小的最大人数是多少

分析:

  二分的是最大流的容量。设置一个超级源点,连向所有的人,容量为1。设置一个超级汇点,使所有的组连向超级汇点,二分的就是这里的容量(0~n)。然后根据题目给出的人和组的关系连接人和组,容量为1。二分时,若当前状态求出的最大流等于人数,则下界等于mid,若不等于,则上界等于mid。二分出的容量,就是组中的最小的最大人数。

输入:

3 2

John 0 1

Rose 1

Mary 1

5 4

ACM 1 2 3

ICPC 0 1

Asian 0 2 3

Regional 1 2

ShangHai 0 2

0 0

输出:

2

2

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <sstream>
using namespace std;
const int maxn=3010;
const int inf=1e9;
int n,m;
structEdge
{
int u,v;
int flow,cap;
Edge(int uu,int cc,int fl,int ca):u(uu),v(cc),flow(fl),cap(ca)
{ }
};
vector<Edge>edge;
structISAP
{
vector<int>G[maxn];
vector<Edge>edge;
int s,t;
int d[maxn];
int cur[maxn];
int p[maxn];
int num[maxn];
int flow;
void init()
{
for(int i=0;i<=n+m+1;i++)
G[i].clear();
s=0;
t=n+m+1;
}
bool bfs()
{
memset(d,-1,sizeof(d));
queue<int>q;
q.push(t);
d[t]=0;
while(!q.empty())
{
int u=q.front();
q.pop();
for(int i=0;i<G[u].size();i++)
{
Edge& e=edge[G[u][i]];
if(e.cap==0&&d[e.v]==-1)
{
d[e.v]=d[u]+1;
q.push(e.v);
}
}
}
return d[s]!=-1;
}
int Augment()
{
int x=t,a=inf;
while(x!=s)
{
Edge& e=edge[p[x]];
a=min(a,e.cap-e.flow);
x=edge[p[x]].u;
}
x=t;
while(x!=s)
{
edge[p[x]].flow+=a;
edge[p[x]^1].flow-=a;
x=edge[p[x]].u;
}
return a;
}
int maxflow(int s,int t)
{
this->s=s;
this->t=t;
flow=0;
bfs();
for(int i=0;i<=n+m+1;i++)
num[d[i]]++;
int x=s;
memset(cur,0,sizeof(cur));
while(d[s]<n+m+2)
{
if(x==t)
{
flow+=Augment();
x=s;
}
bool ok=false;
for(int i=cur[x];i<G[x].size();i++)
{
Edge& e=edge[G[x][i]];
if(e.cap>e.flow&&d[x]==d[e.v]+1)
{
ok=true;
p[e.v]=G[x][i];
cur[x]=i;
x=e.v;
break;
}
}
if(!ok)
{
int k=n+m+1;
for(int i=0;i<G[x].size();i++)
{
Edge& e=edge[G[x][i]];
if(e.cap>e.flow)
k=min(k,d[e.v]);
}
if(--num[d[x]]==0)
break;
num[d[x]=k+1]++;
cur[x]=0;
if(x!=s)
x=edge[p[x]].u;
}
}
return flow;
}
}solver;
char buffer[11000];
void add(int s,int t,int cap)
{
edge.push_back(Edge(s,t,0,cap));
edge.push_back(Edge(t,s,0,0));
int x=edge.size();
solver.G[s].push_back(x-2);
solver.G[t].push_back(x-1);
}
void input()
{
solver.init();
int x;
edge.clear();
char ch[100];
for (int i = 1 ; i <= n ; ++i)
{
add(0,i,1);
scanf("%*s");
gets(buffer);
char * p = strtok(buffer, " ");
while (p) {
sscanf(p,"%d",&x);
add(i,x+1+n,1);
p = strtok(NULL," ");
}
}
int sz=edge.size();
for(int i=n+1;i<=n+m;i++)
{
sz+=2;
solver.G[i].push_back(sz-2);
solver.G[n+m+1].push_back(sz-1);
}
}
void build(int up)
{
solver.edge=edge;
for(int i=n+1;i<=n+m;i++)
{
solver.edge.push_back(Edge(i,n+m+1,0,up));
solver.edge.push_back(Edge(n+m+1,i,0,0));
}
}
void solve()
{
int left=1,right=n;
int mid=(left+right)>>1;
int ans=n;
while(left<=right)
{
build(mid);
if (solver.maxflow(0,n+m+1)==n)
{
right = mid-1;
ans = min(ans,mid);
}
else
{
left = mid+1;
}
mid = (left+right)>>1;
}
printf("%d\n",ans);
}
int main()
{
while(scanf("%d%d",&n,&m)==2,n+m)
{
input();
solve();
}
}
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <sstream>
using namespace std;
const int maxn=3010;
const int inf=1e9;
int n,m;
structEdge
{
int u,v;
int flow,cap;
Edge(int uu,int cc,int fl,int ca):u(uu),v(cc),flow(fl),cap(ca)
{ }
};
vector<Edge>edge;
structISAP
{
vector<int>G[maxn];
vector<Edge>edge;
int s,t;
int d[maxn];
int cur[maxn];
int p[maxn];
int num[maxn];
int flow;
void init()
{
for(int i=0;i<=n+m+1;i++)
G[i].clear();
s=0;
t=n+m+1;
}
bool bfs()
{
memset(d,-1,sizeof(d));
queue<int>q;
q.push(t);
d[t]=0;
while(!q.empty())
{
int u=q.front();
q.pop();
for(int i=0;i<G[u].size();i++)
{
Edge& e=edge[G[u][i]];
if(e.cap==0&&d[e.v]==-1)
{
d[e.v]=d[u]+1;
q.push(e.v);
}
}
}
return d[s]!=-1;
}
int Augment()
{
int x=t,a=inf;
while(x!=s)
{
Edge& e=edge[p[x]];
a=min(a,e.cap-e.flow);
x=edge[p[x]].u;
}
x=t;
while(x!=s)
{
edge[p[x]].flow+=a;
edge[p[x]^1].flow-=a;
x=edge[p[x]].u;
}
return a;
}
int maxflow(int s,int t)
{
this->s=s;
this->t=t;
flow=0;
bfs();
for(int i=0;i<=n+m+1;i++)
num[d[i]]++;
int x=s;
memset(cur,0,sizeof(cur));
while(d[s]<n+m+2)
{
if(x==t)
{
flow+=Augment();
x=s;
}
bool ok=false;
for(int i=cur[x];i<G[x].size();i++)
{
Edge& e=edge[G[x][i]];
if(e.cap>e.flow&&d[x]==d[e.v]+1)
{
ok=true;
p[e.v]=G[x][i];
cur[x]=i;
x=e.v;
break;
}
}
if(!ok)
{
int k=n+m+1;
for(int i=0;i<G[x].size();i++)
{
Edge& e=edge[G[x][i]];
if(e.cap>e.flow)
k=min(k,d[e.v]);
}
if(--num[d[x]]==0)
break;
num[d[x]=k+1]++;
cur[x]=0;
if(x!=s)
x=edge[p[x]].u;
}
}
return flow;
}
}solver;
char buffer[11000];
void add(int s,int t,int cap)
{
edge.push_back(Edge(s,t,0,cap));
edge.push_back(Edge(t,s,0,0));
int x=edge.size();
solver.G[s].push_back(x-2);
solver.G[t].push_back(x-1);
}
void input()
{
solver.init();
int x;
edge.clear();
char ch[100];
for (int i = 1 ; i <= n ; ++i)
{
add(0,i,1);
scanf("%*s");
gets(buffer);
char * p = strtok(buffer, " ");
while (p) {
sscanf(p,"%d",&x);
add(i,x+1+n,1);
p = strtok(NULL," ");
}
}
int sz=edge.size();
for(int i=n+1;i<=n+m;i++)
{
sz+=2;
solver.G[i].push_back(sz-2);
solver.G[n+m+1].push_back(sz-1);
}
}
void build(int up)
{
solver.edge=edge;
for(int i=n+1;i<=n+m;i++)
{
solver.edge.push_back(Edge(i,n+m+1,0,up));
solver.edge.push_back(Edge(n+m+1,i,0,0));
}
}
void solve()
{
int left=1,right=n;
int mid=(left+right)>>1;
int ans=n;
while(left<=right)
{
build(mid);
if (solver.maxflow(0,n+m+1)==n)
{
right = mid-1;
ans = min(ans,mid);
}
else
{
left = mid+1;
}
mid = (left+right)>>1;
}
printf("%d\n",ans);
}
int main()
{
while(scanf("%d%d",&n,&m)==2,n+m)
{
input();
solve();
}
}

UVA 1345 Jamie's Contact Groups的更多相关文章

  1. POJ 2289 Jamie's Contact Groups / UVA 1345 Jamie's Contact Groups / ZOJ 2399 Jamie's Contact Groups / HDU 1699 Jamie's Contact Groups / SCU 1996 Jamie's Contact Groups (二分,二分图匹配)

    POJ 2289 Jamie's Contact Groups / UVA 1345 Jamie's Contact Groups / ZOJ 2399 Jamie's Contact Groups ...

  2. POJ2289 Jamie's Contact Groups(二分图多重匹配)

    Jamie's Contact Groups Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 7721   Accepted: ...

  3. Jamie's Contact Groups POJ - 2289(多重匹配 最大值最小化 最大流)

    Jamie's Contact Groups Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 8567   Accepted: ...

  4. POJ 2289 Jamie's Contact Groups 二分图多重匹配 难度:1

    Jamie's Contact Groups Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 6511   Accepted: ...

  5. poj 2289 Jamie's Contact Groups【二分+最大流】【二分图多重匹配问题】

    题目链接:http://poj.org/problem?id=2289 Jamie's Contact Groups Time Limit: 7000MS   Memory Limit: 65536K ...

  6. POJ2289:Jamie's Contact Groups(二分+二分图多重匹配)

    Jamie's Contact Groups Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 125536/65536 K (Java/ ...

  7. POJ 2289——Jamie's Contact Groups——————【多重匹配、二分枚举匹配次数】

    Jamie's Contact Groups Time Limit:7000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I ...

  8. POJ2289 Jamie's Contact Groups —— 二分图多重匹配/最大流 + 二分

    题目链接:https://vjudge.net/problem/POJ-2289 Jamie's Contact Groups Time Limit: 7000MS   Memory Limit: 6 ...

  9. Poj 2289 Jamie's Contact Groups (二分+二分图多重匹配)

    题目链接: Poj 2289 Jamie's Contact Groups 题目描述: 给出n个人的名单和每个人可以被分到的组,问将n个人分到m个组内,并且人数最多的组人数要尽量少,问人数最多的组有多 ...

随机推荐

  1. flashback database操作步骤

    默认情况数据库的flashback database是关闭的. 启用Flashback Database 步骤:1.配置Flash Recovery Area 检查是否启动了flash recover ...

  2. hbase权威指南学习笔记--过滤器

    1.使用hbase是shell客户端进行过滤查询 scan 'testtable',{COLUMNS=>'colfam1:col-0',FILTER=>RowFilter.new(Comp ...

  3. iOS 开发者证书总结

    iOS 证书分两种类型. 第一种为$99美元的,这种账号有个人和公司的区别,公司账号能创建多个子账号,但个人的不能.这种账号可以用来上传app store 第二种为¥299美元的,这种账号只能用于企业 ...

  4. 关于自定义UICollectionViewLayout的一点个人理解<一>

    自定义UICollectionView,主要会用到以下几个方法: - (void)prepareLayout; 第一次加载layout.刷新layout.以及- (BOOL)shouldInvalid ...

  5. linux命令--virtualenv

    virtualenv可以搭建虚拟且独立的python环境,可以使每个项目环境与其他项目独立开来,保持环境的干净,解决包冲突问题. 一.安装virtualenv virtualenv实际上是一个pyth ...

  6. 显示查询记录的前n条 mysql limit用法

    按时间倒序出所有的数据 mysql order by createtime desc ; +----+------------------+ | id | id_no | +----+-------- ...

  7. MySQL 初学笔记 ① -- MySQL用户登录权限控制

    1. MySQL 登录 MySQL -u username -p 2. MySQL 创建用户 use mysql //进入mysql 表 INSERT INTO user (Host,User,Pas ...

  8. Fedora19/18/17安装显卡驱动和无限网卡驱动

    一.安装nvidia显卡驱动 1. 切换到root用户          su - 2. 确定当前Linux内核及SELinux policy 是否为最新          yum update ke ...

  9. IoC - Castle Windsor 2.1

    找过一些Windsor教程的文章,博客园上TerryLee有写了不少,以及codeproject等也有一些例子,但都讲的不太明了.今天看到Alex Henderson写的一个系列,非常简单明了.下面是 ...

  10. 关于文字颜色/图片背景---selector状态列表

    文字颜色 android:textColor="@style/style_name" ----------------------------------widget 图片背景 a ...