QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#825616#9778. Brotatoucup-team1134#WA 1287ms244616kbC++233.1kb2024-12-21 20:53:202024-12-21 20:53:21

Judging History

This is the latest submission verdict.

  • [2024-12-21 20:53:21]
  • Judged
  • Verdict: WA
  • Time: 1287ms
  • Memory: 244616kb
  • [2024-12-21 20:53:20]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

#define ld _Float128
ld dp[MAX][153];

pair<ld,ld> db[77];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N,K;
    double ppp;
    ld P;cin>>N>>K>>ppp;
    P=ppp;
    ll pp=roundl(ppp*10000),qq=10000-pp,rr=10000;
    chmin(K,150LL);
    
    for(int j=0;j<=K;j++) dp[N][j]=0;
    dp[0][0]=0;
    for(int i=N-1;i>=0;i--){
        dp[0][0]+=1.0l;
        dp[0][0]/=qq;
        dp[0][0]*=rr;
    }
    for(int i=N-1;i>=1;i--){
        dp[i][0]=(dp[i+1][0]*qq+dp[0][0]*pp+rr)/rr;
    }
    //cout<<fixed<<setprecision(25)<<dp[0][0]<<endl;
    
    for(int j=1;j<=K;j++){
        for(int i=N-1;i>=0;i--){
            if(dp[i+1][j]<1e5&&N*K>=2000000){
                long double s=((long double)(dp[i+1][j])*(qq)+(long double)(dp[i][j-1])*(pp))/(long double)rr+1;
                dp[i][j]=s;
            }else{
                dp[i][j]=(dp[i+1][j]*qq+dp[i][j-1]*pp+rr)/rr;
            }
        }
        ld l=0,r=1e20;
        for(int q=0;q<130;q++){
            ld m=(l+r)/2;
            int L=0,R=N;
            while(R-L>1){
                int M=(L+R)/2;
                if(dp[M][j-1]<m) R=M;
                else L=M;
            }
            db[0]=mp((ld)(qq)/rr,(ld)(m*pp)/rr+1);
            for(int s=1;s<=40;s++){
                auto [a,b]=db[s-1];
                db[s]=mp(a*a,a*b+b);
            }
            ld s=dp[R][j];
            int cn=L+1;
            for(int t=0;t<=20;t++){
                if(cn&(1<<t)){
                    s=db[t].fi*s+db[t].se;
                }
            }
            if(s>m) l=m;
            else r=m;
        }
        ld m=(l+r)/2;
        ld ad=m*pp/rr+1;
        for(int i=N-1;i>=0;i--){
            if(dp[i][j-1]>m){
                if(dp[i+1][j]<1e5&&ad<1e5&&N*K>=2000000){
                    long double s=((long double)(dp[i+1][j])*qq/(long double)rr+(ld)(ad));
                    dp[i][j]=s;
                }else{
                    dp[i][j]=dp[i+1][j]*qq/rr+ad;
                }
            }
        }
        //for(int i=0;i<=N;i++) cout<<dp[i][j]<<endl;
        //cout<<fixed<<setprecision(25)<<(l+r)/2<<endl;
    }
    
    cout<<fixed<<setprecision(25)<<(long double)(dp[0][K])<<endl;
}


詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3864kb

input:

5 0
0.5

output:

62.0000000000000000000000000

result:

ok found '62.000000000', expected '62.000000000', error '0.000000000'

Test #2:

score: 0
Accepted
time: 1ms
memory: 3876kb

input:

5 1
0.5

output:

47.0000000000000000000000000

result:

ok found '47.000000000', expected '47.000000000', error '0.000000000'

Test #3:

score: 0
Accepted
time: 0ms
memory: 28732kb

input:

10000 0
0.002

output:

247489700298.2537133246660232543945312

result:

ok found '247489700298.253723145', expected '247489700298.253692627', error '0.000000000'

Test #4:

score: 0
Accepted
time: 189ms
memory: 243500kb

