car的旅行路线

program car; type ty=record c:array[1..4,1..2]of double; price:integer; end; var mininum:double; m:array[1..500,1..500]of double; ct:array[1..500]of ty; n,s,t,a,b:integer; i:longint; procedure initn; begin assign(input,'car.in'); reset(input); readln(n); end; procedure init; var i:integer; dis1,dis2,dis3:double; procedure swap(var num1,num2:double); var temp:double; begin temp:=num1; num1:=num2; num2:=temp; end; begin readln(s,t,a,b); for i:=1 to s do begin read(ct[i].c[1,1],ct[i].c[1,2],ct[i].c[2,1],ct[i].c[2,2],ct[i].c[3,1],ct[i].c[3,2],ct[i].price); dis1:=(sqrt(sqr(ct[i].c[1,1]-ct[i].c[2,1])+sqr(ct[i].c[1,2]-ct[i].c[2,2]))); dis2:=(sqrt(sqr(ct[i].c[1,1]-ct[i].c[3,1])+sqr(ct[i].c[1,2]-ct[i].c[3,2]))); dis3:=(sqrt(sqr(ct[i].c[2,1]-ct[i].c[3,1])+sqr(ct[i].c[2,2]-ct[i].c[3,2]))); if (dis1>dis2)and(dis1>dis3) then begin swap(ct[i].c[2,1],ct[i].c[3,1]); swap(ct[i].c[2,2],ct[i].c[3,2]); end; if (dis3>dis2)and(dis3>dis1) then begin swap(ct[i].c[1,1],ct[i].c[2,1]); swap(ct[i].c[1,2],ct[i].c[2,2]); end; ct[i].c[4,1]:=ct[i].c[1,1]+ct[i].c[3,1]-ct[i].c[2,1]; ct[i].c[4,2]:=ct[i].c[1,2]+ct[i].c[3,2]-ct[i].c[2,2]; end; fillchar(m,sizeof(m),0); end; procedure work; var i:integer; procedure ComputeTrainline; var i:integer; begin for i:=1 to s do begin m[(i-1)*4+1,(i-1)*4+2]:=ct[i].price*(sqrt(sqr(ct[i].c[1,1]-ct[i].c[2,1])+sqr(ct[i].c[1,2]-ct[i].c[2,2]))); m[(i-1)*4+1,(i-1)*4+3]:=ct[i].price*(sqrt(sqr(ct[i].c[1,1]-ct[i].c[3,1])+sqr(ct[i].c[1,2]-ct[i].c[3,2]))); m[(i-1)*4+1,(i-1)*4+4]:=ct[i].price*(sqrt(sqr(ct[i].c[1,1]-ct[i].c[4,1])+sqr(ct[i].c[1,2]-ct[i].c[4,2]))); m[(i-1)*4+2,(i-1)*4+1]:=m[(i-1)*4+1,(i-1)*4+2]; m[(i-1)*4+3,(i-1)*4+1]:=m[(i-1)*4+1,(i-1)*4+3]; m[(i-1)*4+4,(i-1)*4+4]:=m[(i-1)*4+1,(i-1)*4+4]; m[(i-1)*4+2,(i-1)*4+3]:=ct[i].price*(sqrt(sqr(ct[i].c[2,1]-ct[i].c[3,1])+sqr(ct[i].c[2,2]-ct[i].c[3,2]))); m[(i-1)*4+2,(i-1)*4+4]:=ct[i].price*(sqrt(sqr(ct[i].c[2,1]-ct[i].c[4,1])+sqr(ct[i].c[2,2]-ct[i].c[4,2]))); m[(i-1)*4+3,(i-1)*4+2]:=m[(i-1)*4+2,(i-1)*4+3]; m[(i-1)*4+4,(i-1)*4+2]:=m[(i-1)*4+2,(i-1)*4+4]; m[(i-1)*4+3,(i-1)*4+4]:=ct[i].price*(sqrt(sqr(ct[i].c[3,1]-ct[i].c[4,1])+sqr(ct[i].c[3,2]-ct[i].c[4,2]))); m[(i-1)*4+4,(i-1)*4+3]:=m[(i-1)*4+3,(i-1)*4+4]; end; end; procedure ComputeAirline; var i,j:integer; cityi,cityj,posi,posj:integer; begin for i:=1 to s*4 do for j:=1 to s*4 do if (j-(j mod 4))=(i-(i mod 4)) then continue else begin cityi:=i div 4; posi:=i mod 4; if i mod 4=0 then begin inc(cityi); inc(posi); end; cityj:=j div 4; posj:=j mod 4; if j mod 4=0 then begin inc(cityj); inc(posi); end; m[i,j]:=t*round(sqrt(sqr(ct[cityi].c[posi,1]-ct[cityj].c[posj,1])+sqr(ct[cityi].c[posi,2]-ct[cityj].c[posj,2]))); end; end; procedure Dijkstra(pt:integer); var bool:array[1..400]of boolean; lin:array[1..400]of double; que:Array[1..400]of integer; i,j:longint; min:double; minpt:longint; begin min:=maxlongint; fillchar(bool,sizeof(bool),true); for i:=1 to s*4 do lin[i]:=maxlongint; bool[pt]:=false; lin[pt]:=0; t:=1; que[t]:=pt; for i:=2 to s*4 do begin for j:=1 to t do if (m[que[j],i]+lin[j]<lin[i])and(bool[i]=true) then begin lin[i]:=lin[j]+m[que[j],i]; if lin[i]<min then begin min:=lin[i]; minpt:=i; end; end; inc(t); que[t]:=minpt; bool[minpt]:=false; end; if mininum>lin[(b-1)*4+1] then mininum:=lin[(b-1)*4+1]; if mininum>lin[(b-1)*4+2] then mininum:=lin[(b-1)*4+2]; if mininum>lin[(b-1)*4+3] then mininum:=lin[(b-1)*4+3]; if mininum>lin[(b-1)*4+4] then mininum:=lin[(b-1)*4+4]; end; begin mininum:=maxlongint; ComputeTrainline; ComputeAirline; for i:=1 to 4 do Dijkstra((a-1)*4+i); end; procedure print; begin writeln(mininum); end;begin initn; assign(output,'car.out'); rewrite(output); for i:=1 to n do begin init; work; print; end; close(output); close(input);end.