poj1698

题解：

网络流

然后似乎反着做块？

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=;
int T,qq[],vvis,q[N*],n,m,t,l,sum,dis[N],x,y,ans,f[N],z,a[N][N];
int bfs()
{
    memset(dis,0xff,sizeof dis);
    dis[n]=;
    int l=,r=;
    q[]=n;
    while (l<r)
     {
         int j=q[++l];
         for (int i=;i<=n;i++)
          if (dis[i]<&&a[i][j]>)
           {
               dis[i]=dis[j]+;
               q[++r]=i;
           }
         if (j==)return ;
     }
    return ;
}
int dfs(int x,int y)
{
    if (x==n)return y;
    int tmp=y,t;
    for (int i=;i<=n&&tmp;i++)
     if (dis[i]+==dis[x]&&a[x][i])
      {
        t=dfs(i,min(a[x][i],tmp));
        a[x][i]-=t;
        a[i][x]+=t;
        tmp-=t;
      }
    return y-tmp;
}
int main()
{
    scanf("%d",&T);
    while (T--)
     {
         vvis=;
         scanf("%d",&n);
         memset(a,,sizeof a);
        for (int k=;k<=n;k++)
          {
             for (int i=;i<;i++)scanf("%d",&qq[i]);
             scanf("%d%d",&t,&l);
             vvis+=t;
            for (int j=;j<;j++)
             if (qq[j])for (int i=;i<l;i++)a[+k][i*+j+]=;
            a[][k+]=t;
         }
        for (int i=;i<=;i++)a[i][]=;
        n=;
        ans=;int t;
        while (bfs())ans+=dfs(,1e9);
        if (ans==vvis)puts("Yes");
        else puts("No");
     }
}