You and your companions live in n houses. Each house is situated on a 2D plane, in a point with integer organizes. There may be various houses situated in a similar point. The chairman of the city is requesting you for places for the structure from the Eastern show. You need to track down the number of spots (focuses with integer arranges), so the outline distance from every one of the houses to the show is
Correct answer will be upvoted else downvoted. Computer science.
You and your companions live in n houses. Each house is situated on a 2D plane, in a point with integer organizes. There may be various houses situated in a similar point. The chairman of the city is requesting you for places for the structure from the Eastern show. You need to track down the number of spots (focuses with integer arranges), so the outline distance from every one of the houses to the show is insignificant. The display can be inherent a similar point as some house. The distance between two focuses (x1,y1) and (x2,y2) is |x1−x2|+|y1−y2|, where |x| is the outright worth of x.
Input
First line contains a solitary integer t (1≤t≤1000) — the number of experiments.
The principal line of each experiment contains a solitary integer n (1≤n≤1000). Next n lines portray the places of the houses (xi,yi) (0≤xi,yi≤109).
It's reliable that the amount of everything n doesn't surpass 1000.
Output
For each experiment output a solitary integer - the number of various situations for the presentation. The show can be inherent a similar point as some house.
Step by step
Solved in 4 steps with 1 images
