oj.uz

Submission #962264

# Submission time Handle Problem Language Result Execution time Memory
962264 2024-04-13T09:52:17 Z LucaIlie Sure Bet (CEOI17_sure) C++17
20 / 100
 1 ms 2648 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e5;
const long long MAX_P = 1e15;
const double EPS = 1e-4;
double a[MAX_N + 1], b[MAX_N + 1], sa[MAX_N + 1], sb[MAX_N + 1];

int main() {
    int n;

    cin >> n;
    for ( int i = 1; i <= n; i++ ) 
        cin >> a[i] >> b[i];

    sort( a + 1, a + 1 + n );
    reverse( a + 1, a + 1 + n );
    sort( b + 1, b + 1 + n );
    reverse( b + 1, b + 1 + n );
    for ( int i = 1; i <= n; i++ ) {
        sa[i] = sa[i - 1] + a[i];
        sb[i] = sb[i - 1] + b[i];
    }

    double l = 0, r = MAX_P;
    while ( r - l > EPS ) {
        double p = (l + r) / 2;

        bool isPos = false;
        for ( int i = 0; i <= n; i++ ) {
            int j = min( (double)n, max( 0.0, (sa[i] - i - p) ) );
            if ( min( sa[i], sb[j] ) - (i + j)  >= p )
                isPos = true;
        }

        if ( isPos )
            l = p;
        else
            r = p;
    }

    cout << fixed << setprecision( 4 ) << l;

    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Incorrect 1 ms 2496 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Incorrect 1 ms 2496 KB Output isn't correct
10 Halted 0 ms 0 KB -