UVALive 6571 It Can Be Arranged

                网络流，拆点，然后反向建图跑一遍最大流就可以得出可重复利用的班有哪些，然后总数减一下就是答案了。

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define LL long long
#define CLR(a, b) memset(a, b, sizeof(a))
using namespace std;
const int maxn = 300;
const int INF = 0x3f3f3f3f;

struct Edge
{
    int from, to, cap, flow;
};
bool operator < (const Edge& a, const Edge& b)
{
    return a.from < b.from || (a.from == b.from && a.to < b.to);
}

struct ISAP
{
    int n, m, s, t;
    vector<Edge> edges;
    vector<int> G[maxn];   // 邻接表，G[i][j]表示结点i的第j条边在e数组中的序号
    bool vis[maxn];        // BFS使用
    int d[maxn];           // 从起点到i的距离
    int cur[maxn];        // 当前弧指针
    int p[maxn];          // 可增广路上的上一条弧
    int num[maxn];        // 距离标号计数

    void AddEdge(int from, int to, int cap)
    {
        edges.push_back((Edge)
        {
            from, to, cap, 0
        });
        edges.push_back((Edge)
        {
            to, from, 0, 0
        });
        m = edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    bool BFS()
    {
        memset(vis, 0, sizeof(vis));
        queue<int> Q;
        Q.push(t);
        vis[t] = 1;
        d[t] = 0;
        while(!Q.empty())
        {
            int x = Q.front();
            Q.pop();
            for(int i = 0; i < G[x].size(); i++)
            {
                Edge& e = edges[G[x][i]^1];
                if(!vis[e.from] && e.cap > e.flow)
                {
                    vis[e.from] = 1;
                    d[e.from] = d[x] + 1;
                    Q.push(e.from);
                }
            }
        }
        return vis[s];
    }

    void ClearAll(int n)
    {
        this->n = n;
        for(int i = 0; i < n; i++) G[i].clear();
        edges.clear();
    }
    int Augment()
    {
        int x = t, a = INF;
        while(x != s)
        {
            Edge& e = edges[p[x]];
            a = min(a, e.cap-e.flow);
            x = edges[p[x]].from;
        }
        x = t;
        while(x != s)
        {
            edges[p[x]].flow += a;
            edges[p[x]^1].flow -= a;
            x = edges[p[x]].from;
        }
        return a;
    }

    int Maxflow(int s, int t, int need)
    {
        this->s = s;
        this->t = t;
        int flow = 0;
        BFS();
        memset(num, 0, sizeof(num));
        for(int i = 0; i < n; i++) num[d[i]]++;
        int x = s;
        memset(cur, 0, sizeof(cur));
        while(d[s] < n)
        {
            if(x == t)
            {
                flow += Augment();
                if(flow >= need) return flow;
                x = s;
            }
            int ok = 0;
            for(int i = cur[x]; i < G[x].size(); i++)
            {
                Edge& e = edges[G[x][i]];
                if(e.cap > e.flow && d[x] == d[e.to] + 1)   // Advance
                {
                    ok = 1;
                    p[e.to] = G[x][i];
                    cur[x] = i; // 注意
                    x = e.to;
                    break;
                }
            }
            if(!ok)   // Retreat
            {
                int m = n-1; // 初值注意
                for(int i = 0; i < G[x].size(); i++)
                {
                    Edge& e = edges[G[x][i]];
                    if(e.cap > e.flow) m = min(m, d[e.to]);
                }
                if(--num[d[x]] == 0) break;
                num[d[x] = m+1]++;
                cur[x] = 0; // 注意
                if(x != s) x = edges[p[x]].from;
            }
        }
        return flow;
    }
} sol;

struct course
{
    int a, b, s;
    bool operator < (const course& rhs) const
    {
        return a < rhs.a || (a == rhs.a && b < rhs.b);
    }
    void in()
    {
        scanf("%d%d%d", &a, &b, &s);
    }
} cos[maxn];

int cle[maxn][maxn];

int main()
{
    int n, m, tot, T, cas = 1;
    scanf("%d", &T);
    while(T --)
    {
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; i ++)
            cos[i].in();
        for(int i = 1; i <= n; i ++)
            for(int j = 1; j <= n; j ++)
                scanf("%d", &cle[i][j]);
        sol.ClearAll(n * 2 + 2);tot = 0;
        for(int i = 1; i <= n; i ++)
        {
            int tmp = (cos[i].s + m - 1) / m;
            tot += tmp;
            sol.AddEdge(i, 0, tmp);
            sol.AddEdge(n * 2 + 1, i + n, tmp);
        }
        for(int i = 1; i <= n; i ++)
        {
            for(int j = 1; j <= n; j ++)
            {
                if(cos[j].a > cos[i].b + cle[i][j])
                {
                    sol.AddEdge(i+n, j, INF);
                }
            }
        }
        printf("Case %d: %d\n", cas ++, tot - sol.Maxflow(2*n+1, 0, INF));
    }
    return 0;
}