HDU 4780 Candy Factory

ProblemDescription

  A newcandy factory opens in pku-town. The factory import M machines to produce highquality candies. These machines are numbered from 1 to M.
  There are N candies need to be produced. These candies are alsonumbered from 1 to N. For each candy i , it can be produced in any machine j.It also has a producing time(s_i,t_i) , meaning that candyi must start producing at time s_i and will finish att_i. Otherwise if the start time is p_i(s_i < p_i < t_i)then candy will still finish at t_i but needadditional K*(p_i - s_i) cost. The candy can’t beproduced if p_i is greater than or equal to t_i.Of course one machine can only produce at most one candy at a time and can’tstop once start producing.
  On the other hand, at time 0 all the machines are in their initialstate and need to be “set up” or changed before starting producing. To set upMachine j from its initial state to the state which is suitable for producingcandiy i, the time required is C_ij and cost is D_ij.To change a machine from the state suitable for candy i₁ into the statesuitable for candy i₂, time required is E_i1i2 and cost is F_i1i2.
  As the manager of the factory you have to make a plan to produceall the N candies. While the sum of producing cost should be minimized.

 

 

Input

There are multiple test cases.
For each case, the first line contains threeintegers N(1<=N<=100), M(1<=M<=100), K(1<=K<=100) . Themeaning is described above.
Then N lines follow, each line contains 2integers s_i and t_i(0 <= s_i < t_i <100000).
Then N lines follow, each line contains Mintegers, the j-th integer of the i-th line indicating C_ij(1<=C_ij<=100000).
Then N lines follow, each line contains Mintegers, the j-th integer of the i-th line indicating D_ij(1<=D_ij<=100000).
Then N lines follow, each line contains Nintegers, the i₂-th integer of the i₁-th line indicatingE_i1i2(1<=E_i1j2<=100000) . 
Then N lines follow, each line contains Nintegers, the i₂-th integer of the i₁-th line indicatingF_i1i2(1 <= F_i1j2<=100000) . 
Since the same candy will only be producedonce, E_ii and F_ii are meaninglessand will always be -1.
The input ends by N=0 M=0 K=0. Cases areseparated with a blank line.

 

 

Output

  Foreach test case, if all of M candies can be produced, output the sum of minimumproducing cost in a single line. Otherwise output -1.

 

 

Sample Input

3 2 1

4 7

2 4

8 9

4 4

3 3

3 3

2 8

12 3

14 6

-1 1 1

1 -1 1

1 1 -1

-1 5 5

5 -1 5

5 5 -1

 

1 1 2

1 5

5

5

-1

-1

 

0 0 0

 

 

Sample Output

11

-1

 集训期间，实在太累，不写了。。。。。。待到开学再来慢慢写吧

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>>
#define INF 1000000000
using namespace std;
const int M = 10 * 10010;//边

struct Node//边，点f到点t，流量为c，费用为w
{
	int st, ed;
	int flow, cost;
	int next;
}edge[M];
int head[M], dis[M], q[M], pre[M], cnt;//cnt为已添加的边数，head为邻接表,dis为花费，pre为父亲节点
bool vis[M];

int c[110][110], d[110][110], e[110][110], f[110][110];
int n, m, k ,s ,t;
struct ME
{
    int start ,en;
}me[110];

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

void add_edge(int f, int t, int d1, int d2, int w)
{//f到t的一条边，流量为d1,反向流量d2,花费w,反向边花费-w（可以反悔)
	edge[cnt].st = f;
	edge[cnt].ed = t;
	edge[cnt].flow = d1;
	edge[cnt].cost = w;
	edge[cnt].next = head[f];
	head[f] = cnt++;

	edge[cnt].st = t;
	edge[cnt].ed = f;
	edge[cnt].flow = d2;
	edge[cnt].cost = -w;
	edge[cnt].next = head[t];
	head[t] = cnt++;
}

