leetcode

0 class Solution {

1 public:

2 vector<int> countPoints(const vector<vector<int>> &points, const vector<vector<int>> &queries) {

3 vector<int> res(queries.size(), 0);

4 for (int i = 0; i < queries.size(); i++) {

5 int r2 = queries[i][2] * queries[i][2];

6 for (int j = 0; j < points.size(); j++) {

7 int dx = points[j][0] - queries[i][0];

8 int dy = points[j][1] - queries[i][1];

9 if (dx * dx + dy * dy <= r2) res[i]++;

10 }

11 }

12 return res;

13 }

14 };