zoj 2281 Way to Freedom(最短路加强版)

刚开始一看，哎，这应该是最大流吧，后来一想，以前做过一道一样的，就去做了 = =。。用Dijkstra。

 

点10W，用邻接表存。用最朴素的dijkstra，TLE了。 = =。。

 

好吧，用优先队列。学习了优先队列排结构体的方法，重载比较函数。

 

SF。 = =。好吧。我用dij+heap。以前写fire station的时候就用这个了。写完之后，SF。去死 = =。。

 

方法神马的有看了看，改动了点。终于改成WA而不是SF了 = =。。党也去写这个了，用优先队列，过了 = =。

 

对比了一下，= =。。似乎知道哪错了。我没有判断队列是否为空就top()了，改了之后，AC了 = =。。

 

dij+heap，加了个维护操作，如果已经在堆里，而且更新了，是需要维护堆的 = =。。我去。。1857我可没维护就A了 = =。。。

 

优先队列+比较函数重载

 

#include <stdio.h> #include <stdlib.h> #include <iostream> #include <string.h> #include <limits.h> #include <queue> #define MAX 100010 using namespace std; typedef struct ROOM{ int num; int w; ROOM *next; }ROOM; typedef struct DIS{ int w; int num; }DIS; bool operator<(DIS a,DIS b) { return a.w < b.w; } priority_queue<DIS> q; ROOM *r[MAX],node[MAX*20],*head; int cou,n,m; void init() { cou = 0; memset(r,'/0',sizeof(r)); memset(node,'/0',sizeof(node)); } void Build(int from,int to,int w) { node[cou].num = to; node[cou].w = w; node[cou].next = r[from]; r[from] = &node[cou++]; } int Dijkstra(int s,int to) { int used[MAX],now,i,k,num; DIS dis[MAX]; for(i=1; i<=n; i++) { used[i] = 0; dis[i].num = i; dis[i].w = 0; } dis[s].w = INT_MAX; now = s; used[s] = 1; for(i=1; i<n; i++) { head = r[now]; while( head != NULL ) { num = head->num; int len = dis[now].w < head->w ? dis[now].w : head->w; if( dis[num].w < len ) { dis[num].w = len; q.push(dis[num]); } head = head->next; } DIS tmp; while( !q.empty() ) { tmp = q.top(); q.pop(); if( used[tmp.num] == 1 ) continue; break; } used[tmp.num] = 1; now = tmp.num; } while( !q.empty() ) q.pop(); return dis[to].w; } int main() { int from,to,a,b,w,ans; while( scanf("%d%d",&n,&m) != EOF ) { init(); while( m-- ) { scanf("%d%d%d",&a,&b,&w); Build(a,b,w); Build(b,a,w); } scanf("%d%d",&from,&to); ans = Dijkstra(from,to); printf("%d/n",ans); } return 0; }  

 

优先队列+神马MAP里面的函数？？不懂。。学习党的。。

#include <stdio.h> #include <stdlib.h> #include <iostream> #include <string.h> #include <limits.h> #include <queue> #define MAX 100001 using namespace std; typedef struct ROOM{ int num; int w; ROOM *next; }ROOM; ROOM *r[MAX],node[MAX*20],*head; typedef pair<int,int> pii; priority_queue<pii> q; int cou,n,m; void init() { cou = 0; memset(r,'/0',sizeof(r)); memset(node,'/0',sizeof(node)); } void Build(int from,int to,int w) { node[cou].num = to; node[cou].w = w; node[cou].next = r[from]; r[from] = &node[cou++]; } int Dijkstra(int s,int to) { int dis[MAX],used[MAX]; int min,now,i,k,num,len; memset(used,0,sizeof(used)); memset(dis,0,sizeof(dis)); dis[s] = INT_MAX; now = s; used[s] = 1; for(i=1; i<n; i++) { head = r[now]; while( head != NULL ) { num = head->num; len = dis[now] < head->w ? dis[now] : head->w; if( dis[num] < len ) { dis[num] = len; q.push(make_pair(dis[num],num)); } head = head->next; } pii tmp; while( !q.empty() ) { tmp = q.top(); q.pop(); if( used[tmp.second] == 1 ) continue; break; } used[tmp.second] = 1; now = tmp.second; } while( !q.empty() ) q.pop(); return dis[to]; } int main() { int from,to,a,b,w,ans; while( scanf("%d%d",&n,&m) != EOF ) { init(); while( m-- ) { scanf("%d%d%d",&a,&b,&w); Build(a,b,w); Build(b,a,w); } scanf("%d%d",&from,&to); ans = Dijkstra(from,to); printf("%d/n",ans); } return 0; }  

 

dij+heap

#include <stdio.h> #include <stdlib.h> #include <iostream> #include <string.h> #include <limits.h> #define MAX 100010 using namespace std; typedef struct ROOM{ int num; int w; ROOM *next; }ROOM; typedef struct DIS{ int w; int num; }DIS; ROOM *r[MAX]; int cou,n,m; int pre[MAX],heapsize; DIS dis[MAX*10]; void init() { heapsize = 0; memset(r,'/0',sizeof(r)); memset(dis,'/0',sizeof(dis)); } void Build(int from,int to,int w) { ROOM *node = (ROOM*)malloc(sizeof(ROOM)); node->num = to; node->w = w; node->next = r[from]; r[from] = node; } void heapsort(int i) { int r,l,larg; while(1) { l = i<<1; r = l+1; if( l <= heapsize && dis[l].w > dis[i].w ) larg = l; else larg = i; if( r <= heapsize && dis[r].w > dis[larg].w ) larg = r; if( i != larg ) { pre[dis[i].num] = larg; pre[dis[larg].num] = i; swap( dis[i],dis[larg] ); i = larg; } else break; } } void heapwei(int i) { int parent; while( i > 1 ) { parent = i>>1; if( dis[i].w > dis[parent].w ) { pre[dis[i].num] = parent; pre[dis[parent].num] = i; swap(dis[i],dis[parent]); i = parent; } else break; } } void Insert( DIS a ) { int parent,i; heapsize++; dis[heapsize] = a; i = heapsize; heapwei(i); } void Delet() { pre[dis[heapsize].num] = 1; dis[1] = dis[heapsize]; heapsize--; heapsort(1); } int Dijkstra(int s,int to) { int used[MAX],now,i,k,num,inq[MAX]; int dist[MAX]; ROOM *head; DIS tmp; for(i=1; i<=n; i++) used[i] = inq[i] = dist[i] = 0; now = s; used[s] = 1; inq[s] = 1; dist[s] = INT_MAX; tmp.num =s; tmp.w = INT_MAX; Insert(tmp); pre[s] = heapsize; for(i=1; i<=n; i++) { head = r[now]; while( head != NULL ) { num = head->num; if( !used[num] ) { int len = dist[now] < head->w ? dist[now] : head->w; if( len > dist[num] ) { dist[num] = len; if( inq[num] == 1 ) { dis[pre[num]].w = dist[num]; heapwei(pre[num]); } else { tmp.num = num; tmp.w = dist[num]; Insert(tmp); pre[num] = heapsize; inq[num] = 1; } } } head = head->next; } now = dis[1].num; used[now] = 1; Delet(); } return dist[to]; } int main() { int from,to,a,b,w,ans; while( scanf("%d%d",&n,&m) != EOF ) { init(); while( m-- ) { scanf("%d%d%d",&a,&b,&w); Build(a,b,w); Build(b,a,w); } scanf("%d%d",&from,&to); ans = Dijkstra(from,to); printf("%d/n",ans); } return 0; }