input:

100000 10
0.0002

output:

38767507133.2322831861674785614013672

result:

ok found '38767507133.232284546', expected '38767507133.232215881', error '0.000000000'

Test #5:

score: 0
Accepted
time: 4ms
memory: 242880kb

input:

100000 0
0.0002

output:

2430683127170.3809037208557128906250000

result:

ok found '2430683127170.380859375', expected '2430683127170.376953125', error '0.000000000'

Test #6:

score: 0
Accepted
time: 349ms
memory: 244028kb

input:

100000 20
0.0002

output:

801073272.2316822390421293675899506

result:

ok found '801073272.231682181', expected '801073272.231680870', error '0.000000000'

Test #7:

score: 0
Accepted
time: 612ms
memory: 244580kb

input:

100000 40
0.0002

output:

478148.7184263073958447876066202

result:

ok found '478148.718426307', expected '478148.718426307', error '0.000000000'

Test #8:

score: 0
Accepted
time: 77ms
memory: 244616kb

input:

99995 4
0.0001

output:

38976542.8681758679813356138765812

result:

ok found '38976542.868175872', expected '38976542.868175834', error '0.000000000'

Test #9:

score: 0
Accepted
time: 184ms
memory: 244504kb

input:

99995 10
0.0001

output:

3549184.5977120199720502569107339

result:

ok found '3549184.597712020', expected '3549184.597712017', error '0.000000000'

Test #10:

score: 0
Accepted
time: 272ms
memory: 244176kb

input:

99995 16
0.0001

output:

399507.4705567421891316826076945

result:

ok found '399507.470556742', expected '399507.470556742', error '0.000000000'

Test #11:

score: 0
Accepted
time: 156ms
memory: 243344kb

input:

99990 8
0.0001

output:

7773463.9479307274573329777922481

result:

ok found '7773463.947930727', expected '7773463.947930722', error '0.000000000'

Test #12:

score: 0
Accepted
time: 179ms
memory: 243584kb

input:

99990 10
0.0001

output:

3547428.9454722998434590408578515

result:

ok found '3547428.945472300', expected '3547428.945472297', error '0.000000000'

Test #13:

score: 0
Accepted
time: 221ms
memory: 243988kb

input:

99990 12
0.0001

output:

1647102.0204343966778424146468751

result:

ok found '1647102.020434397', expected '1647102.020434395', error '0.000000000'

Test #14:

score: 0
Accepted
time: 4ms
memory: 44280kb

input:

16664 1
0.0012

output:

257920044630.8605322390794754028320312

result:

ok found '257920044630.860534668', expected '257920044630.860534668', error '0.000000000'

Test #15:

score: 0
Accepted
time: 64ms
memory: 44892kb

input:

16664 21
0.0012

output:

92190688.5444150149050983600318432

result:

ok found '92190688.544415012', expected '92190688.544415027', error '0.000000000'

Test #16:

score: 0
Accepted
time: 121ms
memory: 44176kb

input:

16664 41
0.0012

output:

59865.0917859199102863954067288

result:

ok found '59865.091785920', expected '59865.091785920', error '0.000000000'

Test #17:

score: 0
Accepted
time: 11ms
memory: 44968kb

input:

16659 5
0.0003

output:

63366.2644069547702940781164216

result:

ok found '63366.264406955', expected '63366.264406955', error '0.000000000'

Test #18:

score: 0
Accepted
time: 31ms
memory: 44820kb

input:

16659 11
0.0003

output:

18120.9118635425287493490031920

result:

ok found '18120.911863543', expected '18120.911863543', error '0.000000000'

Test #19:

score: 0
Accepted
time: 47ms
memory: 44972kb

input:

16659 17
0.0003

output:

16666.5554519674019537944786862

result:

ok found '16666.555451967', expected '16666.555451967', error '0.000000000'

Test #20:

score: 0
Accepted
time: 22ms
memory: 45588kb

input:

16654 9
0.0001

output:

