CodeForces - 593B Anton and Lines
Submit Status Description The teacher gave Anton a large geometry homework, but he didn't do it (as usual) as he participated in a regular round on Codeforces. In the task he was given a set of n lines defined by the equations y = ki·x + bi. It was necessary to determine whether there is at least one point of intersection of two of these lines, that lays strictly inside the strip between x1 < x2. In other words, is it true that there are 1 ≤ i < j ≤ n and x', y', such that:
You can't leave Anton in trouble, can you? Write a program that solves the given task. Input The first line of the input contains an integer n (2 ≤ n ≤ 100 000) — the number of lines in the task given to Anton. The second line contains integers x1 and x2 ( - 1 000 000 ≤ x1 < x2 ≤ 1 000 000) defining the strip inside which you need to find a point of intersection of at least two lines. The following n lines contain integers ki, bi ( - 1 000 000 ≤ ki, bi ≤ 1 000 000) — the descriptions of the lines. It is guaranteed that all lines are pairwise distinct, that is, for any two i ≠ j it is true that either ki ≠ kj, orbi ≠ bj. Output Print "Yes" (without quotes), if there is at least one intersection of two distinct lines, located strictly inside the strip. Otherwise print "No" (without quotes). Sample Input Input Output Input Output Input Output Input Output Hint In the first sample there are intersections located on the border of the strip, but there are no intersections located strictly inside it. Source Codeforces Round #329 (Div. 2) //題意:直線方程為y=k*x+b. 先輸入n,再輸入x1,x2(左端點、右端點的橫坐标,y1,y2可以根據下面給的k,b求出),然後輸入n組數,每組數都是k b。問組成的這n條直線是否會相交。 //思路: 首先根據方程和給出的k b求出y1,y2,将其存入結構體中,将其排序,在周遊這n條直線,如果不平行,就證明相交了。 |