For get max_flow of this networks I just cope the code patten by kuangbin.
But the point of this problem is create map.
The portal:http://acm.hdu.edu.cn/showproblem.php?pid=3572
#include <iostream>
#include <cstdio>
#include <cmath>
#include <memory.h>
using namespace std;
const int MAXN = 100010;
const int MAXE = 400010;
const int INF = 0x3f3f3f3f;
struct Edge{
int to,next,cap,flow;
}edge[MAXE];
int tol;
int head[MAXN];
int gap[MAXN],dep[MAXN],pre[MAXN],cur[MAXN];
void init(){
tol = 0;
memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int w,int rw = 0){
edge[tol].to = v;edge[tol].cap = w;edge[tol].next = head[u];
edge[tol].flow = 0;head[u] = tol ++;
edge[tol].to = u;edge[tol].cap = rw;edge[tol].next = head[v];
edge[tol].flow = 0;head[v] = tol ++;
}
int sap(int start,int end,int N){
memset(gap,0,sizeof(gap));
memset(dep,0,sizeof(dep));
memcpy(cur,head,sizeof(head));
int u = start;
pre[u] = -1;
gap[0] = N;
int ans = 0;
while(dep[start] < N){
if(u == end){
int Min = INF;
for(int i= pre[u];i!=-1;i=pre[edge[i^1].to]){
if(Min > edge[i].cap - edge[i].flow)
Min = edge[i].cap - edge[i].flow;
}
for(int i= pre[u];i!=-1;i=pre[edge[i^1].to]){
edge[i].flow += Min;
edge[i^1].flow -= Min;
}
u = start;
ans += Min;
continue;
}
bool flag = false;
int v;
for(int i=cur[u];i != -1;i = edge[i].next){
v = edge[i].to;
if(edge[i].cap - edge[i].flow && dep[v] + 1 == dep[u]){
flag = true;
cur[u] = pre[v] = i;
break;
}
}
if(flag){
u = v;
continue;
}
int Min = N;
for(int i = head[u];i != -1;i=edge[i].next){
if(edge[i].cap-edge[i].flow && dep[edge[i].to] < Min){
Min = dep[edge[i].to];
cur[u] = i;
}
}
gap[dep[u]]--;
if(!gap[dep[u]]) return ans;
dep[u] = Min + 1;
gap[dep[u]] ++;
if(u != start) u = edge[pre[u]^1].to;
}
return ans;
}
void Input(){
int T,t=1,ans,t_ans,src,des,n,m;
scanf("%d",&T);
while(T--){
scanf("%d %d",&n,&m);
init();
src = 0; des = 1000;
int tempa,tempb,tempc;
t_ans = 0;
for(int i=1;i<=n;i++){
scanf("%d %d %d",&tempb,&tempa,&tempc);
addedge(src,i,tempb);
t_ans += tempb;
for(int j=tempa;j<=tempc;j++){
addedge(i,j+n,1);
}
}
for(int i=1;i<=500;i++){
addedge(i+n,des,m);
}
ans = sap(src,des,502+n);
printf("Case %d: ",t++,ans);
if(ans == t_ans){
puts("Yes\n");
}
else{
puts("No\n");
}
}
}
int main(void){
//freopen("a.in","r",stdin);
Input();
return 0;
}