题目：

#include
     
      #include
      
       #include
       
        #include
        
         using namespace std;typedef long long ll;const int N=205,cN=20405;const ll INF=0x7fffffff;int n,head[N],incf[N],pre[N],xnt=1,t;ll dis[N],ans;bool in[N];struct Edge{    int next,from,to,cap;    ll w;    Edge(int n=0,int f=0,int t=0,int c=0,ll w=0):next(n),from(f),to(t),cap(c),w(w) {}}edge[cN],tmp[cN];bool spfa(){    queue
         
           q;    memset(dis,-2,sizeof dis);    q.push(0);in[0]=1;    dis[0]=0;incf[0]=INF;pre[t]=0;    while(q.size())    {        int k=q.front();q.pop();in[k]=0;        for(int i=head[k],v;i;i=edge[i].next)            if(edge[i].cap&&dis[k]+edge[i].w>dis[v=edge[i].to])            {                dis[v]=dis[k]+edge[i].w;                incf[v]=min(edge[i].cap,incf[k]);                pre[v]=i;//                printf("v=%d pre[v]=%d\n",v,pre[v]);                if(!in[v])q.push(v),in[v]=1;            }    }    return pre[t];}bool spfa1(){    queue
          
            q; memset(dis,1,sizeof dis); q.push(0);in[0]=1; dis[0]=0;incf[0]=INF;pre[t]=0; while(q.size()) { int k=q.front();q.pop();in[k]=0; for(int i=head[k],v;i;i=tmp[i].next) if(tmp[i].cap&&dis[k]+tmp[i].w