Points Within Reach

Difficulty: 1200 6000 ms 128 MB

geometry

Given N points and Q circles, print how many points lie inside or on each circle.

Input: the first line has N; the next N lines are points; then a line with Q; then Q lines of cx cy r.

Output: one line per query.

Constraints:

• 1 ≤ N, Q ≤ 2×10³
• |coordinates| ≤ 10³
• 0 ≤ r ≤ 2000

Sample Tests

3
0 0
2 0
5 5
2
0 0 3
0 0 1

2
1

1
1 1
1
0 0 2

1

Read the Editorial