本文共 1143 字，大约阅读时间需要 3 分钟。
#include #include #include #include #include #include #include #include #include #include #include #include #define MAXN 1010100#define LL long long#define fi first#define se second#define mp make_pair#define pb push_back#define ll __int64#define INF 0x7fffffff#define cs(s) freopen(s,"r",stdin)#define mem(x) memset(x,0,sizeof(x))#define PI acos(-1)#define eps 1e-10using namespace std;int gcd(int a,int b){ return b?gcd(b,a%b):a;}int lcm(int a,int b){ return a/gcd(a,b)*b;}LL powmod(LL a,LL b,LL MOD){ LL ans=1;while(b){ if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}//headconst int maxn=2021;int n,m,inq[maxn],dis[maxn];vector >v[maxn];int main(){ // freopen("in.txt","r",stdin); // freopen("out.txt","w",stdout); ios::sync_with_stdio(false); cin>>n>>m; for(int i=1;i<=n;i++){ int a,b,w; cin>>a>>b>>w; v[a].pb(mp(b,w)); v[b].pb(mp(a,w)); } queue p; p.push(1); inq[1]=1; for(int i=1;i<=max(n,m);i++)dis[i]=INF; dis[1]=0; while(!p.empty()){ int now=p.front(); p.pop(); inq[now]=0; for(int i=0;i
转载于:https://www.cnblogs.com/pubgoso/p/10759734.html