Pagini recente » Cod sursa (job #36097) | Cod sursa (job #110356) | Cod sursa (job #60667) | Cod sursa (job #2336965) | Cod sursa (job #62969)
Cod sursa(job #62969)
#include<stdio.h>
long int x[16001], y[16001],n,x1,x2,y1,y2,m,i,j,k,is;
void swap(int a,int b)
{ int aux;
aux=x[a]; x[a]=x[b]; x[b]=aux;
aux=y[a]; y[a]=y[b]; y[b]=aux;
}
int heapdown(long int p, long int k)
{ if(p>k/2) return 0;
is=2*p;
if(p<k/2) if(x[2*p]<x[2*p+1]) is=2*p+1;
if(x[p]<x[is]){ swap(p,is); heapdown(is,k);}
return 0;
}
int main()
{ FILE *f=fopen("zoo.in","r");
FILE *g=fopen("zoo.out","w");
fscanf(f,"%ld",&n);
for(i=1;i<=n;i++) fscanf(f,"%ld%ld",&x[i],&y[i]);
for(i=n/2;i>=1;i--) heapdown(i,n);
for(i=n;i>=1;i--) { swap(1,i);
heapdown(1,i-1);
}
fscanf(f,"%ld",&m);
for(i=1;i<=m;i++)
{ fscanf(f,"%ld%ld%ld%ld",&x1,&y1,&x2,&y2);
k=0;
for(j=1;j<=n;j++) if(x[j]>=x1)
{ if(x[j]<=x2) if(y[j]>=y1) if(y[j]<=y2) k++;
else break;
}
fprintf(g,"%ld\n",k);
}
fcloseall();
return 0;
}