Pashmak and Garden

https://codeforces.com/problemset/problem/459/A

思路：一道模拟题，把几种情况讨论清楚就可以了，有些小细节还是要注意一下

以下是代码实现：

#include<iostream>
#include<cmath>
using namespace std;

int main()
{
    int x[5]={0},y[5]={0};
    bool flag=false;
    cin>>x[1]>>y[1]>>x[2]>>y[2];
    if(x[1]==x[2])
    {
        flag=true;
        int d=abs(y[1]-y[2]);
        x[3]=x[1]+d,y[3]=y[1];
        x[4]=x[2]+d,y[4]=y[2];
        if(x[3]>1000)
        {
            x[3]=x[1]-d,y[3]=y[1];
            x[4]=x[2]-d,y[4]=y[2];
        }
    }
    else if(y[1]==y[2])
    {
        flag=true;
        int d=abs(x[1]-x[2]);
        x[3]=x[1],y[3]=y[1]+d;
        x[4]=x[2],y[4]=y[2]+d;
        if(y[3]>1000)
        {
            x[3]=x[1],y[3]=y[1]+d;
            x[4]=x[2],y[4]=y[2]+d;
        }
    }
    else if(1.0*(y[1]-y[2])/(x[1]-x[2])==1)
    {
        flag=true;
        int d=sqrt(((x[1]-x[2])*(x[1]-x[2])+(y[1]-y[2])*(y[1]-y[2]))/2);
        if(x[1]>x[2])
        {
            swap(x[1],x[2]);
            swap(y[1],y[2]);
        }
        x[3]=x[1]+d,y[3]=y[1];
        x[4]=x[2]-d,y[4]=y[2];
    }
    else if(1.0*(y[1]-y[2])/(x[1]-x[2])==-1)
    {
        flag=true;
        int d=sqrt(((x[1]-x[2])*(x[1]-x[2])+(y[1]-y[2])*(y[1]-y[2]))/2);
        if(x[1]<x[2])
        {
            swap(x[1],x[2]);
            swap(y[1],y[2]);
        }
        x[3]=x[1]-d,y[3]=y[1];
        x[4]=x[2]+d,y[4]=y[2];
    }
    if(flag==true&&-1000<=x[3]&&x[3]<=1000&&-1000<=y[3]&&y[3]<=1000&&-1000<=x[4]&&x[4]<=1000&&-1000<=y[4]&&y[4]<=1000)
    {
        cout<<x[3]<<" "<<y[3]<<" "<<x[4]<<" "<<y[4];
    }
    else
    {
        cout<<-1;
    }
    return 0;
}