Choose the best route （最短路）

One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city’s traffic route, and the stations which are near Kiki’s home so that she can take. You may suppose Kiki can change the bus at any station. Please find out the least time Kiki needs to spend. To make it easy, if the city have n bus stations ,the stations will been expressed as an integer 1,2,3…n.

InputThere are several test cases.
Each case begins with three integers n, m and s,(n<1000,m<20000,1= Then follow m lines ,each line contains three integers p , q , t (0 Then a line with an integer w(0OutputThe output contains one line for each data set : the least time Kiki needs to spend ,if it’s impossible to find such a route ,just output “-1”.Sample Input

5 8 5
1 2 2
1 5 3
1 3 4
2 4 7
2 5 6
2 3 5
3 5 1
4 5 1
2
2 3
4 3 4
1 2 3
1 3 4
2 3 2
1
1

Sample Output

1
-1

#include
#include
#include 
#define INF 0x3f3f3f3f
using namespace std;

const int MAX = 1005;
int n, m, s;
int maze[MAX][MAX], dis[MAX], vis[MAX];

void dijk(int s)
{
	for(int i=1; i<=n; i++)
        dis[i] = maze[s][i];
	vis[s] = 1;
	dis[s] = 0;
	for(int i=1; i