Pagini recente » Cod sursa (job #1480997) | Cod sursa (job #1213925) | Cod sursa (job #1052145) | Cod sursa (job #192839) | Cod sursa (job #1733828)
#include <fstream>
#include <utility>
#include <vector>
using namespace std;
#define Mod 666013
class InputReader
{
public:
InputReader() {}
InputReader(const char* file_name)
{
input_file = fopen(file_name,"r");
cursor = 0;
fread(buf,SIZE,1,input_file);
}
inline InputReader &operator >> (int& n)
{
n = 0;
while (buf[cursor] < '0' || buf[cursor] > '9')
advance();
while (buf[cursor] >= '0' && buf[cursor] <= '9')
{
n = n * 10 + buf[cursor] - '0';
advance();
}
return *this;
}
private:
static const int SIZE = 1<<17;
char buf[SIZE];
int cursor = 0;
FILE* input_file;
void advance()
{
cursor++;
if (cursor == SIZE)
{
cursor = 0;
fread(buf,SIZE,1,input_file);
}
}
};
int N,M,W,H;
int h(int x,int y)
{
return (x*31 + y) % Mod;
}
vector< pair<int,int> > Hash[Mod];
bool get(int X,int Y,int x,int y)
{
int i = h(X,Y);
for (auto j: Hash[i])
if (x >= j.first && y >= j.second && x <= j.first + W && y <= j.second + H) return 1;
return 0;
}
int main()
{
InputReader fin = InputReader("ograzi.in");
ofstream fout("ograzi.out");
int x,y,X,Y;
fin >> N >> M >> W >> H;
for (int i = 1; i <= N; i++)
{
fin >> x >> y;
X = x/W*W; Y = y/H*H;
Hash[h(X,Y)].push_back(make_pair(x,y));
}
int Sol = 0;
for (int i = 1; i <= M; i++)
{
fin >> x >> y;
X = x / W * W;
Y = y / H * H;
if (get(X,Y,x,y)) Sol++;
else if (get(X-W,Y,x,y)) Sol++;
else if (get(X-W,Y-H,x,y)) Sol++;
else if (get(X,Y-H,x,y)) Sol++;
}
fout << Sol << "\n";
}