const int inf = 2147483647;
const double eps = 1e-8;
const int maxn = 505;
const ll mod = 1e9+7;
struct edge{
int to, cap, rev;
};
vector<edge> G[maxn];
int level[maxn];
int iter[maxn];
void addedge(int from, int to, int cap){
G[from].push_back((edge){to, cap, (int)G[to].size()});
G[to].push_back((edge){from, 0, (int)G[from].size()-1});
}
void bfs(int s){
memset(level, -1, sizeof(level));
queue<int> q;
level[s] = 0;
q.push(s);
while(!q.empty()){
int v = q.front(); q.pop();
for(int i=0; i<G[v].size(); i++){
edge &e = G[v][i];
if(e.cap>0 && level[e.to]<0){
level[e.to] = level[v]+1;
q.push(e.to);
}
}
}
}
int dfs(int v, int t, int f){
if(v == t) return f;
for(int &i = iter[v]; i<G[v].size(); i++){
edge &e = G[v][i];
if(e.cap > 0 && level[v]<level[e.to]){
int d = dfs(e.to, t, min(f, e.cap));
if(d>0){
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
int max_flow(int s, int t){
int flow = 0;
for( ;; ){
bfs(s);
if(level[t]<0) return flow;
memset(iter, 0, sizeof(iter));
int f;
while((f = dfs(s, t, inf))>0){
flow += f;
}
}
}
int main(){
int n, m;
scanf("%d%d", &n, &m);
for(int i=0; i<m; i++){
int u, v, cap;
scanf("%d%d%d", &u, &v, &cap);
addedge(--u, --v, cap);
}
int ans = max_flow(0, n-1);
printf("%d\n", ans);
return 0;
}
#include<iostream>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<math.h>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<sstream>
using namespace std;
typedef long long ll;
const int inf = 2147483647;
const double eps = 1e-8;
const int maxn = 505;
const ll mod = 1e9+7;
int n, k;
vector<int> G[maxn];
int match[maxn];
bool used[maxn];
void addedge(int u, int v){
G[u].push_back(v);
G[v].push_back(u);
}
bool dfs(int v){
used[v] = true;
for(int i=0; i<G[v].size(); i++){
int u = G[v][i], w = match[u];
if(w<0 || !used[w] && dfs(w)){
match[v] = u;
match[u] = v;
return true;
}
}
return false;
}
int bipartite_matching(){
int res = 0;
memset(match, -1, sizeof(match));
for(int v = 0; v<n+k; v++){
if(match[v] < 0){
memset(used, 0, sizeof(used));
if(dfs(v)){
res++;
}
}
}
return res;
}
int main(){
while(scanf("%d%d", &n, &k) == 2){
for(int i=0; i<n+k; i++){
G[i].clear();
}
for(int i=0; i<n; i++){
int m;
scanf("%d", &m);
for(int j=0; j<m; j++){
int b;
scanf("%d", &b);
addedge(i, n+b-1);
}
}
printf("%d\n", bipartite_matching());
}
return 0;
}
input:
5 5
2 2 5
3 2 3 4
2 1 5
3 1 2 5
1 2
n=5 m=5
5只奶牛 5个谷仓
每只奶牛可以去那些谷仓数目 谷仓编号