【算法练习】CSP--202006-1--线性分类器

#include <iostream>
#include <vector>
#define ll long long
using namespace std;

ll n, m, t_0, t_1, t_2;
struct point
{
	ll x, y;
	char s,aws;
};

int main() {
	cin >> n >> m;
	vector<point>vec(n);

	for (size_t i = 0; i < n; i++)
	{
		cin >> vec[i].x >> vec[i].y >> vec[i].s;
	}

	for (size_t i = 0; i < m; i++)
	{
		cin >> t_0 >> t_1 >> t_2;

		// 计算结果
		for (auto& it : vec)
		{
			ll res = t_0 + t_1 * it.x + t_2 * it.y;
			if (res > 0) it.aws = 'A';
			else it.aws = 'B';
		}
		// 二分类情况统计
		ll sum_score = 0;
		for (auto& it : vec)
		{
			sum_score += (it.s == it.aws);
		}
		// 结果检查
		if (sum_score == 0 || sum_score == n) cout << "Yes\n";
		else cout << "No\n";
	}
	return 0;
}