Shortest Path! (初中数学最短路问题)Gym - 101972C

题目链接:https://vjudge.net/problem/Gym-101972C

服了,这个题目因为读入问题和变量类型的使用wa了好几次。在这里做一下标注。

                                                     Shortest Path!

Today, Husam was visiting his grandmother. Husam always takes a path such that the total distance he will walk is as minimum as possible. Husam decided to give you all information about his journey so that you can find the total distance he walked.

Husam grandmother's home is a kilometers away from Husam's home to the south, and b kilometers away to the west. Also, there is a river located c kilometers away from Husam's home to the east.

Before Husam visiting his grandmother, he went to the river to fill his bottle with water. After this, he then went directly to his grandmother's home. After Husam finished his visit, he followed the direct straight path between his grandmother's home and his home. When Husam walked x% of that path, he remembered that his bottle is empty, so, he went to the river to fill it, then he went to his home.

Husam needs your help to calculate the distance he walked today. Can you?

Input

The first line contains an integer T (1 ≤ T ≤ 105) specifying the number of test cases.

Each test case consists of a single line containing four integers abc and x (1 ≤ a, b, c ≤ 109, 0 ≤ x ≤ 100).

Consider the ground and the river as a flat land, and the length of the river is limitless. Also, you can consider Husam and his grandmother homes as small points.

Output

For each test case, print a single line containing the total distance Husam walked during his journey.

Your answer will be considered correct if its relative or absolute error does not exceed 10 - 9.

Example

Input

1
6 2 3 18

Output

20.225553719

最短路,初中数学问题 

 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<string>
using namespace std;
typedef long long ll;
int T;
double a,b,c,x;//要是声明为ll型,进行强制转换计算,也会wa??? 
double sum=0;
int main()
{
	cin>>T;
	while(T--)
	{
		//变量是double类型,要用%lf进行读入。
		//变量是float类型,要用%f进行读入 
		scanf("%lf%lf%lf%lf",&a,&b,&c,&x);
		sum=sqrt(a*a+(b+c*2)*(b+c*2));
		double d=sqrt(a*a+b*b);
		sum=sum+d*(double)x/100.0;
		double x2=b*(double)x/100.0;
		double x3=a*(double)x/100.0;
		sum=sum+sqrt((a-x3)*(a-x3)+(2*c+b-x2)*(2*c+b-x2));
		printf("%.10lf\n",sum);
	}
	return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
GCN (Graph Convolutional Network) Shortest-Path-Master 是一种基于图卷积网络的最短路径算法。最短路径问题是图论中的经典问题,对于给定的图和起始点,找到到达目标点的最短路径。 GCN Shortest-Path-Master 通过应用图卷积神经网络的思想来解决最短路径问题。传统的最短路径算法(如Dijkstra算法或贝尔曼-福特算法)在计算过程中不考虑节点的特征信息,只利用图的拓扑结构。而GCN Shortest-Path-Master 利用了节点的特征信息,将节点的邻居节点信息通过图卷积操作进行聚合,得到节点的新特征表示。 GCN Shortest-Path-Master 的核心思想是,通过图卷积层不断更新节点的特征表示,使得节点的特征表示能够包含更多关于最短路径的信息。在每次迭代中,GCN Shortest-Path-Master 将节点的特征与邻居节点的特征进行聚合,得到节点的新特征表示。在网络的最后一层,通过对所有节点进行分类任务,可以得到每个节点到达目标点的最短路径预测。 相比传统的最短路径算法,GCN Shortest-Path-Master 提供了以下优势: 1. GCN Shortest-Path-Master 能够利用节点的特征,从而更好地表达节点之间的相互作用和联系。 2. GCN Shortest-Path-Master 可以自适应地学习节点的特征表示,而无需人工定义特征。 3. GCN Shortest-Path-Master 可以处理大规模的图结构,在计算效率上具有一定优势。 总之,GCN Shortest-Path-Master 是一种基于图卷积神经网络的最短路径算法,通过利用节点的特征信息,能够更好地解决最短路径问题。它在图结构数据中的应用具有很大潜力,在社交网络分析、推荐系统和物流路径规划等领域都有广泛的应用前景。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值