QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #18180 | #2267. Jewelry Size | Wu_Ren# | WA | 10ms | 5828kb | C++11 | 783b | 2022-01-16 17:06:46 | 2022-05-04 17:16:20 |
Judging History
answer
#include<bits/stdc++.h>
int mod;
const long double pi=acos(-1),leps=1e-8;
using namespace std;
int n,m,K;
int a[1000010];
char s[1000010];
long double ans,res=1e18,d;
bool chk(long double x,int k){
long double sum=0,t=2*x*x;
for(int i=1;i<n;i++) sum+=acosl(1-a[i]/t);
if(k) sum+=acosl(1-a[n]/t);
else sum+=2*pi-acosl(1-a[n]/t);
if(fabsl(sum-2*pi)<=1e-5) ans=x;
return sum<2*pi-leps;
}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sort(a+1,a+n+1),d=a[n]/2.0;
for(int i=1;i<=n;i++) a[i]=a[i]*a[i];
for(int k=0;k<2;k++){
ans=1e18;
long double l=d,r=1e10,mid;
for(int _=0;_<6000;_++){
mid=(l+r)/2;
if(chk(mid,k)) (k?r:l)=mid;
else (k?l:r)=mid;
}
res=min(res,ans);
}
printf("%.12lf",(double)res);
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 7ms
memory: 3760kb
input:
5 3 1 6 1 7
output:
3.544404352980
result:
ok found '3.5444044', expected '3.5444044', error '0.0000000'
Test #2:
score: 0
Accepted
time: 5ms
memory: 3776kb
input:
3 500 300 400
output:
250.000000000000
result:
ok found '250.0000000', expected '250.0000000', error '0.0000000'
Test #3:
score: 0
Accepted
time: 5ms
memory: 5784kb
input:
8 2000 3000 4000 2000 3000 4000 2000 3000
output:
3780.974126216039
result:
ok found '3780.9741262', expected '3780.9741206', error '0.0000000'
Test #4:
score: -100
Wrong Answer
time: 10ms
memory: 5828kb
input:
10 602 67 67 67 67 67 67 67 67 67
output:
3003.094931368975
result:
wrong answer 1st numbers differ - expected: '3003.1398170', found: '3003.0949314', error = '0.0000149'