【SDOI 2011】工作安排

一道不开long long见祖宗的题。
大佬点这里

这里的工作是一个分段函数，我们可以考虑拆边。将每条连向员工的边分成S+1段，每段的权值是增量w，流量是2段之间的差。由于我们求的是最短路，而w是保证递增的，正好也符合题意。

上马！

#pragma GCC optimize(2)
#include<cstdio>
#include<cctype>
#include<queue>
#include<cstring>
#include<cstdlib>
#define Pair pair <int, int>
typedef long long ll;
using namespace std;

const int N = 5002, M = 900002, lim = 0x3f3f3f3f;
int T[N], A[N], f, prep[N], pree[N], dis[N], s, t, n, m, cnt, val[M], flow[M], to[M], head[N], nxt[M], h[N];

inline int read() {
    int x = 0, f = 1;
    char s = getchar();
    while(! isdigit(s)) {
        if(s == '-')
            f = -1;
        s = getchar();
    }
    while(isdigit(s)) {
        x = (x << 1) + (x << 3) + (s ^ 48);
        s = getchar();
    }
    return x * f;
}

inline void print(ll x) {
    if(x < 0) {
        putchar('-');
        x = -x;
    }
    if(x > 9)
        print(x / 10);
    putchar(x % 10 + '0');
}

inline int Min(const int x, const int y) {
    if(x < y)
        return x;
    return y;
}

inline void addEdge(const int u, const int v, const int w, const int Val) {
    to[++ cnt] = v;
    nxt[cnt] = head[u];
    flow[cnt] = w;
    val[cnt] = Val;
    head[u] = cnt;
    to[++ cnt] = u;
    nxt[cnt] = head[v];
    flow[cnt] = 0;
    val[cnt] = -Val;
    head[v] = cnt;
}

ll EK() {
	ll res = 0;
    int maxflow, ans = 0;
    memset(h, 0, sizeof h);
    while(f) {
        priority_queue <Pair, vector <Pair>, greater <Pair> > q;
        for(int i = 1; i <= t; ++ i)
            dis[i] = -1;
        dis[s] = 0;
        q.push(Pair(0, s));
        while(! q.empty()) {
            Pair now = q.top();
            q.pop();
            int u = now.second;
            if(dis[u] < now.first)
                continue;
            for(int i = head[u]; ~i; i = nxt[i]) {
                int v = to[i];
                if(flow[i] > 0 && (dis[v] < 0 || dis[v] > dis[u] + val[i] + h[u] - h[v])) {
                    dis[v] = dis[u] + val[i] + h[u] - h[v];
                    prep[v] = u;
                    pree[v] = i;
                    q.push(Pair(dis[v], v));
                }
            }
        }
        if(dis[t] < 0)
            break;
        maxflow = f;
        for(int i = 1; i <= t; ++ i)
            h[i] += (dis[i] == -1 ? 0 : dis[i]);
        for(int i = t; i != s; i = prep[i])
            maxflow = Min(maxflow, flow[pree[i]]);
        if(maxflow == lim)
        	exit(0);
        res += maxflow * h[t];
        ans += maxflow;
        f -= maxflow;
        for(int i = t; i != s; i = prep[i]) {
        	if(flow[pree[i]] != lim)
            	flow[pree[i]] -= maxflow;
            if(flow[pree[i] ^ 1] != lim)
            	flow[pree[i] ^ 1] += maxflow;
        }
    }
    return res;
}

int main() {
	int x, a;
    m = read();
    n = read();
    cnt = -1;
    f = lim;
    s = n + m + 1;
    t = s + 1;
    memset(head, -1, sizeof head);
    for(int i = 1; i <= n; ++ i)
    	A[i] = read();
    for(int i = 1; i <= m; ++ i)
    	for(int j = 1; j <= n; ++ j) {
    		x = read();
    		if(x)
    			addEdge(i, j + m, lim, 0);
		}
	for(int i = 1; i <= m; ++ i) {
		a = read();
		for(int j = 1; j <= a; ++ j)
			T[j] = read();
		for(int j = 1; j <= a; ++ j) {
			x = read();
			addEdge(s, i, T[j] - T[j - 1], x);
		}
		x = read();
		addEdge(s, i, lim, x);
	}
	for(int i = 1; i <= n; ++ i)
		addEdge(i + m, t, A[i], 0);
	print(EK());
	putchar('\n');
    return 0;
}