CCF线性分类器（100分）

#include<bits/stdc++.h>
using namespace std;
#define N 1000
int main()
{
	int a[N],b[N],c[N],d[N];
	int f[100],g[100],h[100];
	int n,m;
	int x,y;
	char p;
	int counta=0;
	int countb=0;
	cin>>n>>m;
	for(int i=0;i<n;i++)
	{
		cin>>x>>y>>p;
		if(p=='A')
		{
			a[counta]=x;
			b[counta]=y;
			counta++;
		}
		if(p=='B')
		{
			c[countb]=x;
			d[countb]=y;
			countb++;
		}
	}
	for(int j=0;j<m;j++)
	{
		cin>>f[j]>>g[j]>>h[j];
	}
	for(int t=0;t<m;t++)
	{
		int sign1=0,sign2=0,sign3=0,sign4=0;
		for(int r=0;r<counta;r++)
		{
			if(f[t]+g[t]*a[r]+h[t]*b[r]<0)
			{
				sign1=1;
			}
			if(f[t]+g[t]*a[r]+h[t]*b[r]>0)
			{
				sign2=1;
			}
		}
		for(int v=0;v<countb;v++)
		{
			if(f[t]+g[t]*c[v]+h[t]*d[v]<0)
			{
				sign3=1;
			}
			if(f[t]+g[t]*c[v]+h[t]*d[v]>0)
			{
				sign4=1;
			}
		}
		if((sign1==sign2==1)||(sign3==sign4==1))
		{
			cout<<"No"<<endl;
		}
		else
		{
			cout<<"Yes"<<endl;
		}
		 
	}
	return 0;
}