MRECT1 - Điểm trên cạnh hình chữ nhật - HRASTOVI

Tác giả: ll931110

Ngôn ngữ: C++

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
using namespace std;

vector< pair<int,int> > X,Y;
int n,p;

int segX(pair<int,int> u,pair<int,int> v)
{
    return upper_bound(X.begin(),X.end(),v) - lower_bound(X.begin(),X.end(),u);
};

int segY(pair<int,int> u,pair<int,int> v)
{
    return upper_bound(Y.begin(),Y.end(),v) - lower_bound(Y.begin(),Y.end(),u);
};

int main()
{
//    freopen("hras.in","r",stdin);
//    freopen("hras.ou","w",stdout);
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        int x,y;
        scanf("%d %d", &x, &y);
        X.push_back(make_pair(x,y));
        Y.push_back(make_pair(y,x));
    };
    sort(X.begin(),X.end());
    sort(Y.begin(),Y.end());
    scanf("%d", &p);
    for (int i = 0; i < p; i++)
    {
        int x1,y1,x2,y2;
        scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
        int ret = 0;
        ret += segX(make_pair(x1,y1),make_pair(x1,y2));
        ret += segX(make_pair(x2,y1),make_pair(x2,y2));
        ret += segY(make_pair(y1,x1 + 1),make_pair(y1,x2 - 1));
        ret += segY(make_pair(y2,x1 + 1),make_pair(y2,x2 - 1));
        printf("%d\n", ret);
    };
};

Download