Codeforces Round #261 (Div. 2) A. Pashmak and Garden (水题)

题目：

A. Pashmak and Garden

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Pashmak has fallen in love with an attractive girl called Parmida since one year ago...

Today, Pashmak set up a meeting with his partner in a romantic garden. Unfortunately, Pashmak has forgotten where the garden is. But he remembers that the garden looks like a square with sides parallel to the coordinate axes. He also remembers that there is exactly one tree on each vertex of the square. Now, Pashmak knows the position of only two of the trees. Help him to find the position of two remaining ones.

Input

The first line contains four space-separated x1, y1, x2, y2 ( - 100 ≤ x1, y1, x2, y2 ≤ 100) integers, where x1 and y1 are coordinates of the first tree and x2 and y2 are coordinates of the second tree. It's guaranteed that the given points are distinct.

Output

If there is no solution to the problem, print -1. Otherwise print four space-separated integers x3, y3, x4, y4 that correspond to the coordinates of the two other trees. If there are several solutions you can output any of them.

Note that x3, y3, x4, y4 must be in the range ( - 1000 ≤ x3, y3, x4, y4 ≤ 1000).

Sample test(s)

input

0 0 0 1

output

1 0 1 1

input

0 0 1 1

output

0 1 1 0

input

0 0 1 2

output

-1

题意分析：

就是给你一个正方形的两点顶点，求出另外两个顶点的坐标。正方形都是平行于坐标轴的，这里简化了问题的难度。考虑已知两个点是对角线点和一条边上的点两种情况，对角线点需要判断一次abs（x1-x2）=？abs（y1-y2）这是决定了是否能构成正方形，如果可以构成就对应交换一个坐标输出就可以了。在一条边上的情况，需要算出边长，注意一下数据会不会超范围，估计被cha的就是这里了。

代码：

<span style="font-weight: normal;">#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <cstdio>

using namespace std;


int main()
{
    int x1,x2,y1,y2,a;
    while(cin>>x1>>y1>>x2>>y2)
    {
        if(x1==x2)
        {
            a=abs(y1-y2);
            if(x1==100)
            {
                printf("%d %d %d %d\n",x1-a,y1,x2-a,y2);
            }else
            {
                printf("%d %d %d %d\n",x1+a,y1,x2+a,y2);
            }

        }
        else if(y1==y2)
        {
            a=abs(x1-x2);
            if(y1==100)
            {
                printf("%d %d %d %d\n",x1,y1-a,x2,y2-a);
            }else
            {
                printf("%d %d %d %d\n",x1,y1+a,x2,y2+a);
            }
        }
        else
        {
            if(abs(x1-x2)!=abs(y1-y2))
            {
                printf("-1\n");
                continue;
            }
            else
            {
                printf("%d %d %d %d\n",x1,y2,x2,y1);
            }
        }
    }
}
</span>