sicily 1059. Exocenter of a Trian

Description

Given a triangle ABC, the Extriangles of ABC are constructed as follows:

On each side of ABC, construct a square (ABDE, BCHJ and ACFG in the figure below).

Connect adjacent square corners to form the three Extriangles (AGD, BEJ and CFH in the figure).

The Exomedians of ABC are the medians of the Extriangles, which pass through vertices of the original triangle, extended into the original triangle (LAO, MBO and NCO in the figure. As the figure indicates, the three Exomedians intersect at a common point called the Exocenter (point O in the figure).

This problem is to write a program to compute the Exocenters of triangles.

Input

The first line of the input consists of a positive integer n, which is the number of datasets that follow. Each dataset consists of 3 lines; each line contains two floating point values which represent the (two -dimensional) coordinate of one vertex of a triangle. So, there are total of (n*3) + 1 lines of input. Note: All input triangles wi ll be strongly non-degenerate in that no vertex will be within one unit of the line through the other two vertices. 

Output

For each dataset you must print out the coordinates of the Exocenter of the input triangle correct to four decimal places.

Sample Input

aaarticlea/jpeg;base64,/9j/4AAQSkZJRgABAQEAYABgAAD/2wBDAAgGBgcGBQgHBwcJCQgKDBQNDAsLDBkSEw8UHRofHh0aHBwgJC4nICIsIxwcKDcpLDAxNDQ0Hyc5PTgyPC4zNDL/2wBDAQkJCQwLDBgNDRgyIRwhMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjIyMjL/wAARCAARABIDASIAAhEBAxEB/8QAGAABAAMBAAAAAAAAAAAAAAAAAAMFBwT/xAAlEAACAQQCAQMFAAAAAAAAAAABAgMABAURBiESIjFBMjZxdbP/xAAYAQACAwAAAAAAAAAAAAAAAAAAAwEEBf/EABsRAQEAAgMBAAAAAAAAAAAAAAEAAgMEEyFh/9oADAMBAAIRAxEAPwDQeRW+SyVnctBIkiiScOk87qm0ciP0aZWA8dkEDZA2fcGPCWPI+PXkUt3GIcQjkyQxTGdtMrAhUVQO5CraVd/UB1pa7cnHmbaW5hjxEktoZJJGulnjChWYsT4lvLoHvr3B1vommvuQYaSe/jGSxrW9yXEiCWIiTe9eWohvs/LH8n5ocDh9jlnsER+zt+9wDE9G0uKWO4hSaGRJIpFDI6MCrKewQR7ilVfFPs7B/r4P5rStB8ZJW9KUqIlKUoi//9k=" alt="" /> Copy sample input to clipboard 

2
0.0 0.0
9.0 12.0
14.0 0.0
3.0 4.0
13.0 19.0
2.0 -10.0

Sample Output

9.0000 3.7500
-48.0400 23.3600

分析：这题要求的点其实就是三角形的垂心，那么只要根据三角形坐标求得垂心的坐标即可，我是根据斜率乘积是 - 来求解方程式而得到结果的。但是这样做的话要注意斜率不存在的情况，所以一共有  种情况（分母为 ），还要注意的是 double 对  的处理，也即下面的 dcmp 函数。这样处理显得有点，乱，特别是在公式处理。但是只要自己把公式列出来还是能很快理解的。另外这里将三个点排序的原因是这样处理后能使得三个点的相对位置明确，减少可能出现的斜率为零的情况。

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

const double eps = 1e-;

struct Point{
    double x;
    double y;
};

bool cmp(const Point &a, const Point &b) {
    return a.x < b.x;
}

int dcmp(double x){
    return (x > -eps && x < eps) ?  : ;
} 

int main(int argc, char const *argv[])
{
    int testNum;
    cin >> testNum;
    Point point[];
    while (testNum--) {
        for (int i = ; i != ; ++i) {
            cin >> point[i].x >> point[i].y;
        }
        sort(point, point + , cmp);

        double x1_sub_x2 = point[].x - point[].x;
        double y2_sub_y1 = point[].y - point[].y;
        double x2_sub_x3 = point[].x - point[].x;
        double y3_sub_y2 = point[].y - point[].y;
        double x3_sub_s1 = point[].x - point[].x;
        double y3_sub_y1 = point[].y - point[].y;
        double x, y;
        if (dcmp(x1_sub_x2) == ) {
            x = point[].x;
            y = point[].y;
        } else if (dcmp(y2_sub_y1) == ) {
            x = point[].x;
            y = point[].y - (x2_sub_x3 / y3_sub_y2) * (-x3_sub_s1);
        } else if (dcmp(x2_sub_x3) == ) {
            y = point[].y;
            x = (-y2_sub_y1) * y3_sub_y1 / x1_sub_x2 + point[].x;
        } else if (dcmp(x3_sub_s1) == ) {
            y = point[].y;
            x = point[].x + y3_sub_y1 * y2_sub_y1 / (-x1_sub_x2);
        } else {
            x = (y3_sub_y1 - (x1_sub_x2 / y2_sub_y1) * point[].x +
                    (x2_sub_x3 / y3_sub_y2) * point[].x) / (x2_sub_x3 / y3_sub_y2 - x1_sub_x2 / y2_sub_y1);
            y = point[].y - (x2_sub_x3 / y3_sub_y2) * (point[].x - x);
        }

        x = dcmp(x) ==  ?  : x;
        y = dcmp(y) ==  ?  : y;
        printf("%.4lf %.4lf\n", x, y);
    }
    return ;
}