nyoj 1241 Distribution 第八届河南省程序设计大赛

Distribution

时间限制：1000 ms  |  内存限制：65535 KB

难度：1

描述

One day , Wang and Dong in the Dubai desert expedition, discovered an ancient castle. Fortunately, they found a map of the castle.The map marks the location of treasures.

They agreed to distribute the treasures according to the following rules:

Wang draws a horizontal line on the map and then Dong draws a vertical one so that the map is divided into 4 parts, as show below. 

Wang will save the treasures in I and III ,while those situated in II and IV will be taken away by Dong. Wang first draw a horizontal line, Dong after the draw a vertical line.

They drew several pairs of  lines. For each pair, Wang wants to know the difference between their treasures.

It's guaranteed that all the reasures will lie on neither of the lines drew by them.

输入

the first line contains two integers N and M, where N is the number of treasures on the map and M indicates how many times they are going to draw the lines. The 2nd to (N+1)-th lines Xi, Yi contain the co-ordinates of the treasures and the last M lines consist of the M pairs integers (X, Y) which means that the two splitting lines intersect at point (X, Y).
( 0 < N, M ≤ 100, 0 ≤ Xi, Yi, X,Y ≤ 1000 )

输出

Output contains M lines , a single line with a integer , the difference described above

样例输入

10 3 29 2217 14 18 233 156 2830 274 126 78 011 212 255 1019 24

样例输出

-6

4

4

来源

第八届河南省程序设计大赛

 #include<stdio.h>struct node{ int x,y;}num[1005];int main(){ int m,n; int i,j; int sumw,sumk; scanf("%d %d",&m,&n); for(i=0;i<m;i++) {  scanf("%d %d",&num[i].x,&num[i].y); } int a,b; while(n--) {  sumw=0,sumk=0;  scanf("%d %d",&a,&b);  for(i=0;i<m;i++)  {   if((num[i].x>a&&num[i].y>b)||(num[i].x<a&&num[i].y<b)) sumw++;   if((num[i].x<a&&num[i].y>b)||(num[i].x>a&&num[i].y<b)) sumk++;  }  printf("%d\n",sumw-sumk); } return 0;}