杭电 2857 计算几何

          留下做个模板。。。。。。。。题目:

Mirror and Light

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 410    Accepted Submission(s): 187


Problem Description
The light travels in a straight line and always goes in the minimal path between two points, are the basic laws of optics.

Now, our problem is that, if a branch of light goes into a large and infinite mirror, of course,it will reflect, and leave away the mirror in another direction. Giving you the position of mirror and the two points the light goes in before and after the reflection, calculate the reflection point of the light on the mirror.
  
You can assume the mirror is a straight line and the given two points can’t be on the different sizes of the mirror.
 

Input
The first line is the number of test case t(t<=100).
  
The following every four lines are as follow:
  X1 Y1
  X2 Y2
  Xs Ys
  Xe Ye

  (X1,Y1),(X2,Y2) mean the different points on the mirror, and (Xs,Ys) means the point the light travel in before the reflection, and (Xe,Ye) is the point the light go after the reflection.

  The eight real number all are rounded to three digits after the decimal point, and the absolute values are no larger than 10000.0.
 

Output
  Each lines have two real number, rounded to three digits after the decimal point, representing the position of the reflection point.
 

Sample Input
  
  
1 0.000 0.000 4.000 0.000 1.000 1.000 3.000 1.000
 

Sample Output
  
  
2.000 0.000
 

ac代码:

#include <iostream>
#include <cstdio>
using namespace std;
int main(){
  int numcase;
  double x1,y1,x2,y2,xs,ys,xe,ye,x0,y0,a,b,c;
  scanf("%d",&numcase);
  while(numcase--){
    scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&xs,&ys,&xe,&ye);
	a=y2-y1;b=x1-x2;c=(x2-x1)*y2-(y2-y1)*x2;
	x0=((b*b-a*a)*xs-2*a*b*ys-2*a*c)/(a*a+b*b);//对称点横坐标
	y0=((a*a-b*b)*ys-2*a*b*xs-2*b*c)/(a*a+b*b);//对称点纵坐标
	//两条直线交点
	double k=((x0-xe)*(y1-ye)-(y0-ye)*(x1-xe))/((y0-ye)*(x2-x1)-(x0-xe)*(y2-y1));
	double xx=x1+k*(x2-x1);
	double yy=y1+k*(y2-y1);
	printf("%.3lf %.3lf\n",xx,yy);
  }
  return 0;
}



  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值