城市间紧急救援 (25 分)

//迪杰斯特拉算法求城市间紧急救援
#include<iostream>
#include<cstring>
using namespace std;
#define num 1001
#define max 2020010
struct visit
{
   
	int peo;
	int flag;
	int sum;
	int len;
	int route;
}visit[num];
struct TU
{
   
	int vexnum;
	int arc[num][num];
}tu;
int main()
{
   
	int pre[num];
	memset(pre, -1, sizeof(pre));
	int x[num];
	memset(x, -1, sizeof(x));
	int N, M, S, D;
	cin >> N >> M >> S >> D;
	for (int i = 0; i < N; i++)//图的初