Problem E
The Other Two Trees
Input: standard input
Output: standard output
Time Limit: 2 seconds
You have a quadrilateral shaped land whose opposite fences are of equal length. You have four neighbors whose lands are exactly adjacent to your four fences, that means you have a common fence with all of them. For example if you have a fence of lengthd in one side, this fence of length d is also the fence of the adjacent neighbor on that side. The adjacent neighbors have no fence in common among themselves and their lands also don’t intersect. The main difference between their land and your land is that their lands are all square shaped. All your neighbors have a tree at the center of their lands. Given the Cartesian coordinates of trees of two opposite neighbors, you will have to find the Cartesian coordinates of the other two trees.
Input
The input file contains several lines of input. Each line contains four floating point or integer numbersx1, y1, x2, y2, where (x1, y1), (x2, y2) are the coordinates of the trees of two opposite neighbors. Input is terminated by end of file.
Output
For each line of input produce one line of output which contains the line “Impossible.” without the quotes, if you cannot determine the coordinates of the other two trees. Otherwise, print four floating point numbers separated by a single space with ten digits after the decimal pointax1, ay1, ax2, ay2, where (ax1, ay1) and (ax2, ay2) are the coordinates of the other two trees. The output will be checked with special judge program, so don’t worry about the ordering of the points or small precision errors. The sample output will make it clear.
Sample Input
10 0 -10 0
10 0 -10 0
10 0 -10 0
Sample Output
0.0000000000 10.0000000000 0.0000000000 -10.0000000000
0.0000000000 10.0000000000 -0.0000000000 -10.0000000000
0.0000000000 -10.0000000000 0.0000000000 10.0000000000
开始想着告诉我们A,B两点然后待求的为C,D两点中点为0;
显然有(向量)
AB与OC点积为0,OC与OD点积为0;
A(x1,y1) B(x2,y2) c(x,y)
(x-x1)*(x-x2)+(y-y1)*(y-y2)=0
(x-(x1+x2)/2)*(x1-x2)+(y-(y1+y2)/2)*(y1-y2)=0
化简好烦没算出来~~~~(>_<)~~~~ ,
后来看到别人用向量旋转做的,没学过~~~~(>_<)~~~~ 百度之
这里是90度特殊值,直接可以算出C点到原点的向量。然后加上中点的坐标值就是c点的坐标值
#include<stdio.h>
void main()
{double x1,y1,x2,y2,x3,y3,x4,y4,cx,cy;
while(scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2)!=EOF)
{if(x1==x2 && y1==y2)
printf("Impossible.\n");
else
{cx=(x1+x2)/2;cy=(y1+y2)/2;
x1-=cx;x2-=cx;y1-=cy;y2-=cy;
x3=-y1;y3=x1;x4=-x3;y4=-y3;
printf("%lf %lf %lf %lf\n",x3+cx,y3+cy,x4+cx,y4+cy);
}
}
}