Pashmak and Garden

最新推荐文章于 2021-11-06 22:58:45 发布

原创最新推荐文章于 2021-11-06 22:58:45 发布 · 244 阅读

0 ·

CC 4.0 BY-SA版权

AC路漫漫专栏收录该内容

180 篇文章

订阅专栏

Pashmak需要找到一年前与Parmida相约的浪漫花园的其余两棵树的位置。已知花园为平行于坐标轴的正方形且每角有一棵树。通过输入已知的两棵树的坐标，程序将计算并输出剩余两棵树的可能位置。

Description

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 x₁, y₁, x₂, y₂( - 100 ≤ x₁, y₁, x₂, y₂ ≤ 100) integers, where x₁ and y₁ are coordinates of the first tree and x₂ and y₂ 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 x₃, y₃, x₄, y₄ that correspond to the coordinates of the two other trees. If there are several solutions you can output any of them.

Note that x₃, y₃, x₄, y₄ must be in the range ( - 1000 ≤ x₃, y₃, x₄, y₄ ≤ 1000).

Sample Input

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

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

int main(){
    int x1,y1,x2,y2,x3,y3,x4,y4,t,k,flag;
    while(cin>>x1>>y1>>x2>>y2){
        flag=1;
        if(x1==x2){
            t=abs(y1-y2);
            x3=x1+t;
            x4=x2+t;
            y3=y1;
            y4=y2;
        }
        else if(y1==y2){
            t=abs(x1-x2);
            y3=y1+t;
            y4=y2+t;
            x3=x1;
            x4=x2;
        }
        else if(x1!=x2&&y1!=y2){
            t=abs(y1-y2);
            k=abs(x1-x2);
            if(t==k){
                x3=x1;
                y3=y2;
                x4=x2;
                y4=y1;
            }
            else{
                flag=0;
            }
        }
        if(flag==1){
            cout<<x3<<" "<<y3<<" "<<x4<<" "<<y4<<endl;
        }
        else{
            cout<<"-1"<<endl;
        }
    }
    return 0;
}