https://loj.ac/problem/6004

二分图多重匹配

#include 
     
      #include 
      
       #include 
       
        #include 
        
         using namespace std;const int maxn = 1000;int head[maxn];int tot = 0;struct edge{    int v,nex,w;}e[maxn*120];void addedge(int u,int v,int w){    e[tot] = (edge){v,head[u],w};    head[u] = tot++;    e[tot] = (edge){u,head[v],0};    head[v] = tot++;}int deep[maxn];bool bfs(int S,int T){    memset(deep,0,sizeof(deep));    deep[S] = 1;    queue
         
           q;    q.push(S);    while(!q.empty()){        int now = q.front();        q.pop();        for(int i=head[now];i!=-1;i=e[i].nex){            int v = e[i].v;            int w = e[i].w;            if(deep[v]!=0 || w<=0) continue;            deep[v] = deep[now]+1;            q.push(v);        }    }    return deep[T];}int dfs(int now,int T,int maxflow){    if(now==T) return maxflow;    int all = 0;    for(int i=head[now];i!=-1 && all
          
           =m+1 && w==0) { printf("%d ",v-m); } } printf("\n"); } }else{ printf("0\n"); } return 0;}