Algorithm

A. Pashmak and Garden
time limit per test
1 second
memory limit per test
256 megabytes
problem link- https://codeforces.com/problemset/problem/459/A
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).

Examples
input
Copy
0 0 0 1
output
Copy
1 0 1 1
input
Copy
0 0 1 1
output
Copy
0 1 1 0
input
Copy
0 0 1 2
output
Copy
-1



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <stdio.h>
#include <math.>
#include <stdlib.h>

using namespace std;

int dist(int x1, int y1, int x2, int y2) {
  return sqrt(pow(abs(x1 - x2), 2.0) + pow(abs(y1 - y2), 2.0));
}

bool ok(int x) {
  return x >= -1000 && x <= 1000;
}

void check(int x1, int y1, int x2, int y2) {
  if(ok(x1) && ok(y1) && ok(x2) && ok(y2)) {
    printf("%d %d %d %d\n", x1, y1, x2, y2);
    exit(0);
  }
}

int main() {
  int x1, y1, x2, y2, x3, y3, x4, y4;
  scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
    int d = dist(x1, y1, x2, y2);
  
  if(x1 == x2) {
    y3 = y1;
    y4 = y2;
    
    x3 = x1 + d;
    x4 = x2 + d;
    check(x3, y3, x4, y4);
    
    x3 = x1 - d;
    x4 = x2 - d;
    check(x3, y3, x4, y4);
    
    puts("-1");
  } else if(y1 == y2) {
    x3 = x1;
    x4 = x2;
    
    y3 = y1 + d;
    y4 = y2 + d;
    check(x3, y3, x4, y4);
    
    y3 = y1 - d;
    y4 = y2 - d;
    check(x3, y3, x4, y4);
    
    puts("-1");
  } else if(abs(x1 - x2) == abs(y1 - y2)) {
    d = abs(x1 - x2);
    
    if(y1 > y2) {
      x3 = x1;
      y3 = y1 - d;
      
      x4 = x2;
      y4 = y2 + d;
      check(x3, y3, x4, y4);
      
      puts("-1");
    } else if(y1 < y2) {
      x3 = x1;
      y3 = y1 + d;
      
      x4 = x2;
      y4 = y2 - d;
      check(x3, y3, x4, y4);
      
      puts("-1");
    }
  } else puts("-1");
  
  return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
0 0 0 1

Output

x
–
+
cmd
1 0 1 1
Advertisements

Demonstration

Codeforces Solution-Pashmak and Garden-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+