bool spfa(int s, int t, int n)
{
	int i, tmp, l, r;
	memset(pre, -1, sizeof(pre));
	for(i = 0; i < n; ++i)
    {
        dis[i] = INF;
    }
	dis[s] = 0;
	q[0] = s;
	l = 0, r = 1;
	vis[s] = true;
	while(l != r)
    {
		tmp = q[l];
		l = (l + 1) % (n + 1);
		vis[tmp] = false;
		for(i = head[tmp]; i!=-1; i = edge[i].next)
		{
			if(edge[i].flow && dis[edge[i].ed] > dis[tmp] + edge[i].cost)
			{
				dis[edge[i].ed] = dis[tmp] + edge[i].cost;
				pre[edge[i].ed] = i;
				if(!vis[edge[i].ed])
				{
					vis[edge[i].ed] = true;
					q[r] = edge[i].ed;
					r = (r + 1) % (n + 1);
				}
			}
		}
	}
	if(pre[t] == -1)
	{
	    return false;
	}
	return true;
}

void MCMF(int s, int t, int n, int &flow, int &cost)
{//起点s，终点t，点数n，最大流flow，最小花费cost
	int tmp, arg;
	flow = cost = 0;
	while(spfa(s, t, n))
    {
		arg = INF;
		tmp = t;
		while(tmp != s)
		{
			arg = min(arg, edge[pre[tmp]].flow);
			tmp = edge[pre[tmp]].st;
		}
		tmp = t;
		while(tmp != s)
		{
			edge[pre[tmp]].flow -= arg;
			edge[pre[tmp] ^ 1].flow += arg;
			tmp = edge[pre[tmp]].st;
		}
		flow += arg;
		cost += arg * dis[t];
	}
}

int main()
{
    int no ,no1 ,no2;
    int flow, cost;
    while(~scanf("%d%d%d",&n,&m,&k),n+m+k!=0)
    {
        for(int i = 1;i<=n;i++)
        {
            scanf("%d%d",&me[i].start,&me[i].en);
        }
        for(int i = 1;i<=n;i++)
        {
            for(int j = 1;j<=m;j++)
            {
                scanf("%d",&c[i][j]);
            }
        }
        for(int i = 1;i<=n;i++)
        {
            for(int j = 1;j<=m;j++)
            {
                scanf("%d",&d[i][j]);
            }
        }
        for(int i = 1;i<=n;i++)
        {
            for(int j = 1;j<=n;j++)
            {
                scanf("%d",&e[i][j]);
            }
        }
        for(int i = 1;i<=n;i++)
        {
            for(int j = 1;j<=n;j++)
            {
                scanf("%d",&f[i][j]);
            }
        }
        no = m;
		init();
        for(int i = 1;i<=m;i++)
        {
            add_edge(0,i,1,0,0);
			for(int j = 1;j<=n;j++)
			{
				if(c[j][i] <= me[j].start)
				{
					add_edge(i,no + j,1,0,d[j][i]);
				}
				else if(c[j][i] < me[j].en)
				{
					add_edge(i,no + j,1,0,k * (c[j][i] - me[j].start) + d[j][i]);
				}
			}
        }
        no1 = m + n;
        no2 = no1 + n;
        t = no2 + n + 1;
        for(int i = 1;i<=n;i++)
        {
            add_edge(0,no1 + i,1,0,0);
            add_edge(no + i,no2 + i,1,0,0);
            for(int j = 1;j<=n;j++)
            {
				if(i!=j)
				{
					if(me[i].en + e[i][j] <= me[j].start)
					{
						add_edge(no1 + i,no2 + j,1,0,f[i][j]);
					}
					else if(me[i].en + e[i][j] < me[j].en)
					{
						add_edge(no1 + i,no2 + j,1,0,k * ( me[i].en + e[i][j] - me[j].start) + f[i][j]);
					}
				}
            }
            add_edge(no2 + i,t,1,0,0);
        }
        MCMF(0,t,t+1,flow,cost);
        if(flow==n)
        {
            printf("%d\n",cost);
        }
        else
        {
            printf("-1\n");
        }
    }
    return 0;
}