CCF-风险检测点-python3

新增知识点：

        python计算x的y次幂

                pow(x, y)

        python如何自定义类

             

class Point:
    def __init__(self, id, dis):
        self.id = id
        self.dis = dis

# 实例化类
point = Point(1,2)
print(point)
print(point.id,point.dis)

          python如何对自定义类按照某种要求进行排序：

ps = []
ps.append(Point(1, 2))
ps.append(Point(2, 1))
ps.append(Point(3, 2))
ps.append(Point(4, 1))
ps.append(Point(5, 2))

# 先按照距离排序，若距离相同按照id排序---从小到大
ps.sort(key=lambda p:(p.dis, p.id))

        java使用Comparator接口实现自定义排序：

        

// java使用Comparator接口对自定义类进行自定义排序

class Point{
    int id;
    int dis;
    public Point(id, dis){
        this.id = id;
        this.dis = dis;
    }
    public int getId(){
        return this.id;
    }
    public void setId(int id){
        this.id = id;
    }
    public int getDis(){
        return this.dis;
    }
    public void setDis(int dis){
        this.dis= dis;
    }
}

class Main implements Comparator<Point>{
    public static void main(String[] args){
        ...
    }
    public void compare(Point p1, Point p2){
        if (p1.dis < p2.dis){
            return 1;
        }else if (p1.ids > p2.dis){
            return 0;
        }else if (p1.dis == p2.dis){
            if (p1.id <= p2.id){
                return 1;
            }else{
                return 0;
            }
        }
    }
}

'''
n个检测点
每个检测点的坐标(xi, yi)
市民位置(X, Y)
求距离市民最近的三个检测点（距离相同，取编号小的）
'''

class Point:
    def __init__(self, id, dis):
        self.id = id
        self.dis = dis

finput = input()
n = int(finput.split(' ')[0])
X = int(finput.split(' ')[1])
Y = int(finput.split(' ')[2])
points = []  # 存储各检测点的id和distence
for i in range(0, n):
    pos = input()
    xi = int(pos.split(' ')[0])
    yi = int(pos.split(' ')[1])
    dis = pow((X-xi), 2) + pow((Y-yi), 2)
    point = Point(i+1, dis)
    points.append(point)
points.sort(key=lambda point:(point.dis, point.id))
for i in range(0, 3):
    print(points[i].id)