題目描述

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.???

II??????????????????????????????I

?

III?????????????????????????????IV

?

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 329 2217 1418 233 156 2830 274 126 78 011 212 255 1019 24

樣例輸出

-644

提示

AC代碼：

#include<iostream> #include<cstdio> using namespace std; int main() {int m,n;int x[101],y[101];int i;int a,b;int s,s1,s2;while(~scanf("%d %d",&m,&n)){for(i=0;i<m;i++)scanf("%d %d",&x[i],&y[i]);while(n--){s=s1=s2=0;scanf("%d %d",&a,&b); for(i=0;i<m;i++){if(x[i]>a&&y[i]>b)s++;else if(x[i]<a&&y[i]<b)s1++;else s2++;}printf("%d\n",s+s1-s2);}}return 0; }

總結

以上是生活随笔為你收集整理的第八届 省赛水题的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。