建无相图走的dijistra，求大佬看看哪错了

#include<bits/stdc++.h>
using namespace std;
const int N=10005,M=100005;
int m,n;
int head[N],ver[M],nxt[M],tot,w[M];
int id[105][105];
inline void add(int x,int y,int z){
	ver[++tot]=y,nxt[tot]=head[x],head[x]=tot,w[tot]=z;
	ver[++tot]=x,nxt[tot]=head[y],head[y]=tot,w[tot]=z;
}
int b[105][105];
priority_queue<pair<int,int> >q;
bool vis[N];
int d[N],cnt;
void dij(){
	for(int i=1;i<=cnt;i++)d[i]=1e9;
	d[1]=0;
	q.push(make_pair(0,1));
	while(q.size()){
		int x=q.top().second;
		q.pop();
		if(vis[x])continue;
		vis[x]=1;
		for(int i=head[x];i;i=nxt[i]){
			int y=ver[i];
			if(d[y]>d[x]+w[i]){
				d[y]=d[x]+w[i];
				q.push(make_pair(-d[y],y));
			}
		}
	}
	if(d[id[m][m]]^1000000000)cout<<d[id[m][m]];
	else printf("-1");
}
int main(){
	scanf("%d%d",&m,&n);
	for(int i=1;i<=m;i++){
		for(int j=1;j<=m;j++){
			id[i][j]=++cnt;
		}
	}
	for(int i=1;i<=n;i++){
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		if(z==0)b[x][y]=1;
		else b[x][y]=2;
	}
	for(int i=1;i<=m;i++){
		for(int j=1;j<=m;j++){
			if(b[i][j]){
				if(i<m){
					if(b[i+1][j]==b[i][j])add(id[i+1][j],id[i][j],0);
					else if(b[i+1][j])add(id[i+1][j],id[i][j],1);
				}
				if(i+1<m){
					if(b[i+2][j]==b[i][j])add(id[i+2][j],id[i][j],2);
					else if(b[i+2][j])add(id[i+2][j],id[i][j],3);
				}
				if(j<m){
					if(b[i][j+1]==b[i][j])add(id[i][j+1],id[i][j],0);
					else if(b[i][j+1])add(id[i][j+1],id[i][j],1);
				}
				if(j+1<m){
					if(b[i][j+2]==b[i][j])add(id[i][j+2],id[i][j],2);
					else if(b[i][j+2])add(id[i][j+2],id[i][j],3);
				}
				if(j>1){
					if(b[i][j-1]==b[i][j])add(id[i][j-1],id[i][j],0);
					else if(b[i][j-1])add(id[i][j-1],id[i][j],1);
				}
				if(j>2){
					if(b[i][j-2]==b[i][j])add(id[i][j-2],id[i][j],2);
					else if(b[i][j-2])add(id[i][j-2],id[i][j],3);
				}
				if(i>1){
					if(b[i-1][j]==b[i][j])add(id[i-1][j],id[i][j],0);
					else if(b[i-1][j])add(id[i-1][j],id[i][j],1);
				}
				if(i>2){
					if(b[i-2][j]==b[i][j])add(id[i-2][j],id[i][j],2);
					else if(b[i-2][j])add(id[i-2][j],id[i][j],3);
				}
				if(i>1&&j<m){
					if(b[i-1][j+1]==b[i][j])add(id[i-1][j+1],id[i][j],2);
					else if(b[i-1][j+1])add(id[i-1][j+1],id[i][j],3);
				}
				if(i>1&&j>1){
					if(b[i-1][j-1]==b[i][j])add(id[i-1][j-1],id[i][j],2);
					else if(b[i-1][j-1])add(id[i-1][j-1],id[i][j],3);
				}
				if(i<m&&j>1){
					if(b[i+1][j-1]==b[i][j])add(id[i+1][j-1],id[i][j],2);
					else if(b[i+1][j-1])add(id[i+1][j-1],id[i][j],3);
				}
				if(i<m&&j<m){
					if(b[i+1][j+1]==b[i][j])add(id[i+1][j+1],id[i][j],2);
					else if(b[i+1][j+1])add(id[i+1][j+1],id[i][j],3);
				}
			}
		}
	}
	dij();
	return 0;
}