这道题的建模算是很套路的,最后更新的答案也很简单
首先将所有的代表团当作n个节点,桌子当成m个节点
1.源点到代表团,连一条边权位人数的边。代表源点提供人数这么多的流量
2.代表团到所有的桌子,连一条权值为1的边,代表每个代表团只有一人可以坐在这个桌子上。
3.每个桌子连一条边到汇点,边权位桌子上能坐多少人,代表只有桌子人数的流量才能到汇点。
之后判断一下是否满流,如果满流。就对每个代表团连出去的边找一下有流量的边就行
#include <iostream>
#include <cstdio>
#include <bits/stdc++.h>
const int MAXN = 100010;//点数的最大值
const int MAXM = 400010;//边数的最大值
const int INF = 0x3f3f3f3f;
struct Edge
{
int to,next,cap,flow,from;
} edge[MAXM]; //注意是MAXM
int tol;
int head[MAXN];
int gap[MAXN],dep[MAXN],cur[MAXN];
void init()
{
tol = 0;
memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int w,int rw = 0)
{
edge[tol].to = v;
edge[tol].cap = w;
edge[tol].from = u;
edge[tol].flow = 0;
edge[tol].next = head[u];
head[u] = tol++;
edge[tol].to = u;
edge[tol].from = v;
edge[tol].cap = rw;
edge[tol].flow = 0;
edge[tol].next = head[v];
head[v] = tol++;
}
int Q[MAXN];
void BFS(int start,int end)
{
memset(dep,-1,sizeof(dep));
memset(gap,0,sizeof(gap));
gap[0] = 1;
int front = 0, rear = 0;
dep[end] = 0;
Q[rear++] = end;
while(front != rear)
{
int u = Q[front++];
for(int i = head[u]; i != -1; i = edge[i].next)
{
int v = edge[i].to;
if(dep[v] != -1)
continue;
Q[rear++] = v;
dep[v] = dep[u] + 1;
gap[dep[v]]++;
}
}
}
int S[MAXN];
int sap(int start,int end,int N)
{
BFS(start,end);
memcpy(cur,head,sizeof(head));
int top = 0;
int u = start;
int ans = 0;
while(dep[start] < N)
{
if(u == end)
{
int Min = INF;
int inser;
for(int i = 0; i < top; i++)
if(Min > edge[S[i]].cap - edge[S[i]].flow)
{
Min = edge[S[i]].cap - edge[S[i]].flow;
inser = i;
}
for(int i = 0; i < top; i++)
{
edge[S[i]].flow += Min;
edge[S[i]^1].flow -= Min;
}
ans += Min;
top = inser;
u = edge[S[top]^1].to;
continue;
}
bool flag = false;
int v;
for(int i = cur[u]; i != -1; i = edge[i].next)
{
v = edge[i].to;
if(edge[i].cap - edge[i].flow && dep[v]+1 == dep[u])
{
flag = true;
cur[u] = i;
break;
}
}
if(flag)
{
S[top++] = cur[u];
u = v;
continue;
}
int Min = N;
for(int i = head[u]; i != -1; 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[S[--top]^1].to;
}
return ans;
}
void print_all_edge()
{
for(int i = 0; i < tol ; i += 2)
{
printf("%d -> %d cap: % d,flow: %d\n",edge[i].from,edge[i].to,edge[i].cap,edge[i].flow);
}
}
inline bool getint(int &num)
{
char in;
bool IsN=false;
in=getchar();
if(in==EOF || in == '\n')
return false;
while(in!='-'&&(in<'0'||in>'9'))
in=getchar();
if(in=='-')
{
IsN=true;
num=0;
}
else
num=in-'0';
while(in=getchar(),in>='0'&&in<='9')
{
num*=10,num+=in-'0';
}
if(IsN)
num=-num;
if(in == '\n')
return false;
return true;
}
int st = 0,en = 1505;
int T = 505;
int main()
{
int n,m;
int sum = 0;
scanf("%d%d",&n,&m);
init();
for(int i = 1;i<=n;i++)
{
int x;
scanf("%d",&x);
sum += x;
addedge(st,i,x);
}
for(int i = 1;i<=m;i++)
{
int x;
scanf("%d",&x);
addedge(i + T,en,x);
}
for(int i = 1;i<=n;i++)
{
for(int j = T+1;j<=T+m;j++)
{
addedge(i,j,1);
}
}
int ans = sap(st,en,en*2);
if(ans != sum)
{
printf("0");
return 0;
}
else
{
printf("1\n");
}
//print_all_edge();
for(int i = 1;i<=n;i++)
{
for(int j = head[i];j!=-1;j = edge[j].next)
{
if(edge[j].to != 0 && edge[j].flow)
{
printf("%d ",edge[j].to - T);
}
}
puts("");
}
return 0;
}