1041 Car的旅行路线

2001年NOIP全国联赛提高组

分类标签 Tags 点此展开

#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
#define N 110
struct node{int x,y,id;node(int x=0,int y=0,int id=0):x(x),y(y),id(id){}
}e[N*4];
double g[N][N];
int n,fly,T,a,b,car[N];
double dis(int p,int q){//return sqrt((double)(f(e[p].x-e[q].x)+f(e[p].y-e[q].y)));//sqrt不支持多重运算 int xx=e[p].x-e[q].x;int yy=e[p].y-e[q].y;return sqrt(xx*xx+yy*yy);
}
double dis1(int p,int q){int xx=e[p].x-e[q].x;int yy=e[p].y-e[q].y;return xx*xx+yy*yy;
}
node cal(int k1,int k2,int k3,int id)//处理第四个点,因为第四个点的位置不一定在哪里--要枚举下
{double d12=dis1(k1,k2),d13=dis1(k1,k3),d23=dis1(k2,k3);if(d12==d13+d23){int dx=e[k3].x-e[k1].x;int dy=e[k3].y-e[k1].y;return node(e[k2].x-dx,e[k2].y-dy,id);}if(d23==d12+d13){int dx=e[k1].x-e[k2].x;int dy=e[k1].y-e[k2].y;return node(e[k3].x-dx,e[k3].y-dy,id);}int dx=e[k2].x-e[k1].x;int dy=e[k2].y-e[k1].y;return node(e[k3].x-dx,e[k3].y-dy,id);
}
int main(){scanf("%d",&T);while(T--){scanf("%d%d%d%d",&n,&fly,&a,&b);for(int i=1;i<=n;i++){int k1=(i-1)*4+1,k2=k1+1,k3=k1+2,k4=k1+3;scanf("%d%d%d%d%d%d%d",&e[k1].x,&e[k1].y,&e[k2].x,&e[k2].y,&e[k3].x,&e[k3].y,&car[i]);e[k1].id=e[k2].id=e[k3].id=i;e[k4]=cal(k1,k2,k3,i); }for(int i=1;i<=4*n;i++){for(int j=1;j<=4*n;j++){g[i][j]=1e6;}}for(int i=1;i<=4*n;i++){for(int j=1;j<=4*n;j++){if(e[i].id==e[j].id){g[i][j]=min(g[i][j],dis(i,j)*car[e[i].id]);}else{g[i][j]=min(g[i][j],dis(i,j)*fly);}}}for(int i=1;i<=4*n;i++) g[i][i]=0;for(int k=1;k<=4*n;k++){for(int i=1;i<=4*n;i++){for(int j=1;j<=4*n;j++){if(i!=j&&i!=k&&j!=k){g[i][j]=min(g[i][j],g[i][k]+g[k][j]);}}}}double ans=0x3f3f3f3f;for(int i=a*4-3;i<=a*4;i++){for(int j=b*4-3;j<=b*4;j++){ans=min(ans,g[i][j]);}}printf("%.1lf\n",ans);}return 0;
}

#include<iostream>
#include<cstdio>
using namespace std;
#define inf 1e6
int x[10],y[10];
int n,m,t,k,x1,y1,x2,y2;
int a,b;
int f[120][120];
int main()
{cin>>n>>m>>t>>k;for(int i=1;i<=n;i++)cin>>x[i];for(int i=1;i<=m;i++)cin>>y[i];for(int i=1;i<=n*m;i++)for(int j=1;j<=n*m;j++){if(i==j)f[i][j]=0;else f[i][j]=inf; } for(int i=1;i<=n;i++)//又是离散化 for(int j=1;j<=m;j++){if(i>1)f[(j-1)*n+i][(j-1)*n+i-1]=x[i]-x[i-1];if(j>1)f[(j-1)*n+i][(j-2)*n+i]=y[j]-y[j-1];if(i<n)f[(j-1)*n+i][(j-1)*n+i+1]=x[i+1]-x[i];if(j<m)f[(j-1)*n+i][j*n+i]=y[j+1]-y[j];}for(int i=1;i<=t;i++){cin>>x1>>y1>>x2>>y2;f[(y1-1)*n+x1][(y2-1)*n+x2]=inf;f[(y2-1)*n+x2][(y1-1)*n+x1]=inf;}for(int i=1;i<=k;i++){cin>>x1>>x2>>y1>>y2;for( a=x1;a<=x2-1;a++)for( b=y1+1;b<=y2-1;b++){f[(b-1)*n+a][(b-1)*n+a+1]=inf;f[(b-1)*n+a+1][(b-1)*n+a]=inf;} for( b=y1;b<=y2-1;b++)for( a=x1+1;a<=x2-1;a++){f[(b-1)*n+a][b*n+a]=inf;f[b*n+a][(b-1)*n+a]=inf;}}    for(int k=1;k<=n*m;k++)for(int i=1;i<=n*m;i++)for(int j=1;j<=n*m;j++)f[i][j]=min(f[i][k]+f[k][j],f[i][j]);cin>>x1>>y1>>x2>>y2;cout<<f[(y1-1)*n+x1][(y2-1)*n+x2];return 0;
}