QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#641576 | #9462. Safest Buildings | masterhuang | AC ✓ | 2ms | 6120kb | C++23 | 1.0kb | 2024-10-14 21:19:51 | 2024-10-14 21:19:51 |
Judging History
answer
#include<bits/stdc++.h>
#define LL long long
#define LD long double
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=1e5+5;const LD pi=acosl(-1);
int T,n,R,r;LD ans[N];
struct comp
{
int x,y;
}a[N],O;
inline int p2(int x){return x*x;}
inline int dis(comp A,comp B){return p2(A.x-B.x)+p2(A.y-B.y);}
inline LD calc(comp A,comp B,int r,int R)
{
if(r>R) swap(r,R),swap(A,B);
LD d=sqrtl(dis(A,B));
if(d>=R+r) return 0;
if(d<=R-r) return pi*r*r;
LD ang1=acosl((r*r+d*d-R*R)/(2*r*d));
LD ang2=acosl((R*R+d*d-r*r)/(2*R*d));
return ang1*r*r + ang2*R*R - r*d*sinl(ang1);
}
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin>>T;
while(T--)
{
cin>>n>>R>>r;O={0,0};R-=r;LD mx=0;
for(int i=1;i<=n;i++) cin>>a[i].x>>a[i].y;
for(int i=1;i<=n;i++) ans[i]=calc(a[i],O,r,R),mx=max(mx,ans[i]);
basic_string<int>g;
for(int i=1;i<=n;i++) if(ans[i]==mx) g+=i;
cout<<g.size()<<"\n";for(int i:g) cout<<i<<" ";cout<<"\n";
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 6120kb
input:
2 3 10 5 3 4 3 5 3 6 3 10 4 -7 -6 4 5 5 4
output:
1 1 2 2 3
result:
ok 5 tokens
Test #2:
score: 0
Accepted
time: 2ms
memory: 6120kb
input:
100 6 100 50 42 -31 -66 7 13 84 94 13 51 -14 -18 9 12 100 50 -78 56 -56 -64 -22 54 -41 14 -14 55 21 -83 75 21 -51 56 -31 74 -34 79 22 -37 1 -12 14 100 50 15 71 -44 41 -56 78 -48 22 42 -2 -70 28 51 -34 49 -31 -36 67 63 70 34 9 27 -33 36 -93 -52 -19 8 100 14 21 89 67 60 -12 -3 24 -37 -51 14 -30 8 -75 ...
output:
1 6 1 12 1 11 4 3 4 5 6 7 1 4 6 8 9 12 13 1 1 6 2 4 5 7 13 14 7 1 3 4 5 6 7 9 1 11 9 1 2 3 4 5 6 7 8 9 1 29 1 5 1 29 47 1 2 3 4 5 6 7 9 10 11 12 14 17 18 19 21 22 24 25 26 27 28 30 31 32 33 34 35 36 37 38 39 40 41 43 44 45 46 47 48 50 51 52 53 54 55 56 2 21 29 20 1 5 6 7 10 13 14 18 2...
result:
ok 1674 tokens
Extra Test:
score: 0
Extra Test Passed