BZOJ[4152][AMPPZ2014]The Captain Dijkstra
2018-02-10 15:44
399 查看
传送门ber~
发现只给xx挨着或yy挨着的连边就可以
因为最短的路径可以有这些拼出来
然后跑最短路
代码如下:
发现只给xx挨着或yy挨着的连边就可以
因为最短的路径可以有这些拼出来
然后跑最短路
代码如下:
#include<algorithm> #include<ctype.h> #include<cstdio> #include<queue> #define INF 2147483647 #define pii pair<int,int> #define mp make_pair #define N 200050 using namespace std; inline int read(){ int x=0,f=1;char c; do c=getchar(),f=c=='-'?-1:f; while(!isdigit(c)); do x=(x<<3)+(x<<1)+c-'0',c=getchar(); while(isdigit(c)); return x*f; } priority_queue<pii,vector<pii>,greater<pii> >q; int n,top; int fir ,dis ; bool b ; struct Edge{ int to,nex,k; Edge(int _=0,int __=0,int ___=0):to(_),nex(__),k(___){} }nex[N<<2]; struct Data{ int x,y,id; }a ; inline void add(int x,int y,int k){ nex[++top]=Edge(y,fir[x],k); fir[x]=top; } inline bool cmpx(Data a,Data b){ return a.x<b.x; } inline bool cmpy(Data a,Data b){ return a.y<b.y; } inline void Dijkstra(){ for(int i=2;i<=n;i++) dis[i]=INF; q.push(mp(dis[1]=0,1)); while(!q.empty()){ int x=q.top().second;q.pop(); if(b[x]) continue; b[x]=true; for(int i=fir[x];i;i=nex[i].nex) if(dis[nex[i].to]>dis[x]+nex[i].k){ dis[nex[i].to]=dis[x]+nex[i].k; q.push(mp(dis[nex[i].to],nex[i].to)); } } return; } int main(){ n=read(); for(int i=1;i<=n;i++){ a[i].x=read();a[i].y=read(); a[i].id=i; } sort(a+1,a+n+1,cmpx); for(int i=1;i<n;i++){ add(a[i].id,a[i+1].id,min(abs(a[i+1].x-a[i].x),abs(a[i+1].y-a[i].y))); add(a[i+1].id,a[i].id,min(abs(a[i+1].x-a[i].x),abs(a[i+1].y-a[i].y))); } sort(a+1,a+n+1,cmpy); for(int i=1;i<n;i++){ add(a[i].id,a[i+1].id,min(abs(a[i+1].x-a[i].x),abs(a[i+1].y-a[i].y))); add(a[i+1].id,a[i].id,min(abs(a[i+1].x-a[i].x),abs(a[i+1].y-a[i].y))); } Dijkstra(); printf("%d",dis ); return 0; }
相关文章推荐
- 循环队列+堆优化dijkstra最短路 BZOJ 4152: [AMPPZ2014]The Captain
- BZOJ 4152 [AMPPZ2014]The Captain 最短路题解
- BZOJ 4152: [AMPPZ2014]The Captain
- BZOJ 4152: [AMPPZ2014]The Captain 题解 【贪心】【SPFA】
- 【BZOJ】【4152】【AMPZZ2014】The Captain
- BZOJ 4152 [AMPPZ2014]The Captain dijkstra
- [BZOJ4152][AMPPZ2014]The Captain(堆优化dijkstra)
- 【堆优化Dijkstra】BZOJ4152- [AMPPZ2014]The Captain
- BZOJ 4152: [AMPPZ2014]The Captain( 最短路 )
- BZOJ 4152 The Captain (Dijkstra 堆优化)
- BZOJ 4152: [AMPPZ2014]The Captain(最短路)
- bzoj 4152: [AMPPZ2014]The Captain
- BZOJ 4152: [AMPPZ2014]The Captain 分层图最短路
- [BZOJ 4152] The Captain 最短路(Dijkstra版)
- 【BZOJ4145】[AMPPZ2014]The Prices 状压DP
- BZOJ 4145 AMPPZ2014 The Prices 状压DP
- bzoj4145 AMPPZ2014 The Prices 状压dp
- bzoj4152[AMPPZ2014] The Captain
- 【AMPPZ2014】【BZOJ4147】Euclidean Nim
- 【BZOJ】【4144】【AMPPZ2014】Petrol