题意:给你n个点m条边(单向边)和q次操作,初始时所有点都是没有标记的,有两种操作:
1. 0 x:将x标记,如果已近标记过了就输出 “ERROR! At point x”
2. 1 u v :询问从u到v的最短路,并且要求都是被标记过得点,否则输出 “ERROR! At path x to y” ,如果到不了就输出 “No such path” ,有就输出最短路径大小
分析:本题的限制就是两点间的最短路要经过标记过的点才行,很容易想到标记一个点就更新一次最短路,因为n<=300且每次询问求的是任意两点间的最短路,自然而然想到floyd(每次更新最短路以新标记的点为中继点跑Floyd)
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int N = 3e2 + 5;
const long long Inf = 1e12;
long long dis[N][N];
void floyd(int k, int n) {
for(int i = 0; i < n; i += 1) {
for(int j = 0; j < n; j += 1) {
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
}
}
}
bool vis[N];
void init(int n) {
for(int i = 0; i < n; i += 1) {
dis[i][i] = 0;
vis[i] = false;
for(int j = i + 1; j < n; j += 1) {
dis[i][j] = dis[j][i] = Inf;
}
}
}
int main() {
int v, e, Q, cas = 1;
while(~scanf("%d%d%d", &v, &e, &Q)) {
if(v + e + Q == 0)
break;
init(v);
int x, y;
long long wi;
for(int i = 0; i < e; i += 1) {
scanf("%d%d%lld", &x, &y, &wi);
dis[x][y] = min(dis[x][y], wi);
}
int op;
if(cas>1) printf("\n");
printf("Case %d:\n", cas);
cas += 1;
while(Q--) {
scanf("%d", &op);
if(op == 0) {
scanf("%d", &x);
if(vis[x])
printf("ERROR! At point %d\n", x);
else {
vis[x] = true;
floyd(x, v);
}
} else {
scanf("%d%d", &x, &y);
if(!vis[x] || !vis[y])
printf("ERROR! At path %d to %d\n", x, y);
else if(dis[x][y] == Inf)
printf("No such path\n");
else
printf("%lld\n", dis[x][y]);
}
}
}
return 0;
}