HDU 6437(最小费用最大流-2018多校第十场1012)

将给的人当作成总费用建立超级源点ss和源点s相连flow为k费用为0，然后s和每个视频建边flow为1费用为0，每个视频还要和汇点tt建边flow和费用一样 然后对视频进行拆点flow为1费用为-w 时间段不重合的视频之间若类型相同建立flow 为1费用为0的边 反之建立flow为1，费用为w的边  然后跑一次费用流就可以了  果然网络流的题还是难在建图

#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <list>
#define INF 0x3f3f3f3f
#define maxn 105000
#define maxnn 6000
#define juzheng 300
#define line cout << "-------------------------" << endl;
#define PI acos(-1.0)
#define mem(a,b) memset(a,b,sizeof(a))
#define fill_(a,b,n) fill(a,a + n,b)
#define esp 1e-9
 
#define ri(n) scanf("%d",&n)
#define ri2(a,b) scanf("%d %d",&a,&b)
#define ri3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define rd(n) scanf("%lf",&n)
#define rd2(a,b) scanf("%lf %lf",&a,&b)
#define rd3(a,b,c) scanf("%lf %lf %lf",&a,&b,&c)
#define rl(n) scanf("%lld",&n)
#define rl2(a,b) scanf("%lld %lld",&a,&b)
#define rl3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define rui(n) scanf("%u",&n)
#define rui2(a,b) scanf("%u %u",&a,&b)
#define rui3(a,b,c) scanf("%u %u %u",&a,&b,&c)
#define rs(str) scanf("%s",str)
#define pr(n) cout << n << endl
#define debug(str,x) cout << str << ":" << x << endl
#define ll long long
#define int64 __int64
#define ui unsigned int

using namespace std;

const ll mod = 1e9 + 7;

//Date:2018-8-22
//Author：HarryBlackCat

int pre[maxn],d[maxn],p[maxn],ans;
int cnt,head[maxn];
int q[1100 * 1100],l,r;
int n,m,k,w,counter;

struct edge {
	int u,v,w,c,next;
} e[1100 * 1100];

struct xx{
	int s,e,flow,val,op,id;
}video[maxn];

bool cmp(xx x,xx y){
	return x.s < y.s;
}

void add(int u,int v,int flow,int cost) {
	e[cnt].u=u,e[cnt].v=v,e[cnt].w=cost,e[cnt].c=flow;
	e[cnt].next=head[u],head[u]=cnt++;
	e[cnt].u=v,e[cnt].v=u,e[cnt].w=-cost,e[cnt].c=0;
	e[cnt].next=head[v],head[v]=cnt++;
}

void updata(int s,int t) {
	int i,f=INF;
	for(i=t; i!=s; i=e[pre[i]].u)
		f=min(f,e[pre[i]].c);
	for(i=t; i!=s; i=e[pre[i]].u) {
		e[pre[i]].c-=f;
		e[pre[i]^1].c+=f;
		ans+=f*e[pre[i]].w;
	}
}

int spfa(int s,int t) {
	int i,u,v,w;
	memset(p,0,sizeof(p));
	memset(pre,-1,sizeof(pre));
	memset(d,0x3f,sizeof(d));
	l=r=0;
	q[++r]=s,p[s]=1,d[s]=0;
	while(l<r) {
		p[u=q[++l]]=0;
		for(i=head[u]; i!=-1; i=e[i].next) {
			v=e[i].v,w=e[i].w;
			if(e[i].c&&d[v]>d[u]+w) {
				d[v]=d[u]+w;
				pre[v]=i;
				if(!p[v]) {
					p[v]=1;
					q[++r]=v;
				}
			}
		}
	}
	if(pre[t]==-1)
		return 0;
	return 1;
}

void MiCMaF(int s,int t) {
	ans=0;
	while(spfa(s,t))
		updata(s,t);
}

void init() {
	memset(head,-1,sizeof(head));
	ans = cnt = 0;
	counter = 1;
}

int main() {
	//cin.sync_with_stdio(false);//降低cin，cout时间
	int t;
	while(~ri(t)){
		while(t--){
			init();
			
			ri2(n,m);
			ri2(k,w);
			
			for(int i = 1;i <= m;i++){
				ri2(video[i].s,video[i].e);
				ri2(video[i].val,video[i].op);
				video[i].id = i;
				counter++;
				
				add(0,video[i].id,1,0);//源点到每个视频 
				add(video[i].id,video[i].id + m,1,-video[i].val);//拆点 
			}
			
			counter += m;
			sort(video + 1,video + 1 + m,cmp);
			
			for(int i = 1;i <= m;i++){
				for(int j = i + 1;j <= m;j++){
					if(video[j].s >= video[i].e){
						int val = video[i].op == video[j].op ? w : 0;
						add(video[i].id + m,video[j].id,1,val);//相同类型建flow为1,val为w，反之flow为1,val为0 
					}
				}
			}
			
			int ss = counter++;
			int tt = counter++;
			
			add(ss,0,k,0);//超级源点到源点 
			for(int i = 1;i <= m;i++)
				add(video[i].id + m,tt,1,0);//每个视频到汇点 
			
			MiCMaF(ss,tt);
			
			printf("%d\n",-ans);
		}
	} 
	return 0;
}