/*
最小路径覆盖,建图很重要,对于两个destionatin schedule i和j,
如果i的出发时间小于j且完成i的时间加上从i的目的地到j的起始地
的时间小于j的出发时间,那么i到j有一条边
*/
#include <iostream>
#include <cmath>
#define MAX_N 505
struct p
{
int nein;
int neins[MAX_N];
}nodes[MAX_N];
struct dst
{
int x1, y1, x2, y2, t;
}dsts[MAX_N];
int dn;
bool v[MAX_N];
int pre[MAX_N];
using namespace std;
bool can(int id)
{
for(int i = 0; i < nodes[id].nein; i++)
{
int curid = nodes[id].neins[i];
if(!v[curid])
{
v[curid] = true;
if(pre[curid] == 0 || can(pre[curid]))
{
pre[curid] = id;
return true;
}
}
}
return false;
}
//匈牙利算法
int getRes()
{
int total = 0;
for(int i = 1; i <= dn; i++)
{
memset(v, 0, sizeof(v));
if(can(i))
total++;
}
return dn - total;
}
int main()
{
int caseN, i, j;
char temp[8];
scanf("%d", &caseN);
while(caseN--)
{
memset(nodes, 0, sizeof(nodes));
memset(pre, 0, sizeof(pre));
scanf("%d", &dn);
//建图
for(i = 1; i <= dn; i++)
{
scanf("%s%d%d%d%d", temp, &dsts[i].x1, &dsts[i].y1, &dsts[i].x2, &dsts[i].y2);
dsts[i].t = (int(temp[0] - '0') * 10 + int(temp[1] - '0')) * 60 + int(temp[3] - '0') * 10 + int(temp[4] - '0');
for(j = 1; j < i; j++)
{
if(dsts[i].t <= dsts[j].t)
{
int tempd = dsts[i].t + abs(dsts[i].x1 - dsts[i].x2) + abs(dsts[i].y1 - dsts[i].y2) +
abs(dsts[i].x2 - dsts[j].x1) + abs(dsts[i].y2 - dsts[j].y1);
if(tempd >= 24 * 60) continue;
if(tempd < dsts[j].t) nodes[i].neins[nodes[i].nein++] = j;
}
else
{
int tempd = dsts[j].t + abs(dsts[j].x1 - dsts[j].x2) + abs(dsts[j].y1 - dsts[j].y2) +
abs(dsts[j].x2 - dsts[i].x1) + abs(dsts[j].y2 - dsts[i].y1);
if(tempd >= 24 * 60) continue;
if(tempd < dsts[i].t) nodes[j].neins[nodes[j].nein++] = i;
}
}
}
printf("%d/n", getRes());
}
return 0;
}
POJ 2060 Taxi Cab Scheme
最新推荐文章于 2025-07-25 16:23:30 发布