Pagini recente » Cod sursa (job #712146) | Cod sursa (job #1982799) | Cod sursa (job #2911412) | Cod sursa (job #1253319) | Cod sursa (job #2719787)
#include <bits/stdc++.h>
#define DIM 300
#define INF 2000000000
using namespace std;
vector <int> L[DIM];
deque <int> c;
int capacitate[DIM][DIM],dist[DIM],start[DIM];
int t,n,m,i,j,x,nr,val,sursa,dest;
void bfs (int start, int dest){
for (int i=start;i<=dest;i++)
dist[i] = INF;
c.clear();
c.push_back(start);
dist[start] = 0;
while (!c.empty()){
int nod = c.front();
c.pop_front();
if (nod == dest)
break;
for (auto vecin : L[nod]){
if (!capacitate[nod][vecin])
continue;
if (dist[vecin] == INF){
dist[vecin] = 1 + dist[nod];
c.push_back(vecin);
}}}}
int dfs (int nod, int dest, int max_flow){
if (nod == dest || !max_flow)
return max_flow;
int flow = 0;
for (;start[nod]<L[nod].size();start[nod]++){
int vecin = L[nod][start[nod]];
if (!capacitate[nod][vecin] || dist[vecin] != dist[nod] + 1)
continue;
int val = dfs (vecin,dest,min(max_flow,capacitate[nod][vecin]));
capacitate[nod][vecin] -= val;
capacitate[vecin][nod] += val;
flow += val;
}
return flow;
}
int main (){
ifstream cin ("tribut.in");
ofstream cout ("tribut.out");
cin>>t;
for (;t--;){
cin>>n>>m;
sursa = 0, dest = n + m + 1;
memset (capacitate,0,sizeof capacitate);
for (i=sursa;i<=dest;i++)
L[i].clear();
for (i=1;i<=n;i++){
cin>>capacitate[m+i][dest];
L[m+i].push_back(dest);
L[dest].push_back(m+i);
}
for (i=1;i<=m;i++){
cin>>nr>>capacitate[sursa][i];
L[sursa].push_back(i);
L[i].push_back(sursa);
for (j=1;j<=nr;j++){
cin>>x;
L[i].push_back(m+x);
L[m+x].push_back(i);
capacitate[i][m+x] = INF;
}
}
int sol = 0, flux;
do{
memset (start,0,sizeof start);
bfs (sursa,dest);
flux = dfs (sursa,dest,INF);
sol += flux;
} while (flux);
cout<<sol<<"\n";
}
return 0;
}