16656.0794165756250837517882246

result:

ok found '16656.079416576', expected '16656.079416576', error '0.000000000'

Test #21:

score: 0
Accepted
time: 24ms
memory: 45492kb

input:

16654 11
0.0001

output:

16655.6741221724001995596609049

result:

ok found '16655.674122172', expected '16655.674122172', error '0.000000000'

Test #22:

score: 0
Accepted
time: 36ms
memory: 45580kb

input:

16654 13
0.0001

output:

16655.6656953626658541622873599

result:

ok found '16655.665695363', expected '16655.665695363', error '0.000000000'

Test #23:

score: 0
Accepted
time: 3ms
memory: 11112kb

input:

2774 2
0.0072

output:

28951389306.9875127002596855163574219

result:

ok found '28951389306.987514496', expected '28951389306.987514496', error '0.000000000'

Test #24:

score: 0
Accepted
time: 18ms
memory: 11984kb

input:

2774 22
0.0072

output:

11312241.4506539416843224898912013

result:

ok found '11312241.450653942', expected '11312241.450653942', error '0.000000000'

Test #25:

score: 0
Accepted
time: 29ms
memory: 12320kb

input:

2774 42
0.0072

output:

8222.4151085086183838868123530

result:

ok found '8222.415108509', expected '8222.415108509', error '0.000000000'

Test #26:

score: 0
Accepted
time: 6ms
memory: 11892kb

input:

2769 6
0.0021

output:

13600.5823557316113951998204357

result:

ok found '13600.582355732', expected '13600.582355732', error '0.000000000'

Test #27:

score: 0
Accepted
time: 10ms
memory: 11820kb

input:

2769 12
0.0021

output:

3239.5499782111262512263039071

result:

ok found '3239.549978211', expected '3239.549978211', error '0.000000000'

Test #28:

score: 0
Accepted
time: 13ms
memory: 11264kb

input:

2769 18
0.0021

output:

2776.6281948752403339053529407

result:

ok found '2776.628194875', expected '2776.628194875', error '0.000000000'

Test #29:

score: 0
Accepted
time: 8ms
memory: 11356kb

input:

2764 10
0.0007

output:

2765.9870739550863536493352512

result:

ok found '2765.987073955', expected '2765.987073955', error '0.000000000'

Test #30:

score: 0
Accepted
time: 9ms
memory: 11460kb

input:

2764 12
0.0007

output:

2765.9373628499719479645335696

result:

ok found '2765.937362850', expected '2765.937362850', error '0.000000000'

Test #31:

score: 0
Accepted
time: 7ms
memory: 11792kb

input:

2764 14
0.0007

output:

2765.9361767034726791170129445

result:

ok found '2765.936176703', expected '2765.936176704', error '0.000000000'

Test #32:

score: 0
Accepted
time: 1287ms
memory: 244060kb

input:

100000 1000000000
0.0001

output:

100010.0010001000177410901414987

result:

ok found '100010.001000100', expected '100010.001000100', error '0.000000000'

Test #33:

score: 0
Accepted
time: 35ms
memory: 3860kb

input:

1 1000000000
0.5

output:

2.0000000000000000000000000

result:

ok found '2.000000000', expected '2.000000000', error '0.000000000'

Test #34:

score: 0
Accepted
time: 12ms
memory: 4052kb

input:

50 50
0.25

output:

66.7341873337045276767809376

result:

ok found '66.734187334', expected '66.734187334', error '0.000000000'

Test #35:

score: 0
Accepted
time: 25ms
memory: 3972kb

input:

40 100
0.5

output:

788.6331239662723213146300338

result:

ok found '788.633123966', expected '788.633123966', error '0.000000000'

Test #36:

score: -100
Wrong Answer
time: 37ms
memory: 3972kb

input:

40 160
0.5

output:

80.0000275893484240272157670

result:

wrong answer 1st numbers differ - expected: '80.0000003', found: '80.0000276', error = '0.0000003'