CCF认证 2020-6 线性分类器

#include <iostream>
using namespace std;

int n, m;

struct point{
    int x;
    int y;
    char type;
};

int r1, r2, r3;

int main(){
    
    scanf("%d%d",&n,&m);
    
    point p[n];
    
    for(int i = 0; i < n; ++i){
        scanf("%d%d%s",&p[i].x,&p[i].y,&p[i].type);
    }
    
    for(int i = 0; i < m; ++i){
        int flag = 0;
        
        scanf("%d%d%d",&r1,&r2,&r3);
        
        for(int j = 0; j < n; ++j){
            int res = r1 + r2 * p[j].x + r3 * p[j].y;
            
            if(p[j].type == 'A'){
                if(res > 0) flag++;
                else flag--;
            }
            
            if(p[j].type == 'B'){
                if(res < 0) flag++;
                else flag--;
            }
        }
        
        if(flag == n || flag == 0-n) printf("Yes\n");
        else printf("No\n");
    }
    
    
    return 0;
    
}