Cow-libi
시간 제한4초메모리 제한1024 MB
시간이 주어진 여러 목초지 방문 기록에 대해, 모든 방문 지점에서 제때 도달할 수 없는 알리바이의 개수를 센다.
문제
Somebody has been grazing in Farmer John's private gardens! Using his expert forensic knowledge, FJ has been able to determine the precise time each garden was grazed. He has also determined that there was a single cow that was responsible for every grazing incident.
In response to these crimes each of FJ's cows have provided an alibi that proves the cow was in a specific location at a specific time. Help FJ test whether each of these alibis demonstrates the cow's innocence.
A cow can be determined to be innocent if it is impossible for her to have travelled between all of the grazings and her alibi. Cows travel at a rate of 1 unit distance per unit time.
입력
The first line of input will contain and separated by a space.
The next lines contain the integers , , and separated by a space describing the location and time of the grazing. It will always be possible for a single cow to travel between all grazings.
The next lines contain , , and separated by a space describing the location and time of each cow's alibi.
출력
Output a single integer: the number of cows with alibis that prove their innocence.