CF 261A. Pashmak and Garden

2024-08-28 07:38

文章标签 cf garden pashmak 261a

本文主要是介绍CF 261A. Pashmak and Garden，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

http://codeforces.com/contest/459/problem/A

简单的题目。

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 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
 
 

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>

#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;

using namespace std;

bool cmp(int a,int b){
    return a>b;
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int x1,x2,y1,y2;
    int x3,y3,x4,y4;
    int mark1=0,mark=0;
    cin>>x1>>y1>>x2>>y2;
    if(x1==x2)
    {
        int d=abs(y1-y2);
        x3=x1+d;
        x4=x1+d;
        if(x3>1000)
        {
            x3=x1-d;
            x4=x1-d;
            if(x3<-1000){cout<<-1<<endl;mark=1;}
        }
        if(!mark)cout<<x3<<" "<<y1<<" "<<x4<<" "<<y2<<endl;
    }
    else
    if(y1==y2)
    {
        int d=abs(x1-x2);
        y3=y1+d;
        y4=y1+d;
        if(y3>1000||y4>1000)
        {
            y3=y1-d;
            y4=y1-d;
            if(y3<-1000||y4<-10000){cout<<-1<<endl;mark1=1;}
        }
        if(!mark1)cout<<x1<<" "<<y3<<" "<<x2<<" "<<y4<<endl;
    }
    else
    {
        int d=abs(x1-x2);
        int t=abs(y1-y2);
        if(t!=d)cout<<-1<<endl;
        else
        {
            cout<<x1<<" "<<y2<<" "<<x2<<" "<<y1<<endl;
        }
    }
    return 0;
}