Pagini recente » Cod sursa (job #180196) | Cod sursa (job #1759717) | Cod sursa (job #884707) | Cod sursa (job #1598622) | Cod sursa (job #27221)
Cod sursa(job #27221)
#include <stdio.h>
#include <vector>
using namespace std;
#define LL long long
#define ff first
#define ss second
#define NR1 1432131513
#define NR2 1215123235
#define NRB 47
int N, M, W, H;
int nr1[1 << 18];
pair <int, int> hash1[1 << 18][5];
int nr2[1 << 18];
pair <int, int> hash2[1 << 18][5];
int srch(int x, int y, int md1, int md2)
{
int i;
for (i = 0; i < nr1[md1]; i++)
if (x - W <= hash1[md1][i].ff && hash1[md1][i].ff <= x && y - H <= hash1[md1][i].ss && hash1[md1][i].ss <= y) return 1;
for (i = 0; i < nr2[md2]; i++)
if (x - W <= hash2[md2][i].ff && hash2[md2][i].ff <= x && y - H <= hash2[md2][i].ss && hash2[md2][i].ss <= y) return 1;
return 0;
}
int main()
{
int i, x, y;
int md1, md2;
freopen("ograzi.in", "r", stdin);
freopen("ograzi.out", "w", stdout);
scanf("%d %d %d %d", &N, &M, &W, &H);
LL aux;
for (i = 1; i <= N; i++) {
scanf("%d %d", &x, &y);
aux = (LL) (x / W) * (y / H);
md1 = (aux * NR1) >> NRB;
md2 = (aux * NR2) >> NRB;
if (nr1[md1] == 5 && nr2[md2] == 5) {
printf("0\n");
return 0;
}
if (nr1[md1] <= nr2[md2]) hash1[md1][nr1[md1]++] = make_pair(x, y);
else hash2[md2][nr2[md2]++] = make_pair(x, y);
}
int ww, hh, rez = 0;
for (i = 1; i <= M; i++) {
scanf("%d %d", &x, &y);
ww = x / W; hh = y / H;
md1 = ((LL) ww * hh * NR1) >> NRB;
md2 = ((LL) ww * hh * NR2) >> NRB;
if (srch(x, y, md1, md2)) { rez++; continue; }
md1 = ((LL) (ww-1) * hh * NR1) >> NRB;
md2 = ((LL) (ww-1) * hh * NR2) >> NRB;
if (srch(x, y, md1, md2)) { rez++; continue; }
md1 = ((LL) ww * (hh-1) * NR1) >> NRB;
md2 = ((LL) ww * (hh-1) * NR2) >> NRB;
if (srch(x, y, md1, md2)) { rez++; continue; }
md1 = ((LL) (ww-1) * (hh-1) * NR1) >> NRB;
md2 = ((LL) (ww-1) * (hh-1) * NR2) >> NRB;
if (srch(x, y, md1, md2)) { rez++; continue; }
}
printf("%d\n", rez);
fclose(stdin);
fclose(stdout);
return 0;
}