Pagini recente » Cod sursa (job #2026401) | Cod sursa (job #2391736) | Istoria paginii runda/concurnfo | Cod sursa (job #2074061) | Cod sursa (job #975919)
Cod sursa(job #975919)
#include<fstream>
#include<vector>
#define MOD 123331
using namespace std;
ifstream f("ograzi.in");
ofstream g("ograzi.out");
int sol,x00,y00,x11,y11,n,m,h,w,i,j,x,y,k,ok;
vector<pair<int,int> >has[MOD];
inline int key(int x,int y)
{
if(x<0||y<0)
return -1;
return (1LL*x*980123+y)%MOD;
}
int main()
{
f>>n>>m>>w>>h;
for(i=1;i<=n;++i)
{
f>>x>>y;
has[key(x/w,y/h)].push_back(make_pair(x,y));
}
for(i=1;i<=m;++i)
{
f>>x>>y;
ok=1;
for(x00=-1;x00<=0&&ok;++x00)
for(y00=-1;y00<=0&&ok;++y00)
{
k=key(x/w+x00,y/h+y00);
if(k==-1)
continue;
for(j=0;j<has[k].size()&&ok;++j)
{
x11=has[k][j].first;
y11=has[k][j].second;
if(x>=x11&&x<=x11+w&&y>=y11&&y<=y11+h)
{
++sol;
ok=0;
}
}
}
}
g<<sol<<'\n';
return 0;
}