csp 线性分类器

没看清题目ax+by+c中a b c 的顺序

#include <iostream>

using namespace std;
int m;
int n;
struct S
{
    int x;
    int y;
    char c;
};
int main()
{
    cin>>n>>m;
    S s[1001];
    int cnt=0;
    while(n--)
    {
        cin>>s[cnt].x>>s[cnt].y>>s[cnt].c;

        cnt++;
    }
char minn;//大于0
char maxn;//小于0

    while(m--)
    {
        minn='N';
        maxn='N';
        int flag=1;
        int a,b,c;
        cin>>c>>a>>b;
       for(int i=0;i<cnt;i++)
       {
           int zz=a*s[i].x+b*s[i].y+c;

           if(a*s[i].x+b*s[i].y+c>0)
           {
               if(maxn=='N')
               {
                   maxn=s[i].c;
               }
               else if(maxn !=s[i].c)
               {
                   flag=0;
               }
           }
           else
           {
               if(minn=='N')
               {
                   minn=s[i].c;
               }
               else if(minn !=s[i].c)
               {
                   flag=0;
               }

           }

       }
          if(flag==0) cout<<"No"<<endl;
           else cout<<"Yes"<<endl;
    }
    return 0;
}