最短路dijkstra复习记
学完文化课,最短路都忘了,我实在是太蒟蒻了。
dijkstra
毕竟是个人最喜欢的最短路算法,哎,当年打的贼快,现在。。。。。
读入就以洛谷为模板P3371 【模板】单源最短路径(弱化版)
先贴一波代码。。。。
#include<bits/stdc++.h>
#define mid ((l+r)>>1)
#define REP(i,a,b) for (register int i(a);i<=(b);++i)
#define MOD 0x7f7f7f7f
#define hehehehe 0x7f7f7f7f
using namespace std;
template <typename A,typename B>
void inc(A &x,B y){x+=y;if (x>MOD) x-=MOD;}
inline int fpow(int x,int k){int r=1;for(;k;k>>=1,x=1ll*x*x%MOD)if(k&1)r=1ll*x*r%MOD;return r;}
template <typename C,typename D>
int maxn(C x,D y){return (x>=y)?x:y;}
template <typename E,typename F>
int minn(E x,F y){return (x<=y)?x:y;}
template <typename G,typename H>
void swapp(G x,H y){int t(x); x=y;y=t;}
template <typename T>
int read(T &x) {
x=0; char c=getchar(); int f=1;
for (;!isdigit(c);c=getchar()){if (c=='-') f=-f;}
for (;isdigit(c);c=getchar()){x=x*10+c-'0';x*=f;}
if (c=='\n') return 1;else return 0;}
int n,m,s,vis[300010];int dist[2][100100],head[300000],cnt;
struct tem{int num,pla;};
bool operator <(tem a,tem b){
return a.num>b.num;}
struct node{int head,next,wort;}graph[800000];
void addeag(int x,int y,int z){
++cnt; graph[cnt].head=head[x]; head[x]=cnt; graph[cnt].next=y; graph[cnt].wort=z;
}
void diji(int type,int x){
tem ui; ui.num=0; ui.pla=x;
priority_queue <tem> q; q.push(ui); dist[type][x]=0;
while(!q.empty()){
tem now; now=q.top(); q.pop(); int xx=now.num; int yy=now.pla;
if (vis[yy]) continue; vis[yy]=1;
for (int i=head[yy];i;i=graph[i].head){
int y=graph[i].next;
if (vis[y]) continue;
if (dist[type][y]>(xx+graph[i].wort)){
dist[type][y]=xx+graph[i].wort;
tem hehe; hehe.num=dist[type][y]; hehe.pla=y;
q.push(hehe);}}}}
int main(){
read(n);read(m);read(s);
memset(dist,hehehehe,sizeof(dist));
REP(i,1,m) {
int x,y,z; cin>>x>>y>>z; addeag(x,y,z);}
diji(1,s);
for (int i=1; i<=n; ++i) if (dist[1][i]!=hehehehe) cout<<dist[1][i]<<" "; else cout<<"2147483647 ";
}
回来审视这个代码,除了开头太无语,有种不成熟的感觉,其他应该还行。
下面是思想
(下面内附个人素质评价文件ppt,为了让一群不懂c++是啥的人听懂,所以可能有些言语,额,你知道的。)
思想环节
时间复杂度:
对每一个点,我们在这里需要的是扫描每一个点,这样的话简直是浪费,如果有个东西可以将O(n)转化为log级别的那就完美了
这里就是要priority_queue出场了,优先队列,c++都不用手写堆,不用他用谁。
就是在这里
priority_queue <tem> q; q.push(ui); dist[type][x]=0;
while(!q.empty()){
tem now; now=q.top(); q.pop(); int xx=now.num; int yy=now.pla;
if (vis[yy]) continue; vis[yy]=1;
for (int i=head[yy];i;i=graph[i].head){
int y=graph[i].next;
if (vis[y]) continue;
if (dist[type][y]>(xx+graph[i].wort)){
dist[type][y]=xx+graph[i].wort;
tem hehe; hehe.num=dist[type][y]; hehe.pla=y;
q.push(hehe);}}}
下附程序详细解析
#include<bits/stdc++.h>
#define mid ((l+r)>>1)
#define REP(i,a,b) for (register int i(a);i<=(b);++i)
#define MOD 0x7f7f7f7f
#define hehehehe 0x7f7f7f7f
using namespace std;
template <typename A,typename B>
void inc(A &x,B y){x+=y;if (x>MOD) x-=MOD;}
inline int fpow(int x,int k){int r=1;for(;k;k>>=1,x=1ll*x*x%MOD)if(k&1)r=1ll*x*r%MOD;return r;}
template <typename C,typename D>
int maxn(C x,D y){return (x>=y)?x:y;}
template <typename E,typename F>
int minn(E x,F y){return (x<=y)?x:y;}
template <typename G,typename H>
void swapp(G x,H y){int t(x); x=y;y=t;}
template <typename T>
int read(T &x) {
x=0; char c=getchar(); int f=1;
for (;!isdigit(c);c=getchar()){if (c=='-') f=-f;}
for (;isdigit(c);c=getchar()){x=x*10+c-'0';x*=f;}
if (c=='\n') return 1;else return 0;}
int n,m,s,vis[300010];int dist[2][100100],head[300000],cnt;
struct tem{int num,pla;}; //num表示到这个pla这个编号的点的距离,以用来比较
bool operator <(tem a,tem b){
return a.num>b.num;} //对tem类型单独进行运算符重载(不然优先队列不知道对于tem类型如何比较大小)
struct node{int head,next,wort;}graph[800000];//head表示连他来的边,next表示下一个点,wort表
//示这条边的长度,其实带上一个father更完整一点,但这里没必要
void addeag(int x,int y,int z){
++cnt; graph[cnt].head=head[x]; head[x]=cnt; graph[cnt].next=y; graph[cnt].wort=z;
} //用前向星来将图储存下来。当然如果你想用二维表,我也不反对,各有各的优点。
void diji(int type,int x){
tem ui; ui.num=0; ui.pla=x; //新设一个变量来记录开头当然也可以直接读入,
//但我记得有个版本的c++不支持,所以基本不敢用
priority_queue <tem> q; q.push(ui); dist[type][x]=0; //dist的type表示的是是开头到x的距离还是结
//尾到x的距离,有些题目需要两次dij,模板通用。
while(!q.empty()){
tem now; now=q.top(); q.pop(); int xx=now.num; int yy=now.pla;//这里注意pop
if (vis[yy]) continue; vis[yy]=1; //为了防止再次扫描一个点,我没要vis一下
for (int i=head[yy];i;i=graph[i].head){
int y=graph[i].next;
if (vis[y]) continue;
if (dist[type][y]>(xx+graph[i].wort)){
dist[type][y]=xx+graph[i].wort;
tem hehe; hehe.num=dist[type][y]; hehe.pla=y;
q.push(hehe);}}}}
int main(){
read(n);read(m);read(s);
memset(dist,hehehehe,sizeof(dist));
REP(i,1,m) {
int x,y,z; cin>>x>>y>>z; addeag(x,y,z);}
diji(1,s);
for (int i=1; i<=n; ++i) if (dist[1][i]!=hehehehe) cout<<dist[1][i]<<" "; else cout<<"2147483647 ";
}
完结散花。。。。。。。。。
最短路的题目,某谷上烂大街了,所以就不推荐题目了,(毕竟都忘了。。。)
THE END