BZOJ 2100 [Usaco2010 Dec]Apple Delivery 最短路
来源:互联网 发布:anaconda python 3.5 编辑:程序博客网 时间:2024/06/07 13:25
Description
Bessie has two crisp red apples to deliver to two of her friends in the herd. Of course, she travels the C (1 <= C <= 200,000) cowpaths which are arranged as the usual graph which connects P (1 <= P <= 100,000) pastures conveniently numbered from 1..P: no cowpath leads from a pasture to itself, cowpaths are bidirectional, each cowpath has an associated distance, and, best of all, it is always possible to get from any pasture to any other pasture. Each cowpath connects two differing pastures P1_i (1 <= P1_i <= P) and P2_i (1 <= P2_i <= P) with a distance between them of D_i. The sum of all the distances D_i does not exceed 2,000,000,000. What is the minimum total distance Bessie must travel to deliver both apples by starting at pasture PB (1 <= PB <= P) and visiting pastures PA1 (1 <= PA1 <= P) and PA2 (1 <= PA2 <= P) in any order. All three of these pastures are distinct, of course. Consider this map of bracketed pasture numbers and cowpaths with distances: If Bessie starts at pasture [5] and delivers apples to pastures [1] and [4], her best path is: 5 -> 6-> 7 -> 4* -> 3 -> 2 -> 1* with a total distance of 12.
CLJ要从Pb点(家)出发,既要去Pa1点NOI赛场拿金牌,也要去Pa2点CMO赛场拿金牌。(途中不必回家)
可以先去NOI,也可以先去CMO。
当然神犇CLJ肯定会使总路程最小,输出最小值。
Input
* Line 1: Line 1 contains five space-separated integers: C, P, PB, PA1, and PA2 * Lines 2..C+1: Line i+1 describes cowpath i by naming two pastures it connects and the distance between them: P1_i, P2_i, D_i
Output
* Line 1: The shortest distance Bessie must travel to deliver both apples
Sample Input
5 1 7
6 7 2
4 7 2
5 6 1
5 2 4
4 3 2
1 2 3
3 2 2
2 6 3
Sample Output
HINT
求翻译.........站内PM我吧.........
传送门
n年前……好吧其实是1年前,
普及组准备赛里面做到过一毛一样的题……
现在会了10^5级别效率也好的各种最短路当然轻松水过了……
当时还打的P,,学了个dijkstra+优先队列很得瑟,
pascal里面映射啥啥打了一大堆;
还写了一批注释(汗..)
其实C++STL直接乱搞解决啊……
可是懒了,就来了发P.
var u,v,w,TP,C,P,PA1,PA2,PB,i,Len1,Len2,Len3,ans:longint; next,head,son,value:array[0..400001] of longint; //下一条、头边、子点、值 dis,heap,intoout,outtoin:array[0..100001] of longint; //distance、堆、内映射外、外映射内 visit:array[0..100001] of boolean; //访问procedure swap(var a,b:longint);var t:longint;begin t:=a; a:=b; b:=t;end;procedure add(u,v,w:longint);begin inc(Len1); next[Len1]:=head[u]; head[u]:=Len1; son[Len1]:=v; value[Len1]:=w; //连边表end;procedure up(x:longint);begin while (x>1)and(heap[x>>1]>heap[x]) do begin swap(heap[x>>1],heap[x]); swap(intoout[x>>1],intoout[x]); swap(outtoin[intoout[x>>1]],outtoin[intoout[x]]); x:=x>>1; end;end; //从下往上放元素procedure down(x:longint);var Tson:longint;begin heap[1]:=heap[TP]; intoout[1]:=intoout[TP]; outtoin[intoout[1]]:=1; dec(TP); while (x<<1<=TP) do begin if (x<<1+1>TP)or (heap[x<<1]<heap[x<<1+1]) then Tson:=x<<1 else Tson:=x<<1+1; if heap[Tson]<heap[x] then begin swap(heap[x],heap[Tson]); swap(intoout[x],intoout[Tson]); swap(outtoin[intoout[x]],outtoin[intoout[Tson]]); x:=Tson; end else break; end;end; //从上往下整堆procedure Dijkstra(start,goal:longint;var Len:longint);var i,minP,Near_S:longint;begin for i:=1 to P do begin outtoin[i]:=i; intoout[i]:=i; //堆内外映射 heap[i]:=maxlongint div 3; dis[i]:=maxlongint div 3; visit[i]:=true; //初始化 end; heap[start]:=0; up(start); //初始建堆 TP:=P; while (visit[goal])and(TP>0) do begin minP:=intoout[1]; dis[minP]:=heap[1]; visit[minP]:=false; Near_S:=head[minP]; //堆首元素 down(1); //整堆 while Near_S<>0 do //找相邻边Near Side begin if (visit[son[Near_S]])and (value[Near_S]+dis[minP]<heap[outtoin[son[Near_S]]]) then begin heap[outtoin[son[Near_S]]]:=value[Near_S]+dis[minP]; //更新堆内元素 up(outtoin[son[Near_S]]); end; Near_S:=next[Near_S]; //下一条 end; end; Len:=dis[goal]; //取值end;begin readln(C,P,PB,PA1,PA2); Len1:=0; for i:=1 to C do begin readln(u,v,w); add(u,v,w); add(v,u,w); //双向记边 end; Dijkstra(PB,PA1,Len1);//PB->PA1 Dijkstra(PB,PA2,Len2); //PB->PA2 Dijkstra(PA1,PA2,Len3); //PA1->PA2 if Len1>Len2 then ans:=Len2+Len3 else ans:=Len1+Len3; //比较 writeln(ans);end.
- BZOJ 2100 [Usaco2010 Dec]Apple Delivery 最短路
- 【bzoj2100】[Usaco2010 Dec]Apple Delivery 最短路
- bzoj2100 [Usaco2010 Dec]Apple Delivery
- BZOJ2100: [Usaco2010 Dec]Apple Delivery Spfa+优化
- bzoj2100 [Usaco2010 Dec]Apple Delivery(slf优化的spfa)
- BZOJ 2100 Apple Delivery
- BZOJ 2101: [Usaco2010 Dec]Treasure Chest 藏宝箱
- BZOJ 3891 USACO 2014 Dec Piggy Back 搜索 最短路
- BZOJ 2097: [Usaco2010 Dec]Exercise 奶牛健美操 二分 贪心
- BZOJ 2097 [Usaco2010 Dec]Exercise 奶牛健美操 二分
- BZOJ 1671: [Usaco2005 Dec]Knights of Ni 骑士 分层图最短路
- Usaco2010 Dec Treasure Chest
- Usaco2010 Dec Treasure Chest
- BZOJ 2125 最短路.
- bzoj 2662(最短路)
- BZOJ-4152-最短路
- BZOJ 2125 最短路
- bzoj 2407 最短路
- 递归之二分查找
- 石子合并-OJ
- ubuntu 下linux 常用命令
- 51nod1027---大数乘法(51nod基础:乘法模拟)
- D_D系统构建-MBR(8)filesystem.inc代码整改适配32位(附提供当前整个开发目录文件)
- BZOJ 2100 [Usaco2010 Dec]Apple Delivery 最短路
- The RT Patch---what needs to be done to get it into Mainline ---Steven Rostedt
- 汉诺塔
- C++中static、const、static const修饰变量作用详解
- 文章标题
- Logstash插件filter介绍及ELK相关预警配置
- 识别浏览器的方法
- POJ.1321 棋盘问题 (DFS)
- 第五章 神经网络