oj.uz

Submission #151730

# Submission time Handle Problem Language Result Execution time Memory
151730 2019-09-04T11:42:08 Z forestryks Sure Bet (CEOI17_sure) C++14
60 / 100
 123 ms 5368 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define rep(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

const int MAXN = 1e5 + 5;
int n;
ld a[MAXN];
ld b[MAXN];

int main() {
    FAST_IO;
    cout.precision(10);
    cout.setf(ios::fixed);

    cin >> n;
    rep(i, n) {
        cin >> a[i] >> b[i];
    }

    sort(a, a + n);
    sort(b, b + n);
    reverse(a, a + n);
    reverse(b, b + n);

    // ld res = 0;

    // ld s1 = 0;
    // rep(i, n) {
    //     s1 += a[i];
    //     ld s2 = 0;
    //     rep(j, n) {
    //         s2 += b[j];
    //         res = max(res, min(s1, s2) - i - j - 2);
    //     }
    // }

    // cout << res << endl;

    ld s1 = 0, s2 = 0;
    int p1 = 0, p2 = 0;
    ld res = 0;
    for (int c = 0; c < n * 2; ++c) {
        if (s1 < s2 && p1 < n) {
            s1 += a[p1++];
        } else {
            s2 += b[p2++];
        }
        res = max(res, min(s1, s2) - c - 1);
    }

    // cout << res << endl;
    printf("%.4lf",(double)res);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 348 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 296 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 296 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 112 ms 3532 KB Output is correct
18 Correct 116 ms 4888 KB Output is correct
19 Correct 123 ms 4924 KB Output is correct
20 Correct 112 ms 4856 KB Output is correct
21 Incorrect 121 ms 5368 KB Output isn't correct
22 Halted 0 ms 0 KB -