Pagini recente » Cod sursa (job #839591) | Cod sursa (job #1899338) | Cod sursa (job #1179816) | Cod sursa (job #642294) | Cod sursa (job #27207)
Cod sursa(job #27207)
#include <stdio.h>
#include <vector>
using namespace std;
#define LL long long
#define ff first
#define ss second
#define NR 1234567
#define NRB 49
int N, M, W, H;
int nr[1 << 16];
pair <int, int> hash[1 << 16][7];
int srch(int x, int y, int md)
{
int i;
for (i = 0; i < nr[md]; i++)
if (x - W <= hash[md][i].ff && hash[md][i].ff <= x && y - H <= hash[md][i].ss && hash[md][i].ss <= y) return 1;
return 0;
}
int main()
{
int i, x, y;
int md;
freopen("ograzi.in", "r", stdin);
freopen("ograzi.out", "w", stdout);
scanf("%d %d %d %d", &N, &M, &W, &H);
for (i = 1; i <= N; i++) {
scanf("%d %d", &x, &y);
md = ((LL) (x / W) * (y / H) * NR) >> NRB;
hash[md][nr[md]++] = make_pair(x, y);
if (nr[md] == 7) {
printf("0\n");
return 0;
}
}
int ww, hh, rez = 0;
for (i = 1; i <= M; i++) {
scanf("%d %d", &x, &y);
ww = x / W; hh = y / H;
md = ((LL) ww * hh * NR) >> NRB;
if (srch(x, y, md)) { rez++; continue; }
md = ((LL) (ww-1) * hh * NR) >> NRB;
if (srch(x, y, md)) { rez++; continue; }
md = ((LL) ww * (hh-1) * NR) >> NRB;
if (srch(x, y, md)) { rez++; continue; }
md = ((LL) (ww-1) * (hh-1) * NR) >> NRB;
if (srch(x, y, md)) { rez++; continue; }
}
printf("%d\n", rez);
fclose(stdin);
fclose(stdout);
return 0;
}