0 结果
难点:如何判断点在直线的那一侧
1 题目
2 思路
- 1 把A类的点坐标带入直线方程式(k1+k2X+k3Y)中,如果计算(并记录值的正负)出的值全部大于或者小于(由于点不落在直线上,因此不存在为0的情况),那么执行步骤2,否则,输出No,结束;
- 2 计算B类的点坐标带入直线方程式(k1+k2X+k3Y)中的值,如果计算出的值的符号和A类点的计算出的符号同号,输出No,结束,否则继续计算;
- 3 计算完两类点,但是没有输出No,则输出Yes。
3 代码实现
3.1 使用std::vector<std::pair<int,int>>可能会爆编译错误
#include<cstdio>
#include<vector>
#include<utility>
void Judge(const std::vector<std::pair<int, int>>& A, const std::vector<std::pair<int, int>>& B, int var1, int var2, int var3){
bool firstAssignment = true;
bool symbol;//zheng--true, fu--false
for(std::vector<std::pair<int, int>>::const_iterator i = A.begin();i != A.end();i++){
if(firstAssignment == true){
firstAssignment = false;
if(var1 + i->first*var2 + i->second*var3 > 0){
symbol = true;
}else{
symbol = false;
}
}else{
if(var1 + i->first*var2 + i->second*var3 > 0 && symbol == false){
printf("No");
return;
}else if(var1 + i->first*var2 + i->second*var3 < 0 && symbol == true){
printf("No");
return;
}
}
}
for(std::vector<std::pair<int, int>>::const_iterator i = B.begin();i != B.end();i++){
if(var1 + i->first*var2 + i->second*var3 > 0 && symbol == true){
printf("No");
return;
}else if(var1 + i->first*var2 + i->second*var3 < 0 && symbol == false){
printf("No");
return;
}
}
printf("Yes");
}
int main(){
int n, m;
std::vector<std::pair<int, int>>A, B;
scanf("%d%d", &n, &m);
while(n--){
int x, y;
char letter;
scanf("%d %d %c", &x, &y, &letter);
std::pair<int, int> tempPoint;
tempPoint.first = x;
tempPoint.second = y;
if(letter == 'A'){
A.push_back(tempPoint);
}else{
B.push_back(tempPoint);
}
}
bool firstLineFeed = true;
while(m--){
int var1, var2, var3;
scanf("%d%d%d", &var1, &var2, &var3);
if(firstLineFeed == true){
firstLineFeed = false;
}else{
printf("\n");
}
Judge(A, B, var1, var2, var3);
}
return 0;
}
/*
9 3
1 1 A
1 0 A
1 -1 A
2 2 B
2 3 B
0 1 A
3 1 B
1 3 B
2 0 A
0 2 -3
-3 0 2
-3 1 1
*/
3.2 使用struct代替
#include<cstdio>
#include<vector>
#include<utility>
typedef struct Data{
int first;
int second;
}data;
void Judge(const std::vector<data>& A, const std::vector<data>& B, int var1, int var2, int var3){
bool firstAssignment = true;
bool symbol;//zheng--true, fu--false
for(std::vector<data>::const_iterator i = A.begin();i != A.end();i++){
if(firstAssignment == true){
firstAssignment = false;
if(var1 + i->first*var2 + i->second*var3 > 0){
symbol = true;
}else{
symbol = false;
}
}else{
if(var1 + i->first*var2 + i->second*var3 > 0 && symbol == false){
printf("No");
return;
}else if(var1 + i->first*var2 + i->second*var3 < 0 && symbol == true){
printf("No");
return;
}
}
}
for(std::vector<data>::const_iterator i = B.begin();i != B.end();i++){
if(var1 + i->first*var2 + i->second*var3 > 0 && symbol == true){
printf("No");
return;
}else if(var1 + i->first*var2 + i->second*var3 < 0 && symbol == false){
printf("No");
return;
}
}
printf("Yes");
}
int main(){
int n, m;
std::vector<data> A, B;
scanf("%d%d", &n, &m);
while(n--){
int x, y;
char letter;
scanf("%d %d %c", &x, &y, &letter);
data tempPoint;
tempPoint.first = x;
tempPoint.second = y;
if(letter == 'A'){
A.push_back(tempPoint);
}else{
B.push_back(tempPoint);
}
}
bool firstLineFeed = true;
while(m--){
int var1, var2, var3;
scanf("%d%d%d", &var1, &var2, &var3);
if(firstLineFeed == true){
firstLineFeed = false;
}else{
printf("\n");
}
Judge(A, B, var1, var2, var3);
}
return 0;
}
/*
9 3
1 1 A
1 0 A
1 -1 A
2 2 B
2 3 B
0 1 A
3 1 B
1 3 B
2 0 A
0 2 -3
-3 0 2
-3 1 1
*/