#PU1303. USACO 2023 February Contest, Silver — Problem 2. Cow-libi
USACO 2023 February Contest, Silver — Problem 2. Cow-libi
USACO 2023 February Contest, Silver — Problem 2. Cow-libi
题目描述
Note: The time limit for this problem is 4s, two times the default. 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.
输出格式
(见题面原文)
数据范围
Inputs 2-4: . Also, for both the fields and alibis, and . Inputs 5-11: No additional constraints. Problem credits: Mark Gordon
样例
样例 1
2 4
0 0 100
50 0 200
0 50 50
1000 1000 0
50 0 200
10 0 170
2
There were two grazings; the first at $(0, 0)$ at time $100$ and the
second at $(50, 0)$ at time $200$.
The first cow's alibi does not prove her innocence. She has just enough time to
arrive at the first grazing.
The second cow's alibi does prove her innocence. She is nowhere near any of the
grazings.
Unfortunately for the third cow, being at the scene of the crime does not prove
innocence.
Finally, the fourth cow is innocent because it's impossible to make it from her
alibi to the final grazing in time.