- 稠密图(m->n*n) 邻接矩阵 朴素dijkstra
- 稀疏图(m->n) 邻接表 堆优化dijkstra
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define lll __int128_t
using namespace std;
typedef long long ll;
const int N=510;
int n,m;
int g[N][N];//稠密图用邻接矩阵存边
int dist[N];
bool st[N];//是否确定最短路
int dijkstra()
{
mem(dist,0x3f);
dist[1]=0;
for(int i=0;i<n-1;i++)//n-1
{
int t=-1;
for(int j=1;j<=n;j++)//遍历所有点
{
if(!st[j]&&(t==-1||dist[t]>dist[j]))
t=j;
}
st[t]=1;
//用一到t的距离加上t到这条边
for(int j=1;j<=n;j++)
{
dist[j]=min(dist[j],dist[t]+g[t][j]);
}
}
//不能写0x3f
if(dist[n]==0x3f3f3f3f) return -1;
return dist[n];
}
int main()
{
// freopen("D:\\LYJ.txt","r",stdin);
cin>>n>>m;
mem(g,0x3f);
for(int i=0;i<m;i++)
{
int a,b,c;
cin>>a>>b>>c;
g[a][b]=min(g[a][b],c);
}
int t=dijkstra();
cout<<t;
return 0;
}
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define lll __int128_t
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int N=1e6;
int n,m;
int h[N],e[N],w[N],ne[N],inx;//稀疏图用邻接表存边
int dist[N];
bool st[N];//是否确定最短路
void add(int a,int b,int c)
{
e[inx]=b,w[inx]=c,ne[inx]=h[a],h[a]=inx++;
}
int dijkstra()
{
mem(dist,0x3f);
dist[1]=0;
priority_queue<PII,vector<PII>,greater<PII> > heap;
heap.push({0,1});
while(!heap.empty())
{
auto it=heap.top();
heap.pop();
int ver=it.second,distance=it.first;
if(st[ver]) continue;
st[ver]=1;
for(int i=h[ver];i!=-1;i=ne[i])
{
int j=e[i];
if(dist[j]>distance+w[i])
{
dist[j]=distance+w[i];
heap.push({dist[j],j});
}
}
}
if(dist[n]==0x3f3f3f3f) return -1;
return dist[n];
}
int main()
{
// freopen("D:\\LYJ.txt","r",stdin);
cin>>n>>m;
mem(h,-1);
for(int i=0;i<m;i++)
{
int a,b,c;
cin>>a>>b>>c;
add(a,b,c);
}
int t=dijkstra();
cout<<t;
return 0;
}
隔了九个月再写这道题还是自己写不出来QAQ
又学了一遍dijkstra
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define lll __int128_t
using namespace std;
typedef long long ll;
const int N=1e6;
int n,m,s,d;
int h[N],e[N],w[N],vv[N],ne[N],inx;
int dist[N],val[N];
bool st[N];
struct cmp
{
bool operator() (vector<int> a,vector<int> b)
{
if(a[1]==b[1]) return a[2]>b[2];
else return a[1]>b[1];
}
};
void add(int a,int b,int c,int d)
{
e[inx]=b,w[inx]=c,vv[inx]=d,ne[inx]=h[a],h[a]=inx++;
}
void dijkstra()
{
mem(dist,0x3f);
mem(val,0x3f);
dist[s]=0;
priority_queue<vector<int>,vector<vector<int> >,cmp > heap;
heap.push({s,0,0});
while(!heap.empty())
{
auto it=heap.top();
heap.pop();
int ver=it[0],distance=it[1],value=it[2];
if(st[ver]) continue;
for(int i=h[ver];i!=-1;i=ne[i])
{
int j=e[i];
if(dist[j]>distance+w[i])
{
dist[j]=distance+w[i];
val[j]=value+vv[i];
heap.push({j,dist[j],val[j]});
}
else if(dist[j]==distance+w[i]&&val[j]>value+vv[i])
{
val[j]=value+vv[i];
heap.push({j,dist[j],val[j]});
}
}
}
if(dist[d]==0x3f3f3f3f) cout<<-1;
else cout<<dist[d]<<" "<<val[d];
}
int main()
{
// freopen("D:\\LYJ.txt","r",stdin);
cin>>n>>m>>s>>d;
mem(h,-1);
while(m--)
{
int a,b,c,d;
cin>>a>>b>>c>>d;
add(a,b,c,d);
add(b,a,c,d);
}
dijkstra();
return 0;
}