B. Eight Point Sets

B. Eight Point Sets

http://codeforces.com/contest/334/problem/B

 

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Gerald is very particular to eight point sets. He thinks that any decent eight point set must consist of all pairwise intersections of three distinct integer vertical straight lines and three distinct integer horizontal straight lines, except for the average of these nine points. In other words, there must be three integers x1, x2, x3 and three more integers y1, y2, y3, such that x1 < x2 < x3, y1 < y2 < y3 and the eight point set consists of all points (xi, yj) (1 ≤ i, j ≤ 3), except for point (x2, y2).

You have a set of eight points. Find out if Gerald can use this set?

Input

The input consists of eight lines, the i-th line contains two space-separated integers xi and yi (0 ≤ xi, yi ≤ 106). You do not have any other conditions for these points.

Output

In a single line print word "respectable", if the given set of points corresponds to Gerald's decency rules, and "ugly" otherwise.

Sample test(s)

input

0 0
0 1
0 2
1 0
1 2
2 0
2 1
2 2

output

respectable

input

0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0

output

ugly

input

1 1
1 2
1 3
2 1
2 2
2 3
3 1
3 2

output

ugly

刚开始没看懂意思，其实就是，给你满足x1<x2<x3, y1<y2<y3, 然后用这六个数组成九个点，去掉(x2,y2)点，剩下的八个点是否满足条件：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;

struct node{
    int x,y;
}p[];

int a[],b[];

int cmp(node a,node b){
    if(a.x==b.x)
        return a.y<b.y;
    return a.x<b.x;
}

int main() {

    //freopen("input.txt","r",stdin);

    while(~scanf("%d%d",&p[].x,&p[].y)){
        a[]=p[].x,    b[]=p[].y;
        int cnt1=,cnt2=;
        for(int i=;i<;i++){
            scanf("%d%d",&p[i].x,&p[i].y);
            int flag1=,flag2=;
            for(int j=;j<cnt1;j++)
                if(p[i].x==a[j])
                    flag1=;
            if(flag1)
                a[cnt1++]=p[i].x;
            for(int j=;j<cnt2;j++)
                if(p[i].y==b[j])
                    flag2=;
            if(flag2)
                b[cnt2++]=p[i].y;
        }
        if(cnt1!= || cnt2!=){     //判断点x==3?  点y==3?
            puts("ugly");
            continue;
        }
        sort(a,a+);
        sort(b,b+);
        if(a[]==a[] || a[]==a[] || b[]==b[] || b[]==b[]){   //是否满足x1<x2<x3  且  y1<y2<y3
            puts("ugly");
            continue;
        }
        sort(p,p+,cmp);
        int flag=,cnt=;
        for(int i=;i<;i++)
            for(int j=;j<;j++){   //和输出对拍，看看是否相同
                if(i== && j==)    //去掉点(x2,y2)
                    continue;
                if(a[i]==p[cnt].x && b[j]==p[cnt].y)
                    cnt++;
                else{
                    flag=;
                    break;
                }
            }
        if(flag)
            puts("respectable");
        else
            puts("ugly");
    }
    return ;
}