CF#459 A Pashmak and Garden （水题）
Posted wx62a8776062513
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了CF#459 A Pashmak and Garden （水题）相关的知识，希望对你有一定的参考价值。
题干:
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 y2are coordinates of the second tree. Its 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).
Examples
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
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. Its 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).
Examples
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
解题报告：
ac代码：
using namespace std;
int main()
int x1,x2,y1,y2;
int d;
cin>>x1>>y1>>x2>>y2;
if(x1==x2)
d=abs(y1-y2);
printf("%d %d %d %d\\n",x1+d,y1,x2+d,y2);
else if(y1==y2)
d=abs(x1-x2);
printf("%d %d %d %d\\n",x1,y1+d,x2,y2+d);
else
if(abs(x1-x2) != abs(y1-y2) )
printf("-1\\n");
else printf("%d %d %d %d\\n",x1,y2,x2,y1);
return 0 ;
总结：
无
以上是关于CF#459 A Pashmak and Garden （水题）的主要内容，如果未能解决你的问题，请参考以下文章
CF459C Pashmak and Buses 打印全排列
Codeforcecs 459D Pashmak and Parmida's problem 树状数组 OR 分治
Codeforces 459E Pashmak and Graph