#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#define inf 0x7fffffff
#define T 1001
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
struct edge{int to,next,v;}e[500001];
int n,m,cnt=1,ans,head[1005],h[1005];
inline void ins(int u,int v,int w){
e[++cnt]=(edge){v,head[u],w};head[u]=cnt;
e[++cnt]=(edge){u,head[v],0};head[v]=cnt;
}
inline bool bfs(){
int t=0,w=0,now,q[20001];
memset(h,-1,sizeof(h));
h[0]=q[0]=0;
while(t<=w){
now=q[t++];
for(int i=head[now];i;i=e[i].next){
if(e[i].v&&h[e[i].to]==-1){
h[e[i].to]=h[now]+1;
q[++w]=e[i].to;
}
}
}
if(h[T]==-1)return 0;
else return 1;
}
inline int dfs(int x,int f){
if(x==T)return f;
int used=0,rest;
for(int i=head[x];i;i=e[i].next){
if(e[i].v&&h[e[i].to]==h[x]+1){
rest=f-used;
rest=dfs(e[i].to,min(e[i].v,rest));
e[i].v-=rest;
e[i^1].v+=rest;
used+=rest;
if(used==f)return f;
}
}
if(!used)h[x]=-1;
return used;
}
int main(){
freopen("roundtable.in","r",stdin);
freopen("roundtable.out","w",stdout);
m=read();n=read();
for(int i=1;i<=m;i++){
int x=read();ans+=x;
ins(0,i,x);
}
for(int i=1;i<=n;i++){
int x=read();
ins(m+i,T,x);
}
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
ins(i,m+j,1);
while(bfs())ans-=dfs(0,inf);
if(ans){printf("0");return 0;}
printf("1\n");
for(int x=1;x<=m;x++){
for(int i=head[x];i;i=e[i].next)
if(!e[i].v)printf("%d ",e[i].to-m);
printf("\n");
}
return 0;
}
[网络流24题] 圆桌聚餐
最新推荐文章于 2020-07-31 20:55:39 发布