2017CCPC QinHuangDao M题
2017-12-02 18:46
274 查看
Safest BuildingsTime Limit: 1 Second Memory Limit: 65536 KBPUBG 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.
4000
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
/* 2017ccpc QingHuangDao M @author jsphlim */ #include<iostream> #include<algorithm> using namespace std; struct point{ int x; int y; int index; int pc; }; bool cmp(point x,point y){ return x.pc<=y.pc; } point p[100005]; point ps[100005]; int main(){ int t,n,r,R; cin>>t; while(t--){ cin>>n>>R>>r; int flag=0; for(int i=1;i<=n;i++) {cin>>p[i].x>>p[i].y; p[i].index=i; p[i].pc=p[i].x*p[i].x+p[i].y*p[i].y;} int temp; if(R>2*r){ temp = R-2*r; } else{ temp = 2*r-R; } int indx = 0; for(int i=1;i<=n;i++){ if(p[i].pc<=temp*temp){ ps[indx++]=p[i]; } } if(indx!=0){ cout<<indx<<endl; for(int i=0;i<indx-1;i++) cout<<ps[i].index<<" "; cout<<ps[indx-1].index<<endl; } else{ sort(p+1,p+n+1,cmp); int inx=2; while(p[1].pc==p[inx].pc) inx++; cout<<inx-1<<endl; int sets[10005]; int setsize=0; for(int i=1;i<inx;i++) sets[setsize++]=p[i].index; sort(sets,sets+setsize); for(int i=0;i<setsize-1;i++) cout<<sets[i]<<" "; cout<<sets[setsize-1]<<endl; } } }
4000
相关文章推荐
- The 2017 China Collegiate Programming Contest, Qinhuangdao Site
- 2017 CCPC Qinhuangdao Site
- ZOJ 3981 Balloon Robot CCPC2017 Qinhuangdao(推公式+离线处理)
- ZOJ 3987 Numbers CCPC2017 Qinhuangdao(贪心+Java大整数)
- travel near qin huang dao
- 秦皇岛市奥体中心体育场 Qinhuangdao Olympic Sports Center Stadium
- hdu 4081 Qin Shi Huang's National Road System
- poj 1944 Qin Shi Huang's National Road System(次小生成树)
- HDU 4081 Qin Shi Huang's National Road System (枚举次小生成树)
- HDU 4081 Qin Shi Huang's National Road System(最小生成树/次小生成树)
- Adobe Photoshop CC 2017破解图文安装教程(附下载)
- hdu-4081-Qin Shi Huang's National Road System
- HDOJ 4081: Qin Shi Huang's National Road System
- HDU 4081 Qin Shi Huang's National Road System 次小生成树
- 支持Adobe Photoshop CC 2017最新版的Coolorus 2.5.9 色环插件
- [寒假集训第一场]gym101606 2017 United Kingdom and Ireland Programming Contest (UKIEPC 2017)
- 2017-2018-2 20155303『网络对抗技术』Exp1:PC平台逆向破解
- 2017-2018-2 《网络对抗技术》 20155302 第二周 Exp1 PC平台逆向破解(5)M
- UValive 5713 Qin Shi Huang&#39;s National Road System