2019牛客多校赛第8场 D Distance 三维树状数组

链接：https://ac.nowcoder.com/acm/contest/888/D
来源：牛客网
题目：

Gromah and LZR have entered the fourth level. There is a blank cube with size  n×m×h hanging on the wall.

Gromah soon finds a list beside the cube, there are q​ instructions in the list and each instruction is in one of the following two formats:

1. (1,x,y,z)​, meaning to add a tag on position(x,y,z)​ in the cube

2. (2,x,y,z)​, meaning to determine the minimum Manhattan Distance to the given position (x,y,z)​ among all tagged positions

Manhattan Distance between two positions (x1,y1,z1),(x2,y2,z2) is defined as ∣x1−x2∣+∣y1−y2∣+∣z1−z2∣。

LZR also finds a note board saying that the password of this level is the sequence made up of all results of the instructions in format 2.

Please help them get all results of the instructions in format 2.

输