线性分类器

 1 #include <iostream>
 2 #include <cstdio>
 3 using namespace std;
 4 struct DOT
 5 {
 6     int x, y;
 7     int type;//A1,B0
 8 };
 9 int main()
10 {
11     int dot, judge;
12     cin >> dot >> judge;
13     struct DOT* dp = new struct DOT[dot];
14     for (int i = 0; i < dot; i++)
15     {
16         cin >> dp[i].x >> dp[i].y;
17         char tempc;
18         cin >> tempc;
19         if (tempc == 'A')
20             dp[i].type = 1;
21         else
22             dp[i].type = 0;
23     }
24     for (int i = 0; i < judge; i++)
25     {
26         int a, b, c;
27         bool out = true;
28         int flag = 0;//A: >0
29         cin >> a >> b >> c;
30         int t = a + dp[0].x * b + dp[0].y * c;
31         if (t == 0)
32         {
33             out = false;
34         }
35         else
36         {
37             if (dp[0].type == 1)//A
38             {
39                 if (t > 0)
40                 {
41                     flag = 0;
42                 }
43                 else
44                 {
45                     flag = 1;
46                 }
47             }
48             else
49             {
50                 if (t > 0)
51                 {
52                     flag = 1;
53                 }
54                 else
55                 {
56                     flag = 0;
57                 }
58             }
59             for (int j = 1; j < dot; j++)
60             {
61                 t = a + dp[j].x * b + dp[j].y * c;
62                 if (flag == 0)
63                 {
64                     if ((dp[j].type == 1 && t < 0) || (dp[j].type == 0 && t > 0))
65                     {
66                         out = false;
67                         break;
68                     }      
69                 }
70                 else
71                 {
72                     if ((dp[j].type == 1 && t > 0) || (dp[j].type == 0 && t < 0))
73                     {
74                         out = false;
75                         break;
76                     }
77                 }
78             }
79             if (out)cout << "Yes" << endl;
80             else cout << "No" << endl;
81         }
82     }
83     return 0;
84 }

相关阅读:
搭建MHA问题汇总
NOIP2009 靶形数独
get_mysql_conn_info.py
NOIP 2005 篝火晚会
MySQL启动关闭添加到 /etc/init.d/mysqld
noip2002 矩形覆盖
get_slave_status.py
[JSOI2008]魔兽地图
MySQL数据导出导入任务脚本
8.30 牛客OI赛制测试赛1 F题子序列

原文地址：https://www.cnblogs.com/2020R/p/13738944.html