Extended Braille
시간 제한8초메모리 제한2048 MB
정수 좌표로 이루어진 n개의 점 집합이 주어질 때, 평행이동으로 같아지는 것을 하나로 묶어 서로 다른 모양의 개수를 센다.
문제
The Blind Association for Pretty Calligraphy is annoyed by the lack of emoticons and math symbols in the braille alphabet. Given that the braille alphabet is supported by the Unicode format, it only makes sense to make all Unicode characters supported in braille.
The goal is to extend the braille alphabet to include all Unicode characters. Of course, this will not fit in the standard format, so using a bigger box is allowed. Important is that no two braille characters are the same up to translation, i.e., have the same shape. See Figure \ref{fig:braille} for an example. You let a designer make up a large braille alphabet, and your job is to check how many unique shapes there are among the characters.
Figure E.1: Illustration of Sample Input 1: two characters with the same shape.
입력
The input consists of:
-
One line with an integer (), the number of braille characters.
-
Then for each of the braille characters:
- One line with an integer (), the number of dots.
- lines, each with two integers and (), the coordinates of the dots.
-
The total number of dots is at most .
출력
Output the number of distinct braille characters up to translation.