CCF--- 202006-1--- 线性分类器---C++11

试题编号	202006-1
试题名称	线性分类器
时间限制	1.0s
内存限制	512.0MB

问题描述

实现代码

#include<iostream>
#include<string>
using namespace std;

const int maxn = 1e3 + 5;
int buff, n, m;
char type;

struct Point{
	int x, y;
	char type;
	Point() {}
	Point(int x, int y, char t) : x(x), y(y), type(t){}
}point[maxn];

bool judge(int a, int b, int c) {
	// 把第一个点位于线的哪一侧线确定
	buff = (a + b * point[0].x + c * point[0].y);
	if (buff == 0) return false;
	buff = buff > 0 ? 1 : 0;
	for (int i = 1; i < n; i++) {
		int nowbuff = (a + b * point[i].x + c * point[i].y);
		if (nowbuff == 0) return false;
		nowbuff = nowbuff > 0 ? 1 : 0;
		// 同类
		if (point[i].type == type && buff != nowbuff) return false;
		// 异类
		if (point[i].type != type && buff == nowbuff) return false;
	}
	return true;
}


int main() {
	int x, y, a, b, c;
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> x >> y >> type;
		point[i] = Point(x, y, type);
	}
	// 先记录第一个点的type，用于后续比较
	type = point[0].type;
	while (m--) {
		cin >> a >> b >> c;
		cout << (judge(a, b, c) ? "Yes" : "No") << endl;
	}
	return 0;
}