【PowerOJ1737&网络流24题】太空飞行计划问题（最小割）

题意：

思路：

 #include<bits/stdc++.h>
 using namespace std;
 typedef long long ll;
 typedef unsigned int uint;
 typedef unsigned long long ull;
 typedef long double ld;
 typedef pair<int,int> PII;
 typedef pair<ll,ll> Pll;
 typedef vector<int> VI;
 typedef vector<PII> VII;
 //typedef pair<ll,ll>P;
 #define N  200010
 #define M  200010
 #define INF 1e9
 #define fi first
 #define se second
 #define MP make_pair
 #define pb push_back
 #define pi acos(-1)
 #define mem(a,b) memset(a,b,sizeof(a))
 #define rep(i,a,b) for(int i=(int)a;i<=(int)b;i++)
 #define per(i,a,b) for(int i=(int)a;i>=(int)b;i--)
 #define lowbit(x) x&(-x)
 #define Rand (rand()*(1<<16)+rand())
 #define id(x) ((x)<=B?(x):m-n/(x)+1)
 #define ls p<<1
 #define rs p<<1|1

 const ll MOD=1e9+,inv2=(MOD+)/;
       double eps=1e-;
       int dx[]={-,,,};
       int dy[]={,,-,};

 int head[N],vet[N],len[N],nxt[N],dis[N],s,S,T,tot;

 int read()
 {
    int v=,f=;
    char c=getchar();
    while(c<||<c) {if(c=='-') f=-; c=getchar();}
    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();
    return v*f;
 }

 void add(int a,int b,int c)
 {
     nxt[++tot]=head[a];
     vet[tot]=b;
     len[tot]=c;
     head[a]=tot;

     nxt[++tot]=head[b];
     vet[tot]=a;
     len[tot]=;
     head[b]=tot;
 }

 bool bfs( )
 {
     queue<int>q;
     rep(i,,s) dis[i]=-;
     q.push(S),dis[S]=;
     while(!q.empty())
     {
         int u=q.front();
         q.pop();
         int e=head[u];
         while(e)
         {
             int v=vet[e];
             if(len[e]>&&dis[v]==-)
             {
                 dis[v]=dis[u]+;
                 q.push(v);
             }
             e=nxt[e];
         }
     }
     return dis[T]!=-;
 }

 int dfs(int u,int aug)
 {
     if(u==T) return aug;
     int e=head[u],val=,flow=;
     while(e)
     {
         int v=vet[e];
         if(len[e]>&&dis[v]==dis[u]+)
         {
             int t=dfs(v,min(len[e],aug));
             if(!t)
             {
                 e=nxt[e];
                 continue;
             }
             flow+=t;
             aug-=t;
             len[e]-=t;
             len[e^]+=t;
             if(!aug) break;
         }
         e=nxt[e];
     }
     if(!flow) dis[u]=-;
     return flow;
 }

 int main()
 {
     int n=read(),m=read();
     s=n+m;
     S=++s,T=++s;
     rep(i,,s) head[i]=;
     tot=;
     int ans=;
     rep(i,,n)
     {
         int x;
         scanf("%d",&x);
         add(S,i,x);
         ans+=x;
         while(getchar()==' ')
         {
             scanf("%d",&x);
             add(i,x+n,INF);
         }
     }
     rep(i,,m)
     {
         int x=read();
         add(i+n,T,x);
     }
     int tmp=;
     while(bfs()) tmp+=dfs(S,INF);
     ans-=tmp;
     rep(i,,n)
      if(dis[i]!=-) printf("%d ",i);
     printf("\n");
     rep(i,,m)
      if(dis[i+n]!=-) printf("%d ",i);
     printf("\n");
     printf("%d\n",ans);
     return ;
 }