QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#537318#8037. Gambler's Ruinrotcar07RE 1ms4060kbC++141.1kb2024-08-30 09:58:382024-08-30 09:58:39

Judging History

你现在查看的是最新测评结果

  • [2024-08-30 09:58:39]
  • 评测
  • 测评结果:RE
  • 用时:1ms
  • 内存:4060kb
  • [2024-08-30 09:58:38]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int n;
#define double long double
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,sb=-1e18;
    int pos=0;
    for(int i=2;i<=n;i++){
        pos++;if(v[i-1].first-eps>v[i-2].first){
        mx=max(sum[i-1]-calcw(i-1),mx);
        sb=max(sb,calcw(i-1));
        double k=calc(i);
        while(pos>=0&&(calcw(pos)-eps>=k||v[pos].first-eps<=v[pos-1].first)) pos--;
        ans=max(ans,sum[n]-sum[i-1]+max(sum[pos]-k,sb<k?-1e18:mx));
    }}
    cout<<fixed<<setprecision(10)<<max<double>(ans,0.0)<<'\n';
}

详细

Test #1:

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

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: 3996kb

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: 0
Accepted
time: 0ms
memory: 3888kb

input:

1
0 1

output:

0.0000000000

result:

ok found '0.0000000', expected '0.0000000', error '-0.0000000'

Test #4:

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

input:

2
1 0
1 100

output:

0.0000000000

result:

ok found '0.0000000', expected '0.0000000', error '-0.0000000'

Test #5:

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

input:

1
0.5 100

output:

0.0000000000

result:

ok found '0.0000000', expected '0.0000000', error '-0.0000000'

Test #6:

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

input:

3
0.4 100
0.6 100
0.6 100

output:

0.0000000000

result:

ok found '0.0000000', expected '0.0000000', error '-0.0000000'

Test #7:

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

input:

3
0.2 100
0.2 100
0.8 100

output:

50.0000000000

result:

ok found '50.0000000', expected '50.0000000', error '0.0000000'

Test #8:

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

input:

2
0.999999 1000000
0.999998 2

output:

0.9999990000

result:

ok found '0.9999990', expected '0.9999990', error '0.0000000'

Test #9:

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

input:

2
0 100000
0.000001 1

output:

0.0000000000

result:

ok found '0.0000000', expected '0.0000000', error '-0.0000000'

Test #10:

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

input:

2
0 1000000000
0.000001 1

output:

1.0000000000

result:

ok found '1.0000000', expected '1.0000000', error '0.0000000'

Test #11:

score: -100
Runtime Error

input:

1000000
0.375733 595197307
0.505261 377150668
0.517039 15795246
0.448099 228176467
0.529380 871983979
0.905546 876268308
0.095891 272104456
0.500302 916153337
0.128705 355768079
0.070600 78747362
0.444107 466118868
0.194987 298494965
0.462293 593292779
0.287909 838058266
0.237226 934603199
0.391909 ...

output:


result: