QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#352791 | #958. Lockout vs tourist | Graphcity | AC ✓ | 404ms | 36696kb | C++20 | 1021b | 2024-03-13 16:47:51 | 2024-03-13 16:47:52 |
Judging History
answer
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=(1<<22);
const double eps=1e-9;
int n,m,lim,a[25],id[25]; double f[Maxn+5];
int main()
{
// freopen("1.in","r",stdin);
cin>>n; For(i,0,n-1) cin>>a[i]; lim=(1<<n)-1; f[0]=0;
For(s,1,lim)
{
double s1=0,s2=0,mx=0; int flg=0; m=0;
auto Get=[&](){return (s1-1)/s2;};
For(i,0,n-1) if(s&(1<<i))
{
double b=f[s^(1<<i)];
if(b>a[i]) mx=max(mx,1.0*a[i]);
else id[++m]=i;
}
sort(id+1,id+m+1,[&](int x,int y){return a[x]>a[y];});
For(_,1,m)
{
int i=id[_]; double b=f[s^(1<<i)];
if(Get()>a[i]) break;
if(abs(a[i]-b)<=eps) {flg=1,f[s]=max(mx,b); break;}
s1+=1.0*a[i]/(a[i]-b),s2+=1.0/(a[i]-b);
} if(!flg) f[s]=max(mx,Get());
}
printf("%.9lf\n",f[lim]);
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3772kb
input:
2 6 7
output:
3.230769231
result:
ok found '3.2307692', expected '3.2307692', error '0.0000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
3 1 1 1
output:
0.833333333
result:
ok found '0.8333333', expected '0.8333333', error '0.0000000'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3896kb
input:
11 1 2 3 4 5 6 7 8 9 10 11
output:
9.442271387
result:
ok found '9.4422714', expected '9.4422714', error '0.0000000'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3848kb
input:
2 1 1000000000
output:
0.999999999
result:
ok found '1.0000000', expected '1.0000000', error '0.0000000'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3932kb
input:
5 76 57 68 36 63
output:
63.353965112
result:
ok found '63.3539651', expected '63.3539651', error '0.0000000'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3884kb
input:
10 550060 445055 787034 728427 572554 894096 875473 622886 575460 119034
output:
818911.373928633
result:
ok found '818911.3739286', expected '818911.3739286', error '0.0000000'
Test #7:
score: 0
Accepted
time: 3ms
memory: 4172kb
input:
15 10 8 9 6 9 5 3 9 7 8 7 6 7 10 7
output:
9.498679632
result:
ok found '9.4986796', expected '9.4986796', error '0.0000000'
Test #8:
score: 0
Accepted
time: 75ms
memory: 12068kb
input:
20 3 2 2 1 2 3 1 3 3 2 1 2 3 2 3 2 3 1 3 1
output:
2.999975198
result:
ok found '2.9999752', expected '2.9999752', error '0.0000000'
Test #9:
score: 0
Accepted
time: 150ms
memory: 20140kb
input:
21 608646711 538679781 175667175 596079164 43084965 174585378 46825084 647100103 820432909 254925688 469580725 888475497 802835182 554123188 53822453 849477025 715668397 194908968 407987651 349577139 457598738
output:
831669480.282169342
result:
ok found '831669480.2821693', expected '831669480.2821692', error '0.0000000'
Test #10:
score: 0
Accepted
time: 280ms
memory: 36696kb
input:
22 593316975 268451765 664075355 817013319 325389147 553878522 663160635 289932897 995002446 771863307 252061346 171723220 102306933 722521207 52895206 996540774 335816175 415049181 629862034 371890996 327908946 357122932
output:
899795716.348148704
result:
ok found '899795716.3481487', expected '899795716.3481486', error '0.0000000'
Test #11:
score: 0
Accepted
time: 310ms
memory: 36600kb
input:
22 1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576 2097152
output:
895851.534057119
result:
ok found '895851.5340571', expected '895851.5340571', error '0.0000000'
Test #12:
score: 0
Accepted
time: 320ms
memory: 36628kb
input:
22 1000001 1000002 1000003 1000004 1000005 1000006 1000007 1000008 1000009 1000010 1000011 1000012 1000013 1000014 1000015 1000016 1000017 1000018 1000019 1000020 1000021 1000022
output:
1000020.442125288
result:
ok found '1000020.4421253', expected '1000020.4421253', error '0.0000000'
Test #13:
score: 0
Accepted
time: 0ms
memory: 3848kb
input:
10 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
output:
999999724.426807284
result:
ok found '999999724.4268073', expected '999999724.4268078', error '0.0000000'
Test #14:
score: 0
Accepted
time: 404ms
memory: 36628kb
input:
22 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
output:
1000000000.000000000
result:
ok found '1000000000.0000000', expected '1000000000.0000000', error '0.0000000'
Test #15:
score: 0
Accepted
time: 148ms
memory: 20240kb
input:
21 728645832 499372030 251249515 630474794 602042850 686098859 164334367 88772048 746898743 759695983 264178590 77784010 969248695 194487863 333341710 979132664 389787588 237190234 881432878 265149252 412117176
output:
904983051.313902497
result:
ok found '904983051.3139025', expected '904983051.3139025', error '0.0000000'
Test #16:
score: 0
Accepted
time: 333ms
memory: 36640kb
input:
22 314176712 731128902 493616429 895194945 944147610 264333375 726725941 275896968 22590087 347618504 348534546 434375739 41042380 833655175 812796321 965972943 895005482 106474689 268333939 73317639 692105187 921714965
output:
931516498.441391587
result:
ok found '931516498.4413916', expected '931516498.4413917', error '0.0000000'
Test #17:
score: 0
Accepted
time: 309ms
memory: 36664kb
input:
22 619182033 404890231 483695686 505942949 17974691 191865554 285191465 20725875 768798333 549358594 794203186 500489670 673327262 914017660 189568084 691193705 497008772 813277003 87684441 894142475 811860050 857365145
output:
872232180.526017547
result:
ok found '872232180.5260175', expected '872232180.5260175', error '0.0000000'
Test #18:
score: 0
Accepted
time: 0ms
memory: 3772kb
input:
1 1
output:
0.000000000
result:
ok found '0.0000000', expected '0.0000000', error '-0.0000000'