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

最新推荐文章于 2024-06-08 11:29:48 发布

「已注销」

最新推荐文章于 2024-06-08 11:29:48 发布

阅读量387

点赞数

CC 4.0 BY-SA版权

分类专栏： ____水题 ========河南省acm竞赛试题======== ========各大OJ题库======== ____南阳理工题库 ========算法与数据结构========

本文链接：https://blog.csdn.net/qq_40788630/article/details/80164907

____水题同时被 3 个专栏收录

86 篇文章

订阅专栏

========各大OJ题库========

84 篇文章

订阅专栏

____南阳理工题库

78 篇文章

订阅专栏

本文介绍了一个简单的宝藏分配问题，通过绘制水平线和垂直线将地图分为四个区域，来决定两个探险者各自能获得的宝藏数量。文章提供了一段C++代码实现，用于计算不同分割线下两人的宝藏数量差异。

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

样例输入

样例输出

-6
4
4

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
    int a[1002]={0},b[1002]={0};
    int n,m,n1,m1;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i]>>b[i];
    }
    while(m--)
    {
        int x,y,sum1=0,sum2=0;
        cin>>x>>y;
        for(int i=1;i<=n;i++)
        {
            if(a[i]>x&&b[i]>y||a[i]<x&&b[i]<y)
                sum1++;
            else sum2++;
        }
        cout<<sum1-sum2<<endl;
    }
    return 0;
}