13552번: 구와 쿼리 ↗

/*
[13552: 구와 쿼리](https://www.acmicpc.net/problem/13552)

Tier: Bronze 1 
Category: geometry, geometry_3d, pythagoras
*/


#include <bits/stdc++.h>

using namespace std;

#define for1(s, e) for(int i = s; i < e; i++)
#define for1j(s, e) for(int j = s; j < e; j++)
#define forEach(k) for(auto i : k)
#define forEachj(k) for(auto j : k)
#define sz(vct) vct.size()
#define all(vct) vct.begin(), vct.end()
#define sortv(vct) sort(vct.begin(), vct.end())
#define uniq(vct) sort(all(vct));vct.erase(unique(all(vct)), vct.end())
#define fi first
#define se second
#define INF (1ll << 60ll)

typedef unsigned long long ull;
typedef long long ll;
typedef ll llint;
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef ull ullint;

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<double, int> pdi;
typedef pair<string, string> pss;

typedef vector<int> iv1;
typedef vector<iv1> iv2;
typedef vector<ll> llv1;
typedef vector<llv1> llv2;

typedef vector<pii> piiv1;
typedef vector<piiv1> piiv2;
typedef vector<pll> pllv1;
typedef vector<pllv1> pllv2;
typedef vector<pdd> pddv1;
typedef vector<pddv1> pddv2;

const double EPS = 1e-8;
const double PI = acos(-1);

template<typename T>
T sq(T x) { return x * x; }

int sign(ll x) { return x < 0 ? -1 : x > 0 ? 1 : 0; }
int sign(int x) { return x < 0 ? -1 : x > 0 ? 1 : 0; }
int sign(double x) { return abs(x) < EPS ? 0 : x < 0 ? -1 : 1; }

struct Point {
  ll x, y, z;
};

struct Sphere {
  Point center;
  ll radius;
};

void solve() {
  ll n, m;

  vector<Point> points;

  cin >> n;

  for1(0, n) {
    Point p;
    cin >> p.x >> p.y >> p.z;
    points.push_back(p);
  }

  cin >> m;

  for1(0, m) {
    Sphere sphere;
    cin >> sphere.center.x >> sphere.center.y >> sphere.center.z >> sphere.radius;

    ll count = 0;

    for(auto &point : points) {
      ll dist = sq(point.x - sphere.center.x) + sq(point.y - sphere.center.y) + sq(point.z - sphere.center.z);
      if (dist <= sq(sphere.radius)) {
        count++;
      }
    }

    cout << count << '\n';
  }

}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);cout.tie(NULL);
  int tc = 1; // cin >> tc;
  while(tc--) solve();
  
}