QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #77468 | #3994. Easy Jump | chenshi | RE | 2ms | 3712kb | C++ | 757b | 2023-02-14 19:48:50 | 2023-02-14 19:48:51 |
Judging History
answer
#include<cstdio>
#include<iostream>
#include<cassert>
using namespace std;
const int o=1010;const long double inf=1e18;
int n,h,s,K;long double T1,T2,T2_,p[o],f[o][10][7],v,t;bool tote[o];
int main(){
scanf("%d%d%d",&n,&h,&s);
for(int i=1;i<=n;++i) scanf("%Lf",&p[i]),p[i]/=100;
scanf("%d",&K);
for(int a;K--;tote[a]=1) scanf("%d",&a);
scanf("%Lf%Lf",&T1,&T2);
for(int i=n;i;--i) for(int j=2;j<=h;++j) for(int k=0;k<=s;++k){
v=1+p[i]*f[i+1][j][k];t=inf;T2_=T2;
if(j>2) t=min(t,f[i][j-1][k]);
if(k) t=min(t,f[i][j][k-1]+T1);
if(tote[i]) v=1+p[i]*f[i+1][j][s],T2_=min(T1,T2);
f[i][j][k]=min(v+(1-p[i])*t,(v+(1-p[i])*T2_)/p[i]);
if(tote[i]&&k) assert(f[i][j][k]==f[i][j][k-1]);
}
printf("%Lf",f[1][h][s]);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 3556kb
input:
1 2 0 50 0 1 2
output:
4.000000
result:
ok found '4.0000000', expected '4.0000000', error '0.0000000'
Test #2:
score: 0
Accepted
time: 2ms
memory: 3668kb
input:
2 3 1 50 50 1 1 1 3
output:
6.000000
result:
ok found '6.0000000', expected '6.0000000', error '0.0000000'
Test #3:
score: 0
Accepted
time: 2ms
memory: 3520kb
input:
1 6 4 75 0 64 6
output:
1.341146
result:
ok found '1.3411460', expected '1.3411458', error '0.0000001'
Test #4:
score: 0
Accepted
time: 2ms
memory: 3552kb
input:
1 5 1 61 1 1 15 43
output:
2.208223
result:
ok found '2.2082230', expected '2.2082232', error '0.0000001'
Test #5:
score: 0
Accepted
time: 2ms
memory: 3556kb
input:
10 9 3 12 65 76 33 17 20 89 16 4 63 3 2 4 8 73 21
output:
942.414842
result:
ok found '942.4148420', expected '942.4148420', error '0.0000000'
Test #6:
score: 0
Accepted
time: 1ms
memory: 3712kb
input:
10 6 0 26 6 29 76 92 46 8 4 91 44 1 4 17 6
output:
401.866863
result:
ok found '401.8668630', expected '401.8668630', error '0.0000000'
Test #7:
score: -100
Dangerous Syscalls
input:
100 3 5 85 59 20 75 58 42 79 95 22 15 95 81 69 73 45 42 99 93 58 8 18 34 88 14 23 37 87 16 96 17 40 58 32 26 93 9 37 15 68 49 99 73 48 79 16 27 52 4 66 53 48 55 27 56 52 66 25 30 34 11 97 20 38 30 4 78 17 98 4 23 30 71 87 94 89 71 45 92 72 24 90 24 78 48 62 82 30 30 27 55 64 66 41 72 53 97 59 38 80 ...