LightOJ 1409 Rent a Car 费用流

题目：http://www.lightoj.com/volume_showproblem.php?problem=1409

题意：有一个出租车公司（初始时公司还没有车），有接下来n天的车辆租赁表，有c个卖车的公司，每个公司有一定量的汽车和固定的售价。出租车公司收回租出去的车辆后，要送到维修厂保养，有r个维修厂，每个维修厂保养需要一定的天数和费用，维修后的汽车送回出租车公司（每个维修厂可以同时保养的汽车足够多，出租车公司车库足够大）。问要完成表上的要求，最小花费是多少，不能完成输出impossible

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
 
typedef long long ll;
const int N = 210;
const int INF = 0x3f3f3f3f;
struct edge
{
    int st, to, cap, cost, next;
}g[N*N*4];
int cas;
int cnt, head[N];
int dis[N], pre[N];
bool vis[N];
int arr[N], brr[N], crr[N], drr[N], err[N];
int n, m, k;
void add_edge(int v, int u, int cap, int cost)
{
    g[cnt].st = v, g[cnt].to = u, g[cnt].cap = cap, g[cnt].cost = cost, g[cnt].next = head[v], head[v] = cnt++;
    g[cnt].st = u, g[cnt].to = v, g[cnt].cap = 0, g[cnt].cost = -cost, g[cnt].next = head[u], head[u] = cnt++;
}
void spfa(int s, int t)
{
    memset(dis, 0x3f, sizeof dis);
    memset(vis, 0, sizeof vis);
    memset(pre, -1, sizeof pre);
    queue<int> que;
    que.push(s);
    dis[s] = 0, vis[s] = true;
    while(! que.empty())
    {
        int v = que.front(); que.pop();
        vis[v] = false;
        for(int i = head[v]; i != -1; i = g[i].next)
        {
            int u = g[i].to;
            if(g[i].cap > 0 && dis[u] > dis[v] + g[i].cost)
            {
                dis[u] = dis[v] + g[i].cost;
                pre[u] = i;
                if(! vis[u])
                    que.push(u), vis[u] = true;
            }
        }
    }
}
int cost_flow(int s, int t, int flow)
{
    int res = 0;
    while(flow > 0)
    {
        spfa(s, t);
        if(dis[t] == INF) return -1;
        int d = flow;
        for(int i = pre[t]; i != -1; i = pre[g[i].st])
            d = min(d, g[i].cap);
        for(int i = pre[t]; i != -1; i = pre[g[i].st])
            g[i].cap -= d, g[i^1].cap += d;
        flow -= d;
        res += d * dis[t];
    }
    return res;
}
int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d%d%d", &n, &m, &k);
        cnt = 0;
        memset(head, -1, sizeof head);
        int sum = 0;
        int ss = 0, tt = 2 * n + 1;
        for(int i = 1; i < n; i++)
            add_edge(i, i + 1, INF, 0);
        for(int i = 1; i <= n; i++)
        {
            scanf("%d", &arr[i]), sum += arr[i];
            add_edge(i, tt, arr[i], 0);
            add_edge(ss, n + i, arr[i], 0);
        }
        for(int i = 1; i <= m; i++)
        {
            scanf("%d%d", &brr[i], &crr[i]);
            add_edge(ss, 1, brr[i], crr[i]);
        }
        for(int i = 1; i <= k; i++)
            scanf("%d%d", &drr[i], &err[i]);
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= k; j++)
                if(i + drr[j] + 1 <= n)
                    add_edge(n + i, i + drr[j] + 1, INF, err[j]);
 
        int res = cost_flow(ss, tt, sum);
        if(res == -1) printf("Case %d: impossible\n", ++cas);
        else printf("Case %d: %d\n", ++cas, res);
    }
    return 0;
}