帮帮我吧,调了1个小时还是不对
查看原帖
帮帮我吧,调了1个小时还是不对
952033
lutaoquan2012楼主2025/1/15 15:52

样例输出45.7

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll T,n,t,A,B,x,y,xx,yy,x3,y3,x4,y4,val,tot,id[100010],vis[100010];
double dis[1010][1010];
double su(ll x,ll y,ll a,ll b){return sqrt((x-a)*(x-a)+(y-b)*(y-b));}
struct node{
	ll v;
	double w;
};
vector<node> v[100010];
struct B{
	ll x,y;
}iid[100010];
double dijistra(ll s){
	for(int i=1;i<=tot;i++)
		for(int j=1;j<=tot;j++) dis[i][j]=0x3f3f3f3f;
	for(int i=1;i<=tot;i++)
		for(int j=0;j<v[i].size();j++)
			dis[i][v[i][j].v]=min(dis[i][v[i][j].v],v[i][j].w),dis[v[i][j].v][i]=min(dis[v[i][j].v][i],v[i][j].w);
	for(int k=1;k<=tot;k++) 
		for(int i=1;i<=tot;i++)
			for(int j=1;j<=tot;j++) dis[i][j]=min(dis[i][k]+dis[k][j],dis[i][j]);
	return min(dis[s][id[B]],min(dis[s][id[B]+1],min(dis[s][id[B]+2],dis[s][id[B]+3])));
}
int main(){
	cin>>T;
	while(T--){
		cin>>n>>t>>A>>B;
		tot=0;
		for(int i=1;i<=n;i++) v[i].clear();
		for(int i=1;i<=n;i++){
			cin>>x>>y>>xx>>yy>>x3>>y3>>val;
			double l1=su(x,y,xx,yy),l2=su(x,y,x3,y3),l3=su(xx,yy,x3,y3);
			++tot,id[i]=tot,tot+=3;
			if(l1>l2&&l1>l3){
				x4=x+xx-x3,y4=y+yy-y3;
				v[id[i]].push_back({id[i]+1,l1});
				v[id[i]+1].push_back({id[i],l1});
			}else if(l2>l1&&l2>l3){
				x4=x+x3-xx,y4=y+y3-yy;
				v[id[i]].push_back({id[i]+2,l2});
				v[id[i]+2].push_back({id[i],l2});
			}else if(l3>l1&&l3>l2){
				x4=xx+x3-x,y4=yy+y3-y;
				v[id[i]+1].push_back({id[i]+2,l3});
				v[id[i]+2].push_back({id[i]+1,l3});
			}
			iid[id[i]]={x,y},iid[id[i]+1]={xx,yy},iid[id[i]+2]={x3,y3},iid[id[i]+3]={x4,y4};
			for(int j=id[i];j<=tot;j++)
				for(int k=id[i];k<=tot;k++)
					if(j!=k) v[j].push_back({k,val}),v[k].push_back({j,val});
		}for(int i=1;i<=tot;i++)
			for(int j=1;j<=tot;j++){
				ll x=(i/4*4)/4+1,y=(j/4*4)/4+1;
				if(i%4==0) x=((i/4-1)*4)/4+1;
				if(j%4==0) y=((j/4-1)*4)/4+1;
				if(x==y) continue;
				v[i].push_back({j,su(iid[i].x,iid[i].y,iid[j].x,iid[j].y)*(t+0.0)});
				v[j].push_back({i,su(iid[i].x,iid[i].y,iid[j].x,iid[j].y)*(t+0.0)});
			}
		printf("%.1lf\n",min(dijistra(id[A]),min(dijistra(id[A]+1),min(dijistra(id[A]+2),dijistra(id[A]+3)))));
	}
	return 0;
}
2025/1/15 15:52
加载中...