QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#537303 | #8037. Gambler's Ruin | rotcar07 | WA | 0ms | 3932kb | C++14 | 1003b | 2024-08-30 09:43:18 | 2024-08-30 09:43:18 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n;
double sum[1000005];
constexpr double eps=1e-8;
int main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>n;vector<pair<double,int>>v(n);
for(auto&x:v) cin>>x.first>>x.second;
sort(v.begin(),v.end());
for(int i=1;i<=n;i++) sum[i]=sum[i-1]+v[i-1].second;
auto calc=[&](int x) -> double {
if(v[x-1].first>eps) return 1/v[x-1].first*(sum[n]-sum[x-1]);
else return 1e18;
};
auto calcw=[&](int x) -> double {
if(1-v[x-1].first>eps) return 1/(1-v[x-1].first)*sum[x];
else return 1e18;
};
double ans=sum[n]-calc(1),mx=-1e18;
int pos=0;
for(int i=2;i<=n;i++){
pos++;
double k=calc(i);
while(calcw(pos)-eps>=k) pos--;
ans=max(ans,sum[n]-sum[i-1]+max(sum[pos]-k,mx));
// cout<<ans<<' '<<pos<<' '<<mx<<' '<<k<<'\n';
mx=max(sum[i]-calcw(i),mx);
}
cout<<fixed<<setprecision(10)<<ans<<'\n';
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3820kb
input:
2 1 15 0 10
output:
10.0000000000
result:
ok found '10.0000000', expected '10.0000000', error '0.0000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3760kb
input:
3 0.4 100 0.5 100 0.6 100
output:
33.3333333333
result:
ok found '33.3333333', expected '33.3333333', error '0.0000000'
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3932kb
input:
1 0 1
output:
-1000000000000000000.0000000000
result:
wrong answer 1st numbers differ - expected: '0.0000000', found: '-1000000000000000000.0000000', error = '1000000000000000000.0000000'