题意:判断每条直线是否都能将AB两类点都分割开。
思路:以第一个A点做标准,看其他的A点是否都和它在同一侧,或是否有B点和它同一侧,将所有点都扫描遍历一遍即可。
代码实现:
import java.util.*;
public class Main {
public static class node{
int x, y;
public node(int x, int y){
this.x = x;
this.y = y;
}
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String [] str1 = in.nextLine().split(" ");
int n = Integer.parseInt(str1[0]);
int m = Integer.parseInt(str1[1]);
node [] a = new node[1010];
node [] b = new node[1010];
int ta = 0, tb = 0;
while(n-->0){
String [] str2 = in.nextLine().split(" ");
int x = Integer.parseInt(str2[0]);
int y = Integer.parseInt(str2[1]);
char z = str2[2].charAt(0);
if(z=='A') a[++ta] = new node(x, y);
else b[++tb] = new node(x, y);
}
while(m-->0){
int z = in.nextInt();
int x = in.nextInt();
int y = in.nextInt();
boolean side = true, ans = true;
if(ta!=0) side = a[1].x*x+a[1].y*y+z>0;
else side = b[1].x*x+b[1].y*y+z>0;
for(int i = 2; i <= ta; i ++){
if(a[i].x*x+a[i].y*y+z>0!=side){
ans = false;
break;
}
}
if(ans==true){
for(int i = 1; i <= tb; i ++){
if(b[i].x*x+b[i].y*y+z>0==side){
ans = false;
break;
}
}
}
if(ans==true) System.out.println("Yes");
else System.out.println("No");
}
}
}