300151: CF32E. Hide-and-Seek

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Hide-and-Seek

题意翻译

平面上有两个点 $A,B$ 、 一堵墙(设为线段 $W$)、一面双面镜子(设为线段 $M$)。 问在 $A$ 点能否看见 $B$ 点。 光线碰到墙会被吸收,碰到镜子的反射面会镜面反射。 ### 输入 第一行两个整数,表示 $x_v$ 和 $y_v$。 第二行两个整数,表示 $x_p$ 和 $y_p$。 第三行包含四个整数,表示 $x_{w,1}$,$y_{w,1}$,$x_{w,2}$,$y_{w,2}$。 第四行包含四个整数,表示 $x_{m,1}$,$y_{m,1}$,$x_{m,2}$,$y_{m,2}$。 所有的坐标都是整数,绝对值不超过 $10^4$。 ### 输出 如果维可以输出 YES。否则输出 NO。

题目描述

Victor and Peter are playing hide-and-seek. Peter has hidden, and Victor is to find him. In the room where they are playing, there is only one non-transparent wall and one double-sided mirror. Victor and Peter are points with coordinates $ (x_{v},y_{v}) $ and $ (x_{p},y_{p}) $ respectively. The wall is a segment joining points with coordinates $ (x_{w,1},y_{w,1}) $ and $ (x_{w,2},y_{w,2}) $ , the mirror — a segment joining points $ (x_{m,1},y_{m,1}) $ and $ (x_{m,2},y_{m,2}) $ . If an obstacle has a common point with a line of vision, it's considered, that the boys can't see each other with this line of vision. If the mirror has a common point with the line of vision, it's considered, that the boys can see each other in the mirror, i.e. reflection takes place. The reflection process is governed by laws of physics — the angle of incidence is equal to the angle of reflection. The incident ray is in the same half-plane as the reflected ray, relative to the mirror. I.e. to see each other Victor and Peter should be to the same side of the line, containing the mirror (see example 1). If the line of vision is parallel to the mirror, reflection doesn't take place, and the mirror isn't regarded as an obstacle (see example 4). Victor got interested if he can see Peter, while standing at the same spot. Help him solve this problem.

输入输出格式

输入格式


The first line contains two numbers $ x_{v} $ and $ y_{v} $ — coordinates of Victor. The second line contains two numbers $ x_{p} $ and $ y_{p} $ — coordinates of Peter. The third line contains 4 numbers $ x_{w,1} $ , $ y_{w,1} $ , $ x_{w,2} $ , $ y_{w,2} $ — coordinates of the wall. The forth line contains 4 numbers $ x_{m,1} $ , $ y_{m,1} $ , $ x_{m,2} $ , $ y_{m,2} $ — coordinates of the mirror. All the coordinates are integer numbers, and don't exceed $ 10^{4} $ in absolute value. It's guaranteed, that the segments don't have common points, Victor and Peter are not on any of the segments, coordinates of Victor and Peter aren't the same, the segments don't degenerate into points.

输出格式


Output YES, if Victor can see Peter without leaving the initial spot. Otherwise output NO.

输入输出样例

输入样例 #1

-1 3
1 3
0 2 0 4
0 0 0 1

输出样例 #1

NO

输入样例 #2

0 0
1 1
0 1 1 0
-100 -100 -101 -101

输出样例 #2

NO

输入样例 #3

0 0
1 1
0 1 1 0
-1 1 1 3

输出样例 #3

YES

输入样例 #4

0 0
10 0
100 100 101 101
1 0 3 0

输出样例 #4

YES

Input

题意翻译

平面上有两个点 $A,B$ 、 一堵墙(设为线段 $W$)、一面双面镜子(设为线段 $M$)。 问在 $A$ 点能否看见 $B$ 点。 光线碰到墙会被吸收,碰到镜子的反射面会镜面反射。 ### 输入 第一行两个整数,表示 $x_v$ 和 $y_v$。 第二行两个整数,表示 $x_p$ 和 $y_p$。 第三行包含四个整数,表示 $x_{w,1}$,$y_{w,1}$,$x_{w,2}$,$y_{w,2}$。 第四行包含四个整数,表示 $x_{m,1}$,$y_{m,1}$,$x_{m,2}$,$y_{m,2}$。 所有的坐标都是整数,绝对值不超过 $10^4$。 ### 输出 如果维可以输出 YES。否则输出 NO。

加入题单

算法标签: