cf 194 div2 BEight Point Sets

來源:互聯網
上載者:User
B. Eight Point Setstime 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 00 10 21 01 22 02 12 2
output
respectable
input
0 01 02 03 04 05 06 07 0
output
ugly
input
1 11 21 32 12 22 33 13 2
output
ugly

表示看了半天題,都沒看懂啥意思,最後靠著小胖翻譯的協助才將這個題看懂,哎,醬油啊,下面是代碼:

#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;struct node{    int x;    int y;}p[10];bool cmp(node a,node b){     if(a.x!=b.x)        return a.x<b.x;      return a.y<b.y;}int main(){    for(int i=0;i<8;i++)       scanf("%d%d",&p[i].x,&p[i].y);    sort(p,p+8,cmp);    bool ans=true;    if(p[0].x != p[1].x || p[1].x != p[2].x)        ans = false ;    if(p[3].x != p[4].x)        ans = false ;    if(p[5].x != p[6].x || p[6].x != p[7].x)        ans = false ;    int y1 = p[0].y ;    int y2 = p[1].y ;    int y3 = p[2].y ;    if(y1 >= y2 || y2 >= y3)        ans = false ;    if(p[3].y != y1 || p[4].y != y3)        ans = false ;    if(p[5].y != y1 || p[6].y != y2 || p[7].y != y3)        ans = false ;    if(ans)       cout<<"respectable"<<endl;    else       cout<<"ugly"<<endl;    return 0 ;}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.