Pagini recente » Cod sursa (job #2557931) | Cod sursa (job #556548) | Cod sursa (job #2569614) | Cod sursa (job #2747426) | Cod sursa (job #2053240)
#include<cstdio>
#include<vector>
using namespace std;
const int p1=1009;
const int p2=37193;
int H(int x,int y)
{
return (x*p1+y)%p2;
}
vector<int>gx[p2+1];
vector<int>gy[p2+1];
int main()
{
freopen("ograzi.in","r",stdin);
freopen("ograzi.out","w",stdout);
int n,m,w,h,i,x,y,j,nr=0;
scanf("%d%d%d%d",&n,&m,&w,&h);
for(i=1; i<=n; ++i)
{
scanf("%d%d",&x,&y);
gx[H(x/w,y/h)].push_back(x);
gy[H(x/w,y/h)].push_back(y);
}
for(i=1; i<=m; ++i)
{
scanf("%d%d",&x,&y);
int val;
bool ok=0;
val=H(x/w,y/h);
for(j=0; j<gx[val].size()&&j<gy[val].size(); ++j)
{
int vx=gx[val][j];
int vy=gy[val][j];
if(x>=vx&&x<=vx+w&&y>=vy&&y<=vy+h)
{
nr++;
ok=1;
break;
}
}
if(!ok&&(y/h))
{
val=H(x/w,y/h-1);
for(j=0; j<gx[val].size()&&j<gy[val].size(); ++j)
{
int vx=gx[val][j];
int vy=gy[val][j];
if(x>=vx&&x<=vx+w&&y>=vy&&y<=vy+h)
{
nr++;
ok=1;
break;
}
}
}
if(!ok&&(x/w))
{
val=H(x/w-1,y/h);
for(j=0; j<gx[val].size()&&j<gy[val].size(); ++j)
{
int vx=gx[val][j];
int vy=gy[val][j];
if(x>=vx&&x<=vx+w&&y>=vy&&y<=vy+h)
{
nr++;
ok=1;
break;
}
}
}
if(!ok&&(x/w)&&(y/h))
{
val=H(x/w-1,y/h-1);
for(j=0; j<gx[val].size()&&j<gy[val].size(); ++j)
{
int vx=gx[val][j];
int vy=gy[val][j];
if(x>=vx&&x<=vx+w&&y>=vy&&y<=vy+h)
{
nr++;
ok=1;
break;
}
}
}
}
printf("%d\n",nr);
return 0;
}