ccf 202006-1 线性分类器

#include <iostream>
using namespace std;

int a[1001][3];
int b[21][3];
int m ,n;
/*
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
*/
bool judge(int bIndex) {
	bool flag1 = true, flag2 = true;
	int m1, n1;
	for (int i = 0; i < n; i++) {
		if (( b[bIndex][2] * a[i][1] + b[bIndex][0] + b[bIndex][1] * a[i][0] ) > 0) {
			if (flag1) {
				m1 = a[i][2];
				flag1 = false;	
			} else {
				if(a[i][2] != m1) {
					return false;
				}
			}
		} else {
			if (flag2) {
				n1 = a[i][2];
				flag2 = false;	
			} else {
				if(a[i][2] != n1) {
					return false;
				}
			}
		}
	}
	return true;
}

int main() {
	cin >> n >> m;
	char ch;
	for (int i = 0; i < n; i++) {
		cin >> a[i][0] >> a[i][1];
		cin >> ch;
		if (ch == 'A') {
			a[i][2] = 1; // A
		} else {
			a[i][2] = 2; //B
		}
	}
	for (int i = 0; i < m; i++) {
		cin >> b[i][0] >> b[i][1] >> b[i][2];
	}
	for (int i = 0; i < m; i++) {
		if (judge(i)) {
			cout << "Yes" << endl;
		} else {
			cout << "No" << endl;
		}
	}
	return 0;
}