#include <bits/stdc++.h> using namespace std; int main(){ }

#include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int n,m,dist[N],mk[N];
struct node{
    int d,qz;
};
vector<node>v[N];
void Dijkstra(){
    for(int i=1;i<=n;i++)dist[i]=1e9;
    dist[1]=0;
    for(int i=1;i<=n;i++){
        int md=1e9+1,x;
        for(int j=1;j<=n;j++){
            if(mk[j]==0 && dist[j]<md) md=dist[j],x=j;
        }
        mk[x]=1;
        for(int i=0;i<v[x].size();i++){
            int xx=v[x][i].d;
            if(dist[xx]>dist[x]+v[x][i].qz)dist[xx]=dist[x]+v[x][i].qz;
        }
    }
}
int main(){
    cin>>n>>m;
    while(m--){
        int x,y,z;
        cin>>x>>y>>z;
        v[x].push_back({y,z});
    }
    Dijkstra();
    if(dist[n];
    return 0;
}

|

#include<bits/stdc++.h> using namespace std; int main(){ } https://ac.xiaosaima.com/d/CQ05_23034/homework/67b920677988d049ca1693dd

摸鱼人的小仓库 http://www.staggeringbeauty.com/ 大虫子 https://www.ak-ioi.com/apps/oi-2048/ 华容道 chrome://dino/ 小恐龙 https://littlealchemy2.com/ 小小炼金师 https://2048game.com/ 数字组 https://dimit.me/Fe26/index_zh_CN.html 死铁 http://www.4399.com/ 4399 https://www.mazegenerator.net/ 迷宫 https://lewan.baidu.com/rankland?idfrom=5056&gameSource=mini&gameType=0 百度游戏 [https://deepmess.com/namerena/]名字竞技场 https://poki.com/zh/g/car-machines

ev.io 枪战游戏 https://www.crazygames.com/game/air-wars-2 飞机 https://www.crazygames.com/game/kirka-io 枪战 image image

#include<bits/stdc++.h>
using namespace std;
const int N=1100;
struct node{
	int x,y;
};
int n,m,qx,qy,zx,zy,dist[N][N],v[N][N],cnt;
int dx[]={1,1,2,2,-1,-1,-2,-2};
int dy[]={-2,2,-1,1,-2,2,1,-1};
void BFS(){
	memset(dist,-1,sizeof dist);
	queue<node> q;
	q.push({qx,qy}); 
	v[qx][qy]=1;
	dist[qx][qy]=0;
	while(q.size()){
		node x=q.front();
		for(int i=0;i<=7;i++){
			int xx=x.x+dx[i];
			int yy=x.y+dy[i];
			if(xx>=1 && xx<=n && yy>=1 && yy<=m && v[xx][yy]==0){
				q.push({xx,yy});
				dist[xx][yy]=dist[x.x][x.y]+1;
				v[xx][yy]=1;
			}
		} 
		q.pop();
	}
} 
int main(){
	cin>>n>>m>>qx>>qy;
	BFS();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cout<<left<<setw(5)<<dist[i][j];
		}
		cout<<endl;
	}
	return 0; 
} 

file:///C:/Users/XMW/Desktop/avatar.png

#include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int n,m,dist[N],mk[N];
struct node{
    int d,qz;
};
vector<node>v[N];
void Dijkstra(){
    for(int i=1;i<=n;i++)dist[i]=1e9;
    dist[1]=0;
    for(int i=1;i<=n;i++){
        int md=1e9+1,x;
        for(int j=1;j<=n;j++){
            if(mk[j]==0 && dist[j]<md) md=dist[j],x=j;
        }
        mk[x]=1;
        for(int i=0;i<v[x].size();i++){
            int xx=v[x][i].d;
            if(dist[xx]>dist[x]+v[x][i].qz)dist[xx]=dist[x]+v[x][i].qz;
        }
    }
}
int main(){
    cin>>n>>m;
    while(m--){
        int x,y,z;
        cin>>x>>y>>z;
        v[x].push_back({y,z});
    }
    Dijkstra();
    if(dist[n]==1e9)cout<<-1;
    else cout<<dist[n];
    return 0;
}