CSP-202006_1_线性分类器（Java）

 

import java.util.Scanner;

public class XianXingFenLeiQi {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();//点数
		int m = sc.nextInt();//直线数量
		int[] Ax = new int[n];
		int[] Ay = new int[n];
		int[] Bx = new int[n];
		int[] By = new int[n];
		int Acount = 0, Bcount =0;
		int flagA = 0, flagB = 0;
		
		for(int i = 0; i<n; i++) {
			int z1 = sc.nextInt();
			int z2 = sc.nextInt();
			char c = sc.next().charAt(0);//next接收到字符串类型的数据，charat将其转换成字符类型
			if(c == 'A') {
				Ax[Acount] = z1;
				Ay[Acount] = z2;
				Acount++;
			}else if(c == 'B') {
				Bx[Bcount] = z1;
				By[Bcount] = z2;
				Bcount++;
			}	
		}
		
		for(int i = 0; i < m; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int c = sc.nextInt();
			for(int p = 0; p < Acount; p++) {
				int flag = a+b*Ax[p]+c*Ay[p];
				if(flag > 0) {
					flagA++;
				}
			}
			for(int p = 0; p < Bcount; p++) {
				int flag = a+b*Bx[p]+c*By[p];
				if(flag > 0) {
					flagB++;
				}
			}
			if (flagA == Acount && flagB == 0) {
                System.out.println("Yes");
            } else if (flagA == 0 && flagB == Bcount) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
			flagA = 0;
            flagB = 0;
		}
		
	}

}