hdu6437 Problem L.Videos(网络流)

Problem L.Videos

Problem Description:

C-bacteria takes charge of two kinds of videos: ’The Collection of Silly Games’ and ’The Collection of Horrible Games’.
For simplicity’s sake, they will be called as videoA and videoB.
There are some people who want to watch videos during today, and they will be happy after watching videos of C-bacteria.
There are n hours a day, m videos are going to be show, and the number of people is K.
Every video has a type(videoA or videoB), a running time, and the degree of happi- ness after someone watching whole of it.
People
can watch videos continuous(If one video is running on 2pm to 3pm and
another is 3pm to 5pm, people can watch both of them).
But each video only allows one person for watching.
For a single person, it’s better to watch two kinds to videos alternately, or he will lose W happiness.
For
example, if the order of video is ’videoA, videoB, videoA, videoB, …’
or ’B, A, B, A, B, …’, he won’t lose happiness; But if the order of
video is ’A, B, B, B, A, B, A, A’, he will lose 3W happiness.
Now you have to help people to maximization the sum of the degree of happiness.

 

Input

Multiple query.
On the first line, there is a positive integer T, which describe the number of data. Next there are T groups of data.
for
each group, the first line have four positive integers n, m, K, W : n
hours a day, m videos, K people, lose W happiness when watching same
videos).
and then, the next m line will describe m videos, four
positive integers each line S, T, w, op : video is the begin at S and
end at T, the happiness that people can get is w, and op describe it’s
tpye(op=0 for videoA and op=1 for videoB).
There is a blank line before each groups of data.
T<=20, n<=200, m<=200, K<=200, W<=20, 1<=S<T<=n, W<=w<=1000,
op=0 or op=1

 

Output

Your output should include T lines, for each line, output the maximum happiness for the corresponding datum.

 

Sample Input

Sample Output

题目大意：一天有N个小时，有m个节目（每种节目都有类型），有k个人，连续看相同类型的节目会扣w快乐值

每一种节目有都一个播放区间[l,r]。每个人同一时间只能看一个节目，看完可以获得快乐值。问最多可以获得多少快乐？

以下是根据样例一建立的图

建立源点、次源点、汇点。

将每个区间视为一个点，连续经过相同类型的点需要减去w的快乐值。

 #include <cstdio>
 #include <cstring>
 #include <queue>
 #include <algorithm>
 using namespace std;

 ///费用流
 struct MCMF
 {
     static const int MAXN = ;
     static const int MAXM = ;
     static const int INF = 0x7FFFFFFF;
     static const int INF0X3F = 0x3f3f3f3f;
     int n, m, first[MAXN], s, t, sign;
     int dist[MAXN], inq[MAXN], pre[MAXN], incf[MAXN];
     int max_flow, min_cost;

     struct Edge
     {
         int to, cap, cost, next;
     } edge[MAXM * ];

     void init(int l, int r, int ss, int tt)
     {
         //for(int i = l; i <= r; i++ ){first[i] = -1;}
         memset(first, -, sizeof(first));
         s = ss, t = tt, sign = ;
         max_flow = min_cost = ;
     }

     void add_edge(int u, int v, int cap, int cost)
     {
         edge[sign].to = v, edge[sign].cap = cap, edge[sign].cost = cost;
         edge[sign].next = first[u], first[u] = sign++;
         edge[sign].to = u, edge[sign].cap = , edge[sign].cost = -cost;
         edge[sign].next = first[v], first[v] = sign++;
     }

     bool spfa(int s, int t)
     {
         for(int i = ; i < MAXN; i++ )
         {
             dist[i] = INF, inq[i] = ;
         }
         queue<int>que;
         que.push(s), inq[s] = , dist[s] = ;
         incf[s] = INF0X3F;
         while(!que.empty())
         {
             int now = que.front();
             que.pop();
             inq[now] = ;
             for(int i = first[now]; ~i; i = edge[i].next)
             {
                 int to = edge[i].to, cap = edge[i].cap, cost = edge[i].cost;
                 if(cap >  && dist[to] > dist[now] + cost)
                 {
                     dist[to] = dist[now] + cost;
                     incf[to] = min(incf[now], cap);
                     pre[to] = i;
                     if(!inq[to])
                     {
                         que.push(to);
                         inq[to] = ;
                     }
                 }
             }
         }
         return dist[t] != INF;
     }
     void update(int s, int t)
     {
         int x = t;
         while(x != s)
         {
             int pos = pre[x];
             edge[pos].cap -= incf[t];
             edge[pos ^ ].cap += incf[t];
             x = edge[pos ^ ].to;
         }
         max_flow += incf[t];
         min_cost += dist[t] * incf[t];
     }
     void minCostMaxFlow(int s, int t)
     {
         while(spfa(s, t))
         {
             update(s, t);
         }
     }
 } p;

 const int MAXM =  + ;
 struct Node
 {
     int l, r, w, tp;
 } arr[MAXM];

 void solve()
 {
     /// 0 源点
     /// m+m+1 次源点
     /// m+m+2 汇点
     int n, m, K, W;
     scanf("%d %d %d %d", &n, &m, &K, &W);
     p.init(, m+m+ , , m+m+);  ///初始化 l，r，开始点，结束点

     /*
     * 建图
     */
     p.add_edge(, m+m+, K, );
     for(int i = ; i <= m; i++ )
         scanf("%d%d%d%d", &arr[i].l, &arr[i].r, &arr[i].w, &arr[i].tp);
     for(int i = ; i <= m; i++ )
     {
         for(int j = ; j <= m; j++ )
         {
             if(i == j)continue;
             if(arr[i].r <= arr[j].l)
             {
                 p.add_edge(i + m, j, , (arr[i].tp == arr[j].tp ? W : ));  ///i+m为i拆出来的点
             }
         }
     }
     for(int i = ; i <= m; i++ )
     {
         p.add_edge(i, i + m, , -arr[i].w);
     }
     for(int i = ; i <= m; i++ )
     {
         p.add_edge(m+m+, i, , );
     }
     for(int i = ; i <= m; i++ )
     {
         p.add_edge(i + m, m+m+, , );
     }
     p.minCostMaxFlow(, m+m+);
     printf("%d\n", -p.min_cost);
 };

 int main()
 {
     int T;
     scanf("%d", &T);
     while(T--)
     {
         solve();
     }
     return ;
 }