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

 

     题意：

     给出 x1,x2,y1,y2，问能不能构成正方形，能则输出另外两点。不能则输出 -1。

 

     思路：

     模拟。分情况讨论清楚就行。

 

     AC：

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int main() {

    int x1, y1, x2, y2;
    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);

    int lenx = abs(x1 - x2);
    int leny = abs(y1 - y2);

    if (lenx && leny && lenx != leny) printf("-1\n");
    else if (!lenx) printf("%d %d %d %d\n", (x1 + leny), y1, (x1 + leny), y2);
    else if (!leny) printf("%d %d %d %d\n", x1, y1 + lenx, x2, y1 + lenx);
    else printf("%d %d %d %d\n", x2, y1, x1, y2);

    return 0;
}