Cod sursa(job #2657888)

Utilizator refugiatBoni Daniel Stefan refugiat Data 12 octombrie 2020 16:32:22
Problema Ograzi Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2.05 kb
#include <iostream>
#include <cstdio>
#include <cctype>
#include <vector>
#define MOD 131071
using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};
InParser si("ograzi.in");
FILE* so=fopen("ograzi.out", "w");

vector<pair<int, int> > hs[MOD];
int n, m, w, h;
int ans=0;
void verif(int cod, pair<int, int> coord) {
    if(cod<0)
        return;
    for(int i=0; i<hs[cod].size(); ++i) {
        if(hs[cod][i].first<=coord.first&&coord.first<=hs[cod][i].first+w&&hs[cod][i].second<=coord.second&&coord.second<=hs[cod][i].second+h)
            ans++;
    }

}

int main() {
    si>>n;
    si>>m;
    si>>w;
    si>>h;
    for(int i=1;i<=n;i++) {
        int x, y;
        si>>x;
        si>>y;
        int x2, y2;
        x2=(x+w-1)/w;
        y2=(y+h-1)/h;
        hs[(x2*100+y2)%MOD].push_back({x, y});
    }
    for(int i=1;i<=m;i++) {
        int x, y;
        si>>x;
        si>>y;
        int x2, y2;
        x2=(x+w-1)/w;
        y2=(y+h-1)/h;
        verif((x2*100+y2)%MOD, {x, y});
        verif(((x2-1)*100+y2)%MOD, {x, y});
        verif(((x2-1)*100+y2-1)%MOD, {x, y});
        verif((x2*100+y2-1)%MOD, {x, y});
    }
    fprintf(so, "%i\n", ans);
    return 0;
}