cdoj 93 King's Sanctuary 傻逼几何题

King's Sanctuary

Time Limit: 20 Sec  Memory Limit: 256 MB

题目连接

http://acm.uestc.edu.cn/#/problem/show/93

Description

The king found his adherents were building four sanctuaries for him. He is interested about the positions of the sanctuaries and wants to know whether they would form a parallelogram, rectangle, diamond, square or anything else.

Input

The first line of the input is T(1≤T≤1000), which stands for the number of test cases you need to solve. Each case contains four lines, and there are two integers in each line, which shows the position of the four sanctuaries. And it is guaranteed that the positions are given clockwise. And it is always a convex polygon, if you connect the four points clockwise.

Output

For every test case, you should output Case #t: first, where t indicates the case number and counts from 1, then output the type of the quadrilateral.

Sample Input

5
0 0
1 1
2 1
1 0
0 0
0 1
2 1
2 0
0 0
2 1
4 0
2 -1
0 0
0 1
1 1
1 0
0 0
1 1
2 1
3 0

Sample Output

Case #1: Parallelogram
Case #2: Rectangle
Case #3: Diamond
Case #4: Square
Case #5: Others

HINT

题意

题解：

给你4个点，让你判断是正方形，还是菱形，还是矩形，还是平行四边形

乱搞就好了 = =

代码：

#include <iostream>
#include <queue>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>

using namespace std;

int T, x[], y[];

bool Parallelogram()
{
    int a = (y[] - y[]) * (x[] - x[]);
    int b = (x[] - x[]) * (y[] - y[]);
    if(a != b) return false;
    a = (x[] - x[]) * (y[] - y[]);
    b = (x[] - x[]) * (y[] - y[]);
    return a == b;
}

bool Rectangle()
{
    int a = (x[] - x[]) * (x[] - x[]) + (y[] - y[]) * (y[] - y[]);
    int b = (x[] - x[]) * (x[] - x[]) + (y[] - y[]) * (y[] - y[]);
    return a == b;
}

bool Diamond()
{
    int a = (y[] - y[]) * (y[] - y[]);
    int b = (x[] - x[]) * (x[] - x[]);
    return a == -b;
}

int main()
{
    scanf("%d", &T);
    for(int ca = ; ca <= T; ca++)
    {
        int i, j;
        for(i = ; i < ; i++)
        {
            scanf("%d %d", &x[i], &y[i]);
        }
        printf("Case #%d: ", ca);
        for(i = ; i < ; i++)
        {
            for(j = i + ; j < ; j++)
            {
                if(x[i] == x[j] && y[i] == y[j])
                    break;
            }
            if(j != ) break;
        }
        if(i != ) puts("Others");
        else
        {
            bool tag, tag1;
            tag = Parallelogram();
            if(tag == false) {puts("Others");}
            else
            {
                tag = Rectangle();
                tag1 = Diamond();
                if(tag == false && tag1 == false) puts("Parallelogram");
                else if(tag == true && tag1 == true) puts("Square");
                else if(tag == true) puts("Rectangle");
                else if(tag1 == true) puts("Diamond");
            }
        }
    }
    return ;
}