【1410 - Consistent Verdicts】+ 思维

本文探讨了一个二维平面上N个人射击并报告听到枪声次数的问题。通过计算每两个人之间的距离,并进行排序去重来确定可能的一致判决总数。最终输出所有可能的不同且一致的判决数量。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

1410 - Consistent Verdicts
PDF (English) Statistics Forum
Time Limit: 5 second(s) Memory Limit: 32 MB

In a 2D plane N persons are standing and each of them has a gun in his hand. The plane is so big that the persons can be considered as points and their locations are given as Cartesian coordinates. Each of the N persons fire the gun in his hand exactly once and no two of them fire at the same or similar time (the sound of two gun shots are never heard at the same time by anyone so no sound is missed due to concurrency). The hearing ability of all these persons is exactly same. That means if one person can hear a sound at distance R1, so can every other person and if one person cannot hear a sound at distance R2 the other N-1 persons cannot hear a sound at distance R2 as well.
这里写图片描述
The N persons are numbered from 1 to N. After all the guns are fired, all of them are asked how many gun shots they have heard (not including their own shot) and they give their verdict. It is not possible for you to determine whether their verdicts are true but it is possible for you to judge if their verdicts are consistent. For example, look at the figure above. There are five persons and their coordinates are (1, 2), (3, 1), (5, 1), (6, 3) and (1, 5) and they are numbered as 1, 2, 3, 4 and 5 respectively. After all five of them have shot their guns, you ask them how many shots each of them have heard. Now if there response is 1, 1, 1, 2 and 1 respectively then you can represent it as (1, 1, 1, 2, 1). But this is an inconsistent verdict because if person 4 hears 2 shots then he must have heard the shot fired by person 2, then obviously person 2 must have heard the shot fired by person 1, 3 and 4 (person 1 and 3 are nearer to person 2 than person 4). But their opinions show that Person 2 says that he has heard only 1 shot. On the other hand (1, 2, 2, 1, 0) is a consistent verdict for this scenario so is (2, 2, 2, 1, 1). In this scenario (5, 5, 5, 4, 4) is not a consistent verdict because a person can hear at most 4 shots.

Given the locations of N persons, your job is to find the total number of different consistent verdicts for that scenario. Two verdicts are different if opinion of at least one person is different.
Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a line containing a positive integer N (1 ≤ N ≤ 700). Each of the next N lines contains two integers xi yi (0 ≤ xi, yi ≤ 30000) denoting a co-ordinate of a person. Assume that all the co-ordinates are distinct.
Output

For each case, print the case number and the total number of different consistent verdicts for the given scenario.
Sample Input

Output for Sample Input

2

3

1 1

2 2

4 4

2

1 1

5 5

Case 1: 4

Case 2: 2

给出每个人的位置坐标,求听到枪声的个数的方案数~~~求出两两间距离~~~去重?(=-=)

AC代码 :

#include<bits/stdc++.h>
using namespace std;
int ma[710],mb[710],vis[710 * 710];
int main()
{
    int T,N,cut = 0;
    scanf("%d",&T);
    while(T--){
        int nl = 0,ans = 1;
        scanf("%d",&N);
        for(int i = 1 ; i <= N ; i++)
            scanf("%d %d",&ma[i],&mb[i]);
        for(int i = 1 ; i <= N ; i++)
            for(int j = i + 1 ; j <= N; j++)
                vis[++nl] = (ma[i] - ma[j]) * (ma[i] - ma[j]) + (mb[i] - mb[j]) * (mb[i] - mb[j]);
    sort(vis + 1 ,vis + 1 + nl);
    for(int i = 2 ; i <= nl; i++)
        if(vis[i] != vis[i - 1])
            ans++;
    printf("Case %d: %d\n",++cut,++ans);
    }
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值