2 2 2 0 0 0 -1 0 1 0
2 1 The Manhattan distance between the first student and each checkpoint is: * For checkpoint $1$: $|2-(-1)|+|0-0|=3$ * For checkpoint $2$: $|2-1|+|0-0|=1$ The nearest checkpoint is checkpoint $2$. Thus, the first line in the output should contain $2$. The Manhattan distance between the second student and each checkpoint is: * For checkpoint $1$: $|0-(-1)|+|0-0|=1$ * For checkpoint $2$: $|0-1|+|0-0|=1$ When there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain $1$.
3 4 10 10 -10 -10 3 3 1 2 2 3 3 5 3 5
3 1 2 There can be multiple checkpoints at the same coordinates.
5 5 -100000000 -100000000 -100000000 100000000 100000000 -100000000 100000000 100000000 0 0 0 0 100000000 100000000 100000000 -100000000 -100000000 100000000 -100000000 -100000000
5 4 3 2 1
{
"problem": {
"name": "Checkpoints",
"description": {
"content": "There are $N$ students and $M$ checkpoints on the $xy$\\-plane. The coordinates of the $i$\\-th student $(1 \\leq i \\leq N)$ is $(a_i,b_i)$, and the coordinates of the checkpoint numbered $j$ $(1 \\leq ",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc057_b"
},
"statements": [
{
"statement_type": "Markdown",
"content": "There are $N$ students and $M$ checkpoints on the $xy$\\-plane. \nThe coordinates of the $i$\\-th student $(1 \\leq i \\leq N)$ is $(a_i,b_i)$, and the coordinates of the checkpoint numbered $j$ $(1 \\leq ...",
"is_translate": false,
"language": "English"
}
]
}