Photo Op | Code Joint

Farmer John's farm is full of lush vegetation and every cow wants a photo of its natural beauty. Unfortunately, Bessie still has places to be, but she doesn't want to disrupt any photo ops.

Bessie is currently standing at $(X, 0)$ on the XY-plane and she wants to get to $(0, Y)$ ( $1 \leq X, Y \leq 1 0^{6}$ ). Unfortunately, $N$ ( $1 \leq N \leq 3 \cdot 1 0^{5}$ ) other cows have decided to pose on the $X$ axis. More specifically, cow $i$ will be positioned at $(x_{i}, 0)$ with a photographer at $(0, y_{i})$ where $(1 \leq x_{i}, y_{i} \leq 1 0^{6})$ ready to take their picture. They will begin posing moments before time $s_{i}$ ( $1 \leq s_{i} < T$ ) and they will keep posing for a very long time (they have to get their picture just right). Here, $1 \leq T \leq N + 1$ .

Bessie knows the schedule for every cow's photo op, and she will take the shortest Euclidean distance to get to her destination, without crossing the line of sight from any photographer to their respective cow (her path will consist of one or more line segments).

If Bessie leaves at time $t$ , she will avoid the line of sights for all photographer/cow pairs that started posing at time $s_{i} \leq t$ , and let the distance to her final destination be $d_{t}$ . Determine the values of $⌊ d_{t} ⌋$ for each integer $t$ from $0$ to $T - 1$ inclusive.

For $t = 0$ the answer is $⌊ 149 ⌋ = 12$ .

For $t = 1$ the answer is $⌊ 14 + 5 ⌋ = 16$ .

For $t = 5$ the answer is $⌊ 1 + 9^{2} + 7^{2} + 2 ⌋ = 14$ . Path: $(8, 0) \to (9, 0) \to (0, 7) \to (0, 9)$

SCORING:

Inputs 4-6: $N \leq 100$
Inputs 7-9: $N \leq 3000$
Inputs 10-12: $T \leq 10$
Inputs 13-18: No additional constraints

Problem credits: Suhas Nagar

Source: USA Computing Olympiad.

Input Format

The first line of input contains $N$ and $T$ , representing the number of cows posing on the $x$ -axis and the timeframe that Bessie could leave at.

The second line of input contains $X$ and $Y$ , representing Bessie's starting $X$ coordinate and her target $Y$ coordinate respectively.

The next $N$ lines contain $s_{i}$ $x_{i}$ and $y_{i}$ . It is guaranteed that all $x_{i}$ are distinct from each other and $X$ , and all $y_{i}$ are distinct from each other and $Y$ . All $s_{i}$ will be given in increasing order, where $s_{i} \leq s_{i + 1}$ .

Output Format

Print $T$ lines, with the $t$ th (0-indexed) line containing $⌊ d_{t} ⌋$ .

Sample Input 1

4 5 6 7 1 7 5 2 4 4 3 1 6 4 2 9

Sample Output 1

9 9 9 10 12

Sample Input 2

2 3 10 7 1 2 10 1 9 1

Sample Output 2

12 16 16

Sample Input 3

5 6 8 9 1 3 5 1 4 1 3 10 7 4 9 2 5 6 6

Sample Output 3

12 12 12 12 14 14

Submit

Language