输入

输出

1 4
4 5
B 2 16 99
P 6 32 13
P 2 87 4
P 38 96 49
1 2 4
1 3 40
2 3 75
2 4 76
3 4 77

127
1 2 4

时空复杂度

时间O(C*N2)   --Dijkstra          C是计算wait函数的重复次数，可看做4O(C*K*M)  --SPFA              K是SPFA算法的时间系数，可以看做1

空间 O(N2)     --临接矩阵O(N+M)    --临接表/前向星/十字链表

#include <stdio.h>
#include <stdlib.h>
#define INF 0XFFFFFFF
struct node{
int c, r;
int t[2];
}node[301];
int map[301][301];
int s, t;
int m, n;

int dis[301];
int used[301];
int from[301];

int min(int a, int b)
{
return a < b ? a : b;
}

int getcolor(int i, int k, int *t)
{
int x;
if(k < node[i].r){
*t = node[i].r - k;
return node[i].c;
}
x = k - node[i].r;
x %= node[i].t[0] + node[i].t[1];
if(x < node[i].t[1]){
*t = node[i].t[1] - x;
return 1 - node[i].c;
}else{
*t = node[i].t[1] + node[i].t[0] - x;
return node[i].c;
}
}

int wait(int a, int b, int k)
{
int i;
int t = 0;
int x, y;
for(i = 1; i <= 3; i++){
if(getcolor(a, k, &x) == getcolor(b, k, &y)){
return t;
}
k += min(x, y);
t += min(x, y);
}
return INF;
}

int srch(int s)
{
int i, j;
int a, b;
for(i = 1; i <= n; i++){
dis[i] = INF;
}
dis[s] = 0;
for(j = 1; j < n; j++){
b = INF;
for(i = 1; i <= n; i++){
if(!used[i] && dis[i] < b){
s = i;
b = dis[i];
}
}
if(s == t){
break;
}
used[s] = 1;
for(i = 1; i <= n; i++){
if(!used[i] && map[s][i]){
a = wait(i, s, dis[s]);
if(dis[i] > dis[s] + map[s][i] + a){
dis[i] = dis[s] + map[s][i] + a;
from[i] = s;
}
}
}
}
return dis[t];
}

void output(int t)
{
if(t == s){
printf("%d", t);
return;
}
output(from[t]);
printf(" %d", t);
}

int main(int argc, char **argv)
{
int i;
int a, b;
scanf("%d%d", &s, &t);
scanf("%d%d\n", &n, &m);
for(i = 1; i <= n; i++){
a = 0;
scanf("%c%d", (char *)&a, &node[i].r);
if(a == 'B'){
node[i].c = 0;
scanf("%d%d\n", &node[i].t[0], &node[i].t[1]);
}else{
node[i].c = 1;
scanf("%d%d\n", &node[i].t[1], &node[i].t[0]);
}
}
for(i = 0; i < m; i++){
scanf("%d%d", &a, &b);
scanf("%d", &map[a][b]);
map[b][a] = map[a][b];
}
a = srch(s);
if(a == INF){
printf("0\n");
}else{
printf("%d\n", a);
output(t);
printf("\n");
}
return 0;
}