QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#524587#8037. Gambler's RuinMCdycWA 1442ms60520kbC++231.1kb2024-08-19 20:28:232024-08-19 20:28:24

Judging History

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

  • [2024-08-19 20:28:24]
  • 评测
  • 测评结果:WA
  • 用时:1442ms
  • 内存:60520kb
  • [2024-08-19 20:28:23]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
int main()
{
    int n;
    cin >> n;
    vector<pair<double, int>> a;
    int sum = 0;
    int cntx = 0;
    int cnty = 0;
    map<double, int> mp;
    for (int i = 0; i < n; i++)
    {

        double x;
        int y;
        cin >> x >> y;
        mp[x] += y;
    }
    for (auto it : mp)
        a.emplace_back(it);
    a.emplace_back(1, 0);
    a.emplace_back(0, 0);
    sort(all(a), greater());
    double ans = 0;
    n = mp.size();
    int r = n + 1;
    double sy = 0;
    for (int i = 0; a[i].first > 0; i++)
    {
        cntx += a[i].second;
        double x = 1 / a[i].first;
        double sx = x * cntx;
        while (sy <= sx && a[r].first < 1)
        {
            ans = max(ans, cnty + cntx - sx);
            cnty += a[r].second;
            double y = 1 / (1 - a[r].first);
            sy = y * cnty;
            r--;
        }
        ans = max(ans, cnty + cntx - max(sx, sy));
    }
    cout << fixed << setprecision(12) << ans << "\n";
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
1 15
0 10

output:

10.000000000000

result:

ok found '10.0000000', expected '10.0000000', error '0.0000000'

Test #2:

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

input:

3
0.4 100
0.5 100
0.6 100

output:

33.333333333333

result:

ok found '33.3333333', expected '33.3333333', error '0.0000000'

Test #3:

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

input:

1
0 1

output:

0.000000000000

result:

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

Test #4:

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

input:

2
1 0
1 100

output:

0.000000000000

result:

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

Test #5:

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

input:

1
0.5 100

output:

0.000000000000

result:

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

Test #6:

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

input:

3
0.4 100
0.6 100
0.6 100

output:

0.000000000000

result:

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

Test #7:

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

input:

3
0.2 100
0.2 100
0.8 100

output:

50.000000000000

result:

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

Test #8:

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

input:

2
0.999999 1000000
0.999998 2

output:

0.999998999992

result:

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

Test #9:

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

input:

2
0 100000
0.000001 1

output:

0.000000000000

result:

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

Test #10:

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

input:

2
0 1000000000
0.000001 1

output:

1.000000000000

result:

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

Test #11:

score: -100
Wrong Answer
time: 1442ms
memory: 60520kb

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:

280117693765898.843750000000

result:

wrong answer 1st numbers differ - expected: '85718080941203.0156250', found: '280117693765898.8437500', error = '2.2678951'