codeforces Round #261(div2) A解题报告

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

题目大意：

给出正方形的两个点，要求求出其他两个点，使得该正方形的边分别平行于X、Y轴。题目的限制条件基本上等于没限制，因为根本不可能超过题目的范围。

解法：

正方形的点可以这么解析：(x0, y0), (x0+a, y0), (x0, y0+a), (x0+a, y0+a)。之后我们就可以固定一个已知点为x0, y0，将另一个已知点去套用，求出a，最后算出答案。

代码：

#include <cstdio>
#include <algorithm>

using namespace std;

int x1, x2, y1, y2;

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

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