题目链接:
http://acm.hdu.edu.cn/showproblem.php?pid=3631
解题思路:
题目大意:有向图(three integers (x, y, c): initial vertex (x), terminal vertex (y)),有重边。选中一些点,在这些点里面求两点的最
短路。有2个操作,操作 "0" 表示标记 x ,如果x之前已经被标记,输出 "ERROR! At point x"。操作 "1" 表示求 x ->y 的最短路(the
length of shortest-path between x and y only through marked vertices),如果x或y未被标记,输出 "ERROR! At path x to y",如果不存在
这条路径则输出 "No such path"。
思路:初始化 vis 数组为0,表示全部未被选中,之后标记 vis[x] 为1表示 x 被选中,然后每当一个点x被标记时,用Floyd更新一下
把 x 点作为中间点的最短路。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define INF 0xfffffff
using namespace std;
typedef long long ll;
int n,m,q;
ll edge[305][305];
int vis[305];
void init(){
memset(vis,0,sizeof(vis));
for(int i = 0; i < n; i++){
edge[i][i] = 0;
for(int j = 0; j < i; j++){
edge[i][j] = edge[j][i] = INF;
}
}
}
void floyd(int k){
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
edge[i][j] = min(edge[i][j],edge[i][k]+edge[k][j]);
}
int main(){
int t = 1;
while(~scanf("%d%d%d",&n,&m,&q),n+m+q){
if(t != 1)
printf("\n");
printf("Case %d:\n",t++);
init();
int u,v;
ll w;
for(int i = 0; i < m; i++){
scanf("%d%d%lld",&u,&v,&w);
edge[u][v] = min(edge[u][v],w);
}
int op;
for(int i = 0; i < q; i++){
scanf("%d",&op);
if(op == 0){
scanf("%d",&u);
if(vis[u]){
printf("ERROR! At point %d\n",u);
}
else{
vis[u] = 1;
floyd(u);
}
}
else{
scanf("%d%d",&u,&v);
if(!vis[u] || !vis[v])
printf("ERROR! At path %d to %d\n",u,v);
else if(edge[u][v] >= INF)
printf("No such path\n");
else
printf("%lld\n",edge[u][v]);
}
}
}
return 0;
}