Pagini recente » Cod sursa (job #3202678) | Cod sursa (job #1847996) | Cod sursa (job #956017) | Cod sursa (job #1535291) | Cod sursa (job #2636011)
#include <bits/stdc++.h>
using namespace std;
ifstream f("ograzi.in");
ofstream g("ograzi.out");
map<pair<int,int>,pair<int,int>> mp;
int n,m,w,h,nr;
void verif(pair<int,int> a, pair<int,int> b)
{
if (a.first<=b.first && a.first+w>=b.first && a.second<=b.second && a.second+h>=b.second)
++nr;
}
int main()
{
f>>n>>m>>w>>h;
for(int i=1; i<=n; i++)
{
int x,y;
f>>x>>y;
int X=x,Y=y;
x=(x+w-1)/w;
y=(y+h-1)/h;
mp[ {x,y}]= {X,Y};
}
for(int i=1; i<=m; i++)
{
int x,y;
f>>x>>y;
int X=x,Y=y;
x=(x+w-1)/w;
y=(y+h-1)/h;
pair<int,int> k={X,Y};
verif(mp[{x,y}],k);
verif(mp[{x-1,y}],k);
verif(mp[{x,y-1}],k);
verif(mp[{x-1,y-1}],k);
}
g<<nr<<'\n';
return 0;
}