Dwarf Tower （SPFA）

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <queue>
#include <string.h>
using namespace std;
struct node{
	int u, v, w, next;
}edge[200005];
int head[10005];
int cnt;
void add(int u, int v, int w){
	edge[cnt].u=u;
	edge[cnt].v=v;
	edge[cnt].w=w;
	edge[cnt].next=head[u];
	head[u]=cnt++;
}
int n, m;
int a[10005];
int num[10005];
queue<int> q;
int dis[10005];
bool vis[10005];
void SPFA(){
	for(int i=1; i<=n; i++){
		dis[i]=a[i];
		q.push(i);
		vis[i]=true;
	}
	while(!q.empty()){
		int temp=q.front();
		q.pop();
		vis[temp]=false;
		for(int i=head[temp]; i!=-1; i=edge[i].next){
			int to=edge[i].v;
			if(dis[to]>dis[edge[i].u]+dis[edge[i].w]){
				dis[to]=dis[edge[i].u]+dis[edge[i].w];
				if(!vis[to]){
					vis[to]=true;
					q.push(to);
				}
			}
		}
	}
}
int main(){
	freopen("dwarf.in","r",stdin);
    freopen("dwarf.out","w",stdout);
	scanf("%d%d", &n, &m);
	int z, x, y;
	memset(head, -1, sizeof(head));
	for(int i=1; i<=n; i++)
		scanf("%d", &a[i]);
	for(int i=0; i<m; i++){
		scanf("%d%d%d", &z, &x, &y);
		add(x, z, y);
		add(y, z, x);
	}
	SPFA();
	printf("%d\n", dis[1]);
	return 0;
}