NUCLEAR - Hai nhà máy điện nguyên tử

Tác giả: hieult

Ngôn ngữ: C++

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>

#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(int i = (a); i >= (b); --i)
//#define Fit(i,v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
//#define Fitd(i,v) for(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))

template<class F, class T> T convert(F a, int p = -1) { stringstream ss; if (p >= 0) ss << fixed << setprecision(p); ss << a; T r; ss >> r; return r; }
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> T sqr(T x) { return x * x; }
template<class T> T cube(T x) { return x * x * x; }
template<class T> int getbit(T s, int i) { return (s >> i) & 1; }
template<class T> T onbit(T s, int i) { return s | (T(1) << i); }
template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); }
template<class T> int cntbit(T s) { return s == 0 ? 0 : cntbit(s >> 1) + (s & 1); }

const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
    if (rsz <= 0) {
        ptr = 0;
        rsz = (int) fread(bf, 1, bfsz, stdin);
        if (rsz <= 0)
            return EOF;
    }
    --rsz;
    return bf[ptr++];
}
void ga(char &c) {
    c = EOF;
    while (!isalpha(c))
        c = gc();
}
int gs(char s[]) {
    int l = 0;
    char c = gc();
    while (isspace(c))
        c = gc();
    while (c != EOF && !isspace(c)) {
        s[l++] = c;
        c = gc();
    }
    s[l] = '\0';
    return l;
}
template<class T> bool gi(T &v) {
    v = 0;
    char c = gc();
    while (c != EOF && c != '-' && !isdigit(c))
        c = gc();
    if (c == EOF)
        return false;
    bool neg = c == '-';
    if (neg)
        c = gc();
    while (isdigit(c)) {
        v = v * 10 + c - '0';
        c = gc();
    }
    if (neg)
        v = -v;
    return true;
}

typedef pair<int, int> II;

const ld PI = acos(-1.0);
const ld eps = 1e-13;

const int dr[] = {0, +1, 0, -1};
const int dc[] = {+1, 0, -1, 0};

const int inf = (int)1e9 + 5;
const ll linf = (ll)1e16 + 5;
const ll mod = (ll)1e9 + 7;

#define maxn 200005

struct Point{
	ll x, y;
	Point(){};
	Point(ll _x, ll _y){
		x = _x; y = _y;
	}
};

struct Query{
	ll r1, r2;
	int id;
	Query(){};
	Query(ll _r1, ll _r2, int _id){
		r1 = _r1; r2 = _r2; id = _id;
	}
	bool operator <(const Query &Q)const{
		return r1 > Q.r1;
	}
}q[maxn];

struct Dist{
	ll d1, d2;
	Dist(){};
	Dist(ll _d1, ll _d2){
		d1 = _d1; d2 = _d2;
	}
	bool operator <(const Dist &D)const{
		return d1 > D.d1;
	}
}D[maxn];

int n, m, f[maxn], a[maxn * 2];
Point P[maxn], A, B;
vector<ll> V;

ll sqrDist(Point P0, Point P1){
	return sqr(P0.x - P1.x) + sqr(P0.y - P1.y);
}

void update(int u){
	for(int i = u; i > 0; i -= i & -i)
		a[i]++;
}

int get(int u){
	int res = 0;
	for(int i = u; i < maxn * 2; i += i & -i){
		res += a[i];
	}
	return res;
}

int main(){
//	freopen("in.txt", "r", stdin);

	cin >> n;
	Rep(i, n){
		scanf("%lld %lld", &P[i].x, &P[i].y);
	}

	scanf("%lld %lld %lld %lld %d", &A.x, &A.y, &B.x, &B.y, &m);
	Rep(i, m) {
		scanf("%lld %lld", &q[i].r1, &q[i].r2);
		q[i].r1 = sqr(q[i].r1);
		q[i].r2 = sqr(q[i].r2);
		q[i].id = i;
	}

	Rep(i, n){
		D[i] = Dist(sqrDist(P[i], A), sqrDist(P[i], B));
	}

	Rep(i, n) V.pb(D[i].d2);
	Rep(i, m) V.pb(q[i].r2);
	sort(all(V));
	Rep(i, n) D[i].d2 = lower_bound(all(V), D[i].d2) - V.begin() + 1;
	Rep(i, m) q[i].r2 = lower_bound(all(V), q[i].r2) - V.begin() + 1;

	sort(D, D + n);
	sort(q, q + m);
	ms(a, 0);

	int run = -1;
	Rep(i, m){
		while(run + 1 < n && D[run + 1].d1 > q[i].r1) {
			run++;
			update(D[run].d2);
		}
		f[q[i].id] = n - get(q[i].r2 + 1);
	}

	Rep(i, m) printf("%d\n", f[i]);

    return 0;
}

Download