2020-6-1线性分类器

谁践踏了优雅 2021-09-21 11:16 224阅读 0赞

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzkyMjA5Mw_size_16_color_FFFFFF_t_70_pic_center]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzkyMjA5Mw_size_16_color_FFFFFF_t_70_pic_center 1]  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzkyMjA5Mw_size_16_color_FFFFFF_t_70_pic_center 2]  
满分代码：

#include <bits/stdc++.h>
    using namespace std;
    struct point{ 
    	int x;
    	int y;
    	char t;
    }points[1001];
    int IsClass(int n,int x0,int x1,int x2){ 
    	#define result(x,y) (x0+x1*x+x2*y)
    	char one='c',two='d';
    	for(int i=0;i<n;i++){ 
    		//正好在直线上直接出局 
    		if(result(points[i].x,points[i].y)==0){ 
    			return 0;
    		}
    		if(result(points[i].x,points[i].y)>0){ 
    			one=points[i].t;
    		}else if(result(points[i].x,points[i].y)<0){ 
    			two=points[i].t;
    		}
    		if(one==two){ 
    			return 0;
    		}
    	}
    	return 1;
    } 
    int main(){ 
    	int n,m;
    	cin>>n>>m;
    	for(int i=0;i<n;i++){ 
    		cin>>points[i].x>>points[i].y>>points[i].t;
    	}
    	for(int i=0;i<m;i++){ 
    		int x0,x1,x2;
    		cin>>x0>>x1>>x2;
    		if(IsClass(n,x0,x1,x2)){ 
    			cout<<"Yes"<<endl;
    		}else{ 
    			cout<<"No"<<endl;
    		}
    	}
    	return 0;
    }

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzkyMjA5Mw_size_16_color_FFFFFF_t_70_pic_center]: /images/20210920/33f4f1d7993b4eb1b86501243f42baed.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzkyMjA5Mw_size_16_color_FFFFFF_t_70_pic_center 1]: /images/20210920/e31fb10c2a934ddcb1deef75de6ed23e.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzkyMjA5Mw_size_16_color_FFFFFF_t_70_pic_center 2]: /images/20210920/490ab8f20f264687b8b4a23f31c42254.png