HDU-3572Task Schedule

不分析了，这题主要是记一个错误,DEBUG了一个小时

(f=dfs(e.to,min(a,e.cap-e.flow))>0))

(f=dfs(e.to,min(a,e.cap-e.flow)))>0)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<set>
#include<vector>
#include<iomanip>
#include<queue>
#include<map>
#include<stack>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF=1e9,maxn=1250;
int N,M,s,t;
struct edge
{
    int from,to,cap,flow;
    edge(int f,int t,int c,int fl):from(f),to(t),cap(c),flow(fl){}
};
struct Dinic
{
    int n,m,s,t;
   vector<edge> edges;
   vector<int> G[maxn];
   bool vis[maxn];
   int d[maxn];
   int cur[maxn];
   void init(int n,int s,int t)
   {
       this->n=n,this->s=s,this->t=t;
     edges.clear();
     for(int i=0;i<n;i++)
        G[i].clear();
   }
   void addedge(int from,int to,int cap)
   {
       edges.push_back(edge{from,to,cap,0});
       edges.push_back(edge{to,from,0,0});
       int m=edges.size();
       G[from].push_back(m-2);
       G[to].push_back(m-1);
   }

   bool bfs()
   {
      memset(vis,0,sizeof(vis));
      queue<int>  Q;
      Q.push(s);
      d[s]=0;
      vis[s]=1;
      while(!Q.empty())
      {
          int x=Q.front();
          Q.pop();
          for(int i=0;i<G[x].size();i++)
          {
              edge& e=edges[G[x][i]];
              if(!vis[e.to]&&e.cap>e.flow)
              {
                 vis[e.to]=1;
                 d[e.to]=d[x]+1;
                 Q.push(e.to);
              }
          }
      }
      return vis[t];
   }
   int dfs(int x,int a)
   {
       if(x==t||a==0)
        return a;
       int flow=0,f;
       for(int &i=cur[x];i<G[x].size();i++)
       {
           edge& e =edges[G[x][i]];
           if(d[x]+1==d[e.to]&&(f=dfs(e.to,min(a,e.cap-e.flow)))>0)
              {
                  //if(x==s)
                    //cout<<flow<<" "<<f<<" "<<e.to<<" "<<e.cap<<" "<<e.flow<<endl;
                  //cout<<f<<endl;
                  e.flow+=f;
                  edges[G[x][i]^1].flow-=f;
                  flow+=f;

                  a-=f;
                  if(a==0)
                    break;
              }
       }
       return flow;
   }
   int Maxflow()
   {
     int flow=0;
     while(bfs())
     {
        memset(cur,0,sizeof(cur));
        flow+=dfs(s,INF);
     }
     return flow;
   }

}DC;


int main()
{
    int T,Case=0;
    scanf("%d",&T);
    while(T--)
    {
         int sum=0;
         Case++;
         scanf("%d%d",&N,&M);
         DC.init(N+502,0,501+N);
         int Map[maxn];
         memset(Map,0,sizeof(Map));
        for(int i=1;i<=N;i++)
        {
            int P,S,E;
            scanf("%d%d%d",&P,&S,&E);
            sum+=P;
             DC.addedge(0,500+i,P);
           for(int j=S;j<=E;j++)
             DC.addedge(500+i,j,1),Map[j]=1;
        }
         for(int i=1;i<=500;i++)
            if(Map[i])
            DC.addedge(i,501+N,M);
        int flow=DC.Maxflow();
        printf("Case %d: ",Case);
        if(flow==sum)
            printf("Yes\n");
        else
            printf("No\n");
        printf("\n");
    }
    return 0;
}