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