oj.uz

Submission #962681

# Submission time Handle Problem Language Result Execution time Memory
962681 2024-04-14T06:50:56 Z LucaIlie Sure Bet (CEOI17_sure) C++17
20 / 100
 1 ms 348 KB 
#include <iostream>
#include <algorithm>
#include <iomanip>

using namespace std;
#define nmax 100001
#define mod 10000

double a[nmax], b[nmax];
int main()
{
    int n, i, ia, ib;
    double maxx, sa, sb;
    cin >> n;
    for( i = 1; i <= n; i++ )
        cin >> a[i] >> b[i];
    sort( a + 1, a + n + 1 );
    sort( b + 1, b + n + 1 );
    ia = ib = n ;
    sa = sb = maxx = 0;
    while( ia > 0 || ib > 0 ) {
        if( min(sa + a[ia] - 1, sb - 1) > min(sa - 1, sb + b[ib] - 1) ) {
            maxx = max( maxx, min(sa + a[ia] - 1, sb - 1));
            sa += a[ia] - 1;
            sb -= 1;
            ia--;
        } else {
            maxx = max( maxx, min(sa - 1, sb + b[ib] - 1));
            sa += - 1;
            sb += b[ib] - 1;
            ib--;
        }
        //cout << maxx << " " << ia << " " << sa << " " << ib << " " << sb << "\n";
    }
    cout << fixed << setprecision( 4 ) << maxx;
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Incorrect 1 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Incorrect 1 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -