light oj 1410 - Consistent Verdicts
来源:互联网 发布:阿里云tv助手连接电视 编辑:程序博客网 时间:2024/04/29 04:50
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
#include <iostream>#include <cstdio>#include<cmath>#include<algorithm>using namespace std;double d[490000+10];struct Node { double x,y;}node[710];int main(){ int t,n,kcase=1; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%lf%lf",&node[i].x,&node[i].y); } int k=0; for(int i=0;i<n;i++) { for(int j=i+1;j<n;j++) d[k++]=sqrt((node[i].x-node[j].x)*(node[i].x-node[j].x)+(node[i].y-node[j].y)*(node[i].y-node[j].y)); } sort(d,d+k); int ans=1; for(int i=1;i<k;i++) { if(d[i]!=d[i-1]) ans++; } printf("Case %d: %d\n",kcase++,ans+1); } return 0;}
- light oj 1410 - Consistent Verdicts
- Light OJ-----1410---Consistent Verdicts
- 【Light-OJ】-1410- Consistent Verdicts(思维)
- Light OJ 1410 - Consistent Verdicts 【排序去重】
- LightOj 1410 - Consistent Verdicts
- 【1410 - Consistent Verdicts】+ 思维
- LightOJ 1410 - Consistent Verdicts
- lightoj 1410 - Consistent Verdicts 【思维】
- lightoj--1410--Consistent Verdicts(技巧)
- LIGHTOJ 1410 - Consistent Verdicts【SET】
- lightoj-1410-Consistent Verdicts【思维】
- lightoj 1410 - Consistent Verdicts1410 - Consistent Verdicts
- lightoj Consistent Verdicts 1410 (距离计算)
- 【LightOJ】1410 - Consistent Verdicts(思维)
- light1410 - Consistent Verdicts
- lightoj-【Consistent Verdicts】
- LightOJ 1410 - Consistent Verdicts (判断去重)
- Consistent Verdicts坐标--去重-code force1410
- 数学题中的大智慧
- Android自动检测版本及自动升级
- [Android SDK] Call requires API level 23 (current min is 14)问题的解决
- hive用法的相关总结
- python 正则 ()的 作用 和 findall 和match 的区别 以及在php中同等功能的实现
- light oj 1410 - Consistent Verdicts
- ES5中,Array新增API(上)之forEach、filter、map、reduce
- IEEE 802.15.4协议完整中文版 - 5.1 MAC 功能概述
- shiro权限认证过程
- RecyclerView局部刷新那点事
- 阿里根据截图查到泄露者,这样的技术是如何做到的?
- JavaScript教程_廖雪峰
- 解决ADB端口占用问题
- 机器学习常用算法优点及缺点总结