HDOJ 2883 kebab （网络流）

link to the problem is here
this is a very hard problem or my skill in modelling network flow is to ‘naive’ .I spend a day to find a incorrect way and after I look up some data and finally I made this .
the start time and end time is too large so we building our model in time range and select the unique time nodes.In the last using dinic algorithm to assert if the max flow is equal to sum flow

#include <bits/stdc++.h>
#include <cstring>
#define MAXN 610
#define inf 0x7ffffff
using namespace std;
int n,m,ss,sink;
const int maxn=610;
const int M=999999;
int head[maxn],dist[maxn],edgenum;
struct node
{
    int v,w,next;
}edge[2*M];
int min(int x,int y)
{
    return x>y?y:x;
}
void add(int u,int v,int w)
{
    edge[edgenum].v=v;
    edge[edgenum].w=w;
    edge[edgenum].next=head[u];
    head[u]=edgenum++;

    edge[edgenum].v=u;
    edge[edgenum].w=0;
    edge[edgenum].next=head[v];
    head[v]=edgenum++;
}
int bfs()
{
    int i,u,v;
    queue<int>q;
    memset(dist,0,sizeof(dist));
    u=ss;
    dist[u]=1;
    q.push(u);
    while(!q.empty())
    {
        u=q.front();
        q.pop();
        for(i=head[u];i!=-1;i=edge[i].next)
        {
            v=edge[i].v;
            if(edge[i].w&&!dist[v])
            {
                dist[v]=dist[u]+1;
                if(v==sink)
                    return 1;
                q.push(v);
            }
        }
    }
    return 0;
}
int dfs(int s,int lim)
{
    int i,tmp,v,cost=0;
    if(s==sink)
        return lim;
    for(i=head[s];i!=-1;i=edge[i].next)
    {
        v=edge[i].v;
        if(edge[i].w&&dist[s]==dist[v]-1)
        {
            tmp=dfs(v,min(lim-cost,edge[i].w));
            if(tmp>0)
            {
                edge[i].w-=tmp;
                edge[i^1].w+=tmp;
                cost+=tmp;
                if(cost==lim)
                    break;
            }
            else
                dist[v]=-1;
        }
    }
    return cost;
}
int dinic()
{
    int ans=0;
    while(bfs())
        ans+=dfs(ss,inf);
    return ans;
}
int main()
{

    int s[MAXN],e[MAXN],q[MAXN],t[MAXN];
    int time[MAXN],cnt,i,j;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        //init();

        memset(head,-1,sizeof(head));
        memset(time,0,sizeof(time));
        int sum = 0;
        cnt = 1;
        edgenum = 0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d%d%d",&s[i],&q[i],&e[i],&t[i]);
            sum+=q[i]*t[i];
            time[cnt++] = s[i];
            time[cnt++] = e[i];
        }

        sort(time+1,time+cnt);
        int cnt2 = 0;
        for(int i=1;i<cnt;i++)
        {
            if(time[cnt2] != time[i])
            {
                time[++cnt2] =time[i];
            }
        }

        //printf("%d\n",cnt2);
        ss = n+cnt2+1;
        sink = ss+1;
        for(int i=1;i<=n;i++)
        {
            add(ss,i,q[i]*t[i]);
        }
        for(int i=1;i<=cnt2;i++)
        {
            add(n+i,sink,m*time[i]-m*time[i-1]);
            for(int j=1;j<=n;j++)
            {
                if(s[j]<=time[i-1]&&time[i]<=e[j])
                {
                    add(j,n+i,inf);
                }
            }
        }
        int temp = dinic();
        if(sum == temp)
        {
            printf("Yes\n");
        }
        else
        {
            printf("No\n");
        }

    }
    return 0;
}