题意:整个城市分为Q个区,一个Repairing Company有M个任务,每个任务有三个值,pi-在哪个区,ti-用户要求开始的时间,di-完成任务需要花费的时间。
分析:一个典型的最小路径覆盖,问需要多少个staff来完成这些任务,就是要有多少条路径来覆盖到图中所有的点。
#include <cstdio>
using namespace std;
const int mm=555555;
const int mn=1111;
const int oo=1000000000;
int node,src,dest,edge;
int ver[mm],flow[mm],next[mm];
int head[mn],work[mn],dis[mn],q[mn];
int dist[23][23],p[mn],t[mn],d[mn];
void Floyd(int n)
{
int i, j, k;
for( k=1; k <= n; ++k )
for( i=1; i <= n; ++i )
if( i != k && dist[i][k] != -1 )
{
for( j=1; j <= n; ++j )
if( j != k && j != i && dist[k][j] != -1 )
{
if( dist[i][j] == -1 || dist[i][j] > dist[i][k]+dist[k][j] )
{
dist[i][j] = dist[i][k]+dist[k][j];
}
}
}
}
inline int min(int a,int b)
{
return a<b?a:b;
}
inline void prepare(int _node,int _src,int _dest)
{
node=_node,src=_src,dest=_dest;
for(int i=0;i<node;++i)head[i]=-1;
edge=0;
}
inline void addedge(int u,int v,int c)
{
ver[edge]=v,flow[edge]=c,next[edge]=head[u],head[u]=edge++;
ver[edge]=u,flow[edge]=0,next[edge]=head[v],head[v]=edge++;
}
bool Dinic_bfs()
{
int i,u,v,l,r=0;
for(i=0;i<node;++i)dis[i]=-1;
dis[q[r++]=src]=0;
for(l=0;l<r;++l)
for(i=head[u=q[l]];i>=0;i=next[i])
if(flow[i]&&dis[v=ver[i]]<0)
{
dis[q[r++]=v]=dis[u]+1;
if(v==dest)return 1;
}
return 0;
}
int Dinic_dfs(int u,int exp)
{
if(u==dest)return exp;
for(int &i=work[u],v,tmp;i>=0;i=next[i])
if(flow[i]&&dis[v=ver[i]]==dis[u]+1&&(tmp=Dinic_dfs(v,min(exp,flow[i])))>0)
{
flow[i]-=tmp;
flow[i^1]+=tmp;
return tmp;
}
return 0;
}
int Dinic_flow()
{
int i,ret=0,delta;
while(Dinic_bfs())
{
for(i=0;i<node;++i)work[i]=head[i];
while(delta=Dinic_dfs(src,oo))ret+=delta;
}
return ret;
}
int main()
{
int Q,M,i,j,tmp;
while(scanf("%d%d",&Q,&M)&&(Q||M))
{
for(i=1;i<=Q;i++)
for(j=1;j<=Q;j++)
scanf("%d",&dist[i][j]);
Floyd(Q);
for(i=1;i<=M;i++)
{
scanf("%d%d%d",&p[i],&t[i],&d[i]);
}
prepare(M+M+2,0,M+M+1);
for(i=1;i<=M;i++)
{
addedge(src,i,1),addedge(i+M,dest,1);
for(j=1;j<=M;j++)
{
if(i==j) continue;
if((t[i]+d[i]+dist[p[i]][p[j]])<=t[j])
addedge(i,j+M,1);
}
}
printf("%d\n",M-Dinic_flow());
}
return 0;
}