原题:http://acm.hdu.edu.cn/showproblem.php?pid=2883
#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<vector>
#include<algorithm>
#define inf 1e9
using namespace std;
const int maxn = 41000;
const int maxm = 8040000;
int n, m, num_nodes;
int a[1000005];
bool f[1000005];
struct node
{
int s, e;
}time[40000];
struct Node
{
int p, s, e, t;
}node[250];
struct Edge
{
int from, to, flow, cap;
}edge[maxm*2];
vector<int>G[maxn];
int edgenum;
void add(int u, int v, int c)
{
edge[edgenum].from = u;
edge[edgenum].to = v;
edge[edgenum].flow = 0;
edge[edgenum].cap = c;
edgenum++;
edge[edgenum].from = v;
edge[edgenum].to = u;
edge[edgenum].flow = 0;
edge[edgenum].cap = 0;
edgenum++;
G[u].push_back(edgenum-2);
G[v].push_back(edgenum-1);
}
int deep[maxn];
bool vis[maxn];
void BFS(int s, int t)
{
queue<int>Q;
memset(vis, false, sizeof vis);
Q.push(t);
vis[t] = true;
deep[t] = 0;
while(!Q.empty())
{
int now = Q.front();
Q.pop();
for(int i = 0;i<(int)G[now].size();i++)
{
int v = edge[G[now][i]].to;
if(!vis[v])
{
deep[v] = deep[now] + 1;
vis[v] = true;
Q.push(v);
}
}
}
}
int gap[maxn];
int cur[maxn];
int front[maxn];
int Augment(int s, int t)
{
int minflow = inf;
int begin = t;
while(begin != s)
{
Edge& e = edge[front[begin]];
minflow = min(minflow, e.cap - e.flow);
begin = e.from;
}
begin = t;
while(begin != s)
{
edge[front[begin]].flow += minflow;
edge[front[begin]^1].flow -= minflow;
begin = edge[front[begin]].from;
}
return minflow;
}
int Maxflow(int s, int t)
{
int flow = 0;
BFS(s, t);
memset(gap, 0, sizeof gap);
memset(cur, 0, sizeof cur);
for(int i = 0;i<num_nodes;i++) gap[deep[i]]++;
int begin = s;
while(deep[s] < num_nodes)
{
if(begin == t)
{
flow += Augment(s, t);
begin = s;
}
bool flag = false;
for(int i = cur[begin];i<(int)G[begin].size();i++)
{
Edge& e = edge[G[begin][i]];
if(e.cap > e.flow && deep[begin] == deep[e.to] + 1)
{
front[e.to] = G[begin][i];
cur[begin] = i;
flag = true;
begin = e.to;
break;
}
}
if(!flag)
{
int k = num_nodes-1;
for(int i = 0;i<(int)G[begin].size();i++)
{
Edge& e = edge[G[begin][i]];
if(e.cap > e.flow)
k = min(k, deep[e.to]);
}
if(--gap[deep[begin]] == 0) break;
gap[deep[begin] = k+1]++;
cur[begin] = 0;
if(begin != s)
begin = edge[front[begin]].from;
}
}
return flow;
}
void init()
{
for(int i = 0;i<num_nodes+2;i++) G[i].clear();
edgenum = 0;
memset(deep, 0, sizeof deep);
}
int main()
{
while(~scanf("%d%d", &n, &m))
{
int cnt = 0;
int full_flow = 0;
memset(f, false, sizeof f);
for(int i = 1;i<=n;i++)
{
scanf("%d%d%d%d", &node[i].s, &node[i].p, &node[i].e, &node[i].t);
full_flow += node[i].p*node[i].t;
if(!f[node[i].s])
{
f[node[i].s] = true;
a[++cnt] = node[i].s;
}
if(!f[node[i].e])
{
f[node[i].e] = true;
a[++cnt] = node[i].e;
}
}
sort(a+1, a+cnt+1);
for(int i = 1;i<cnt;i++)
{
time[i].s = a[i];
time[i].e = a[i+1];
}
int s = 0, t = n+cnt+1;
num_nodes = t+1;
init();
for(int i = 1;i<=n;i++)
add(s, i, node[i].p*node[i].t);
for(int i = 1;i<cnt;i++)
add(n+i, t, m*(time[i].e-time[i].s));
for(int i = 1;i<=n;i++)
{
int ss = node[i].s, ee = node[i].e;
for(int j = 1;j<cnt;j++)
{
if(time[j].e > ee) break;
if(ss <= time[j].s)
{
add(i, j+n, (time[j].e-time[j].s)*m);
}
}
}
int flow = Maxflow(s, t);
if(flow == full_flow) printf("Yes\n");
else printf("No\n");
}
return 0;
}