Time Limit: 5000MS | Memory Limit: 32768KB | 64bit IO Format: %lld & %llu |
Description
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
2
3
1 1
2 2
4 4
2
1 1
5 5
Sample Output
Case 1: 4
Case 2: 2
题意：给定n个人的坐标，已知每个人的可听距离是相同的。现在n个人依次放枪后，我们询问每个人听到的枪声数目(保证任意两支枪的声音不同时出现)。在所有人回答正确的前提下，有多少种可能存在的答案。
只想说一句，这题说的太吓人了。（题很长，但感觉没啥用，迷惑性太大）。感觉我的答案是碰对的，但一提交竟然过了。
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
struct zz
{
int x;
int y;
}q[1500];
double dis[710][710];
double dd[710];
double d[710];
double ju(zz a,zz b)
{
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int main()
{
int t;
int T=1;
int n,m;
int i,j;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d%d",&q[i].x,&q[i].y);
int k=0;
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
dd[k++]=dis[i][j]=dis[j][i]=ju(q[i],q[j]);
}
}
sort(dd,dd+k);
d[0]=dd[0];
j=1;
for(i=1;i<k;i++)
{
if(dd[i]!=dd[i-1])
{
d[j++]=dd[i];
}
}
m=j;
printf("Case %d: %d\n",T++,m+1);
}
return 0;
}
