P8503 - Dusk Moon

内存限制：128 MB 时间限制：11 S 标准输入输出

题目类型：传统评测方式：文本比较上传者：

提交：1 通过：1

You are given points $p_{1}, p_{2}, \dots, p_{n}$ on the 2D plane. You need to perform operations. Each operation is one of the following:

1 k x y

'' (

1 \leq k \leq n

1 \leq x, y \leq 1 0^{8}

): Change the coordinate of the point

p_{k}

into

2 l r

'' (

1 \leq l \leq r \leq n

): Find the minimum non-negative integer

such that you can cover all the points

p_{l}, p_{l + 1}, \dots, p_{r}

using a single circle whose radius is

Note that a point is considered to be covered if and only if it is inside the circle or on the border of the circle.

The first line contains a single integer ( $1 \leq T \leq 3$ ), the number of test cases. For each test case:

The first line of the input contains two integers and ( $1 \leq n, q \leq 100, 000$ ), denoting the number of points and the number of operations.

In the next lines, the th line contains two integers x $_{i}$ and $y_{i}$ ( $1 \leq x_{i}, y_{i} \leq 1 0^{8}$ ), describing the coordinate of $p_{i}$ .

Each of the next lines describes an operation in formats described in the statement above.

It is guaranteed that all the values of $x_{i}$ , $y_{i}$ , $x$ , $y$ are chosen uniformly at random from integers in their corresponding ranges. The randomness condition does not apply to the sample test case, but your solution must pass the sample as well.

For each query, print a single line containing an integer, denoting the minimum radius.

2022 杭电多校第三场

8503: Dusk Moon

题目描述

输入格式

输出格式

输入样例复制

输出样例复制

分类标签