[Home|Training|Problems|Contests|C Language] | [Login|Register] |

Problems Status Rank |
Problem 1282
Collision detection
Time Limit: 1000ms
Memory Limit: 65536kb Description
In movie Since the assassination has failed, the Skynet decides to sent To simplify the problem, the Terminator is regarded as a single point and each rock is described as a convex polyhedron. Input
The input contains only one test case. The first line consists of two integers Next The rest of input contains All coordinates are non-negative and less than 1000. It is guaranteed that no two rocks intersect with each other. Output
Output should contain exactly Terminator would get stuck if he lies on the surface of a rock. Sample Input
6 1 0 0 0 1 1 0 0 0 10 3 4 5 6 5 5 6 6 6 8 12 1 1 1 1 1 6 1 6 1 1 6 6 6 1 1 6 1 6 6 6 1 6 6 6 1 2 3 4 5 6 7 8 1 3 1 5 3 7 5 7 2 4 2 6 4 8 6 8 Sample Output
Terminator 1: ready Terminator 2: ready Terminator 3: ready Terminator 4: oops Terminator 5: oops Terminator 6: oops |

University of Science and Technology of China

Online Judge for ACM/ICPC

Processed in 1.0ms with 1 query(s).

Online Judge for ACM/ICPC

Processed in 1.0ms with 1 query(s).