Cod sursa(job #309141)
Utilizator | Puscas Sergiu harababurel | Data | 29 aprilie 2009 19:41:15 |
---|---|---|---|
Problema | Grendizer | Scor | 20 |
Compilator | cpp | Status | done |
Runda | tot | Marime | 1.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main() {
long n,m,r, manhattan;
int rezultat=0, modulunu=0, moduldoi=0;
ifstream f;
f.open("grendizer.in");
ofstream g;
g.open("grendizer.out");
f>>n>>m;
long i,j,x,y;
int v[100000];
int w[100000];
for(i=1; i<=n; i++) {
f>>v[i]>>w[i];
}
for(j=1; j<=m; j++) {
f>>x>>y>>r;
rezultat=0;
modulunu=0;
moduldoi=0;
for(i=1; i<=n; i++) {
if(x-v[i]>=0) {
modulunu=x-v[i];
}
else if(x-v[i]<0) {
modulunu=-x+v[i];
}
if(y-w[i]>=0) {
moduldoi=y-w[i];
}
else if(y-w[i]<0) {
moduldoi=-y+w[i];
}
manhattan=modulunu+moduldoi;
if(manhattan==r) {
rezultat++;
}
}
g<<rezultat<<endl;
}
f.close();
g.close();
return 0;
}