把点代进公式,求出大于0为一类,小于0为一类,各自存进集合中。最后各自求两个集合的种类数,均为1类的说明两类点被完美分开。
python100代码
n, m = map(int, input().split())
points = []
for i in range(n):
points.append(input().split())
for i in range(m):
b, wx, wy = map(int, input().split())
up, down = set(), set()
for x, y, point_type in points:
x, y = int(x), int(y)
if b + wx * x + wy * y > 0:
up.add(point_type)
else:
down.add(point_type)
print('Yes' if len(up) == 1 and len(down) == 1 else 'No')
# 9 3
# 1 1 A
# 1 0 A
# 1 -1 A
# 2 2 B
# 2 3 B
# 0 1 A
# 3 1 B
# 1 3 B
# 2 0 A
# 0 2 -3
# -3 0 2
# -3 1 1