HDU 1960 Taxi Cab Scheme(最小路径覆盖)

题意：给出m个人坐出租车的出发时间，出发点和到达点，出租车在客人出发前至少1分钟需要到达出发点等待客人，问最少需要多少辆出租车

思路：明显的最小路径覆盖，而时间是一个天然的序，建立二分图，求出最大匹配，二分图顶点数 = 最大匹配 + 最小路径覆盖

#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
const int maxn = 510;
using namespace std;

struct time {
    int h, m;
    time() {}
    time(int h, int m) : h(h), m(m) {}
    bool operator <= (time a) const {
        if(h != a.h) return h < a.h;
        return m <= a.m;
    }
    time nxt(int tal) {
        int sum = h * 3600 + m * 60;
        sum += tal * 60;
        int hh = sum / 3600;
        int mm = (sum / 60) % 60;
        return time(hh, mm);
    }
    void input() { scanf("%d:%d", &h, &m); }
};

time st[maxn];
int sx[maxn], sy[maxn];
int gx[maxn], gy[maxn];
int use[maxn], from[maxn];
vector<int> g[maxn];
int T, n;

int match(int x) {
    for(int i = 0; i < g[x].size(); i++) {
        int v = g[x][i];
        if(use[v]) continue; use[v] = 1;
        if(from[v] == -1 || match(from[v])) {
            from[v] = x; return 1;
        }
    }
    return 0;
}

int maxp() {
    memset(from, -1, sizeof(from));
    int sum = 0;
    for(int i  = 1; i <= n; i++) {
        memset(use, 0, sizeof(use));
        sum += match(i);
    }
    return sum;
}

int tal(int i, int j) {
    int t1 = abs(sx[i] - gx[i]) + abs(sy[i] - gy[i]);
    int t2 = abs(sx[j] - gx[i]) + abs(sy[j] - gy[i]);
    return t1 + t2 + 1;
}

int main() {
    scanf("%d", &T);
    while(T--) {
        scanf("%d", &n);
        for(int i = 1; i <= n; i++) {
            st[i].input();
            scanf("%d %d %d %d", &sx[i], &sy[i], &gx[i], &gy[i]);
            g[i].clear();
        }
        for(int i = 1; i <= n; i++) {
            for(int j = 1; j <= n; j++) {
                if(i == j) continue;
                time ed = st[i].nxt(tal(i, j));
                if(ed <= st[j]) g[i].push_back(j);
            }
        }
        int ans = n - maxp();
        printf("%d\n", ans);
    }
    return 0;
}