202006-1 线性分类器

202006-1 线性分类器

1. 题目介绍

• 本题网址：http://118.190.20.162/view.page?gpid=T105
• 本题截图：
  
  
  
  
  

2. Python代码

n,m = map(int,input().split()) # n为点的个数， m为查询的个数
point = [0]*n # 点信息集合二维数组
judgments = [] # 判断的结果
for i in range(n):
    point[i]  = list(input().split()) # 输入n个点的信息
    point[i][:2] = map(int,point[i][:2]) # 将坐标转换为整数

for j in range(m):
    inquire = list(map(int,input().split())) # 输入m个查询的信息，直线的三个参数
    type_1 = [] #分为两类
    type_2 = []
    for i in range(n):
        if inquire[2] != 0:
            y = (inquire[0]+inquire[1]*point[i][0])/(-inquire[2]) # 线上面对应X的y的值
            if point[i][1]>y :
                type_1.extend(point[i][2])
            else:
                type_2.extend(point[i][2])
        else:
            x = (inquire[0]+inquire[2]*point[i][1])/(-inquire[1])
            if point[i][0]>x :
                type_1.extend(point[i][2])
            else:
                type_2.extend(point[i][2])
    if ('A' not in type_1 and 'B' not in type_2) or ('B' not in type_1 and 'A' not in type_2):
        judgments.extend(['Yes'])
    else:
        judgments.extend(['No'])
for judgment in judgments:
    print(judgment)

3.测试结果：

• 总结：小白刚刚接触csp，若代码算法关于简单，过于暴力望谅解