2017 CCPC 秦皇岛 M
来源:互联网 发布:百度网络北京有限公司 编辑:程序博客网 时间:2024/05/16 00:55
PUBG is a multiplayer online battle royale video game. In the game, up to one hundred players parachute onto an island and scavenge for weapons and equipment to kill others while avoiding getting killed themselves. BaoBao is a big fan of the game, but this time he is having some trouble selecting the safest building.
There are buildings scattering on the island in the game, and we consider these buildings as points on a two-dimensional plane. At the beginning of each round, a circular safe area whose center is located at (0, 0) with radius will be spawned on the island. After some time, the safe area will shrink down towards a random circle with radius (). The whole new safe area is entirely contained in the original safe area (may be tangent to the original safe area), and the center of the new safe area is uniformly chosen within the original safe area.
The buildings covered by the new safe area is called the safe buildings. Given the radius of the safe areas and the positions of the buildings, BaoBao wants to find all the buildings with the largest probability to become safe buildings.
Input
There are multiple test cases. The first line of input contains an integer , indicating the number of test cases. For each test case:
The first line contains three integers (), and (), indicating the number of buildings and the radius of two safe circles.
The following lines each contains 2 integers and (), indicating the coordinate of the buildings. Here we assume that the center of the original safe circle is located at , and all the buildings are inside the original circle.
It’s guaranteed that the sum of over all test cases will not exceed 5000.
Output
For each test case output two lines.
The first line contains an integer , indicating the number of buildings with the highest probability to become safe buildings.
The second line contains integers separated by a space in ascending order, indicating the indices of safest buildings.
Please, DO NOT output extra spaces at the end of each line.
Sample Input
2
3 10 5
3 4
3 5
3 6
3 10 4
-7 -6
4 5
5 4
Sample Output
1
1
2
2 3
题意:绝地求生游戏题。给出许多建筑,和一个原始安全圈。然后再原始安全圈内部更新一个新的安全圈。求哪个或者哪些个建筑最容易成为安全的地方。题目保证所有建筑都在原始安全圈之内!
分析:如果
#include <iostream>#include <string.h>#include <stdio.h>#include <algorithm>using namespace std;const int maxn = 100+10;struct node{ int s; int flag;} a[maxn];int dis(int x,int y){ return x*x+y*y;}bool cmd(node a,node b){ if(a.s!=b.s) return a.s<b.s; return a.flag<b.flag;}int main(){ int T; scanf("%d",&T); while(T--) { int n,R,r; scanf("%d %d %d",&n,&R,&r); for(int i=1; i<=n; i++) { int x,y; scanf("%d %d",&x,&y); a[i].flag=i; a[i].s=dis(x,y); } sort(a+1,a+1+n,cmd); int cnt=0; int ans[maxn]; if(R-2*r<=0) { int d=2*r-R; for(int i=1; i<=n; i++) { if(a[i].s<=d*d) { cnt++; ans[cnt]=a[i].flag; } } } if(cnt!=0) { printf("%d\n",cnt); sort(ans+1,ans+1+cnt); for(int i=1; i<=cnt; i++) { printf("%d%c",ans[i],i==cnt?'\n':' '); } continue; } for(int i=1;i<=n;i++){ if(a[i].s<=(R-2*r)*(R-2*r)){ ans[++cnt]=a[i].flag; }else{ break; } } if(cnt!=0){ printf("%d\n",cnt); sort(ans+1,ans+1+cnt); for(int i=1; i<=cnt; i++) { printf("%d%c",ans[i],i==cnt?'\n':' '); } continue; } int now=a[1].s; cnt++; for(int i=2; i<=n; i++) { if(a[i].s==now) { cnt++; } else { break; } } printf("%d\n",cnt); for(int i=1; i<=cnt; i++) { ans[i]=a[i].flag; } sort(ans+1,ans+1+cnt); for(int i=1; i<=cnt; i++) { printf("%d%c",ans[i],i==cnt?'\n':' '); } } return 0;}
- 2017 CCPC 秦皇岛 M
- 2017 ccpc 秦皇岛 M(几何)
- 2017CCPC秦皇岛 M:Safest Buildings
- 2017CCPC秦皇岛站 M.Safest Buildings
- 2017 ccpc秦皇岛M Safest Buildings
- 2017CCPC 秦皇岛现场赛 M-String of CCPC
- (ccpc秦皇岛站)M
- ZOJ 3993 && 2017CCPC秦皇岛 M:Safest Buildings
- 2017 CCPC 秦皇岛站
- 2017 CCPC秦皇岛 B
- 2017 CCPC秦皇岛 D
- 2017CCPC秦皇岛
- 2017 CCPC 秦皇岛
- 2017 CCPC 秦皇岛 C
- 2017 CCPC 秦皇岛 E
- 2017 CCPC 秦皇岛 L
- 2017CCPC秦皇岛 E:String of CCPC
- 2017 ccpc 秦皇岛E String of CCPC
- 解决Vs输出中文乱码的问题
- [非技术]《如何学习》和《精进》的阅读笔记
- 【移动端vue ui框架学习】vue项目如何使用基于vue的UI框架mint ui
- localStorage 和sessionStorage
- 通信里 星座图 到底是什么意思
- 2017 CCPC 秦皇岛 M
- linux系统搭建redis集群
- cookie、 sessionStorage 、localStorage之间的区别和使用
- Centos 7 安装网易云音乐 V1.1.0
- 干货:最全面的深度学习自学资源汇总
- python3大端、小端(Big Endian、LittleEndian)编码
- jsoup 抓取网页数据
- fiddler网络调试神器(前端)——擦肩而过
- LeetCode#445 Add Two Numbers II (week15)