oj.uz

Submission #948676

# Submission time Handle Problem Language Result Execution time Memory
948676 2024-03-18T10:31:24 Z GrindMachine Sure Bet (CEOI17_sure) C++17
100 / 100
 34 ms 5420 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<pll> a(n+5);

    auto convert = [&](string s){
        bool decimal_came = false;
        ll after_decimal = 0;
        ll x = 0;

        trav(ch,s){
            if(ch == '.'){
                decimal_came = true;
            }
            else{
                x = x*10+(ch-'0');
                after_decimal += decimal_came;
            }
        }

        while(after_decimal < 4){
            x *= 10;
            after_decimal++;
        }

        return x;
    };

    rep1(i,n){
        string s1,s2; cin >> s1 >> s2;
        a[i] = {convert(s1),convert(s2)};
    }

    vector<ll> sa,sb;
    rep1(i,n) sa.pb(a[i].ff), sb.pb(a[i].ss);
    sort(rall(sa)), sort(rall(sb));
    
    ll ans = 0;
    ll sum1 = 0, sum2 = 0;
    ll ptr = 0;

    rep(i,n){
        sum1 += sa[i];
        while(ptr < n and sum2 < sum1){
            sum2 += sb[ptr++];
        }

        if(sum1 <= sum2){
            ll cnt = i+1+ptr;
            amax(ans,sum1-cnt*10000);
        }
    }

    swap(sa,sb);
    sum1 = 0, sum2 = 0;
    ptr = 0;

    rep(i,n){
        sum1 += sa[i];
        while(ptr < n and sum2 < sum1){
            sum2 += sb[ptr++];
        }

        if(sum1 <= sum2){
            ll cnt = i+1+ptr;
            amax(ans,sum1-cnt*10000);
        }
    }

    swap(sa,sb);
    
    string after_decimal = to_string(ans%10000);
    ll need = 4-sz(after_decimal);
    after_decimal = string(need,'0') + after_decimal;
 
    ans /= 10000;
    cout << ans << "." << after_decimal << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
40.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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #3
40.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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 27 ms 3788 KB Output is correct
18 Correct 28 ms 5076 KB Output is correct
19 Correct 29 ms 5060 KB Output is correct
20 Correct 29 ms 5216 KB Output is correct
21 Correct 34 ms 5324 KB Output is correct
22 Correct 28 ms 5072 KB Output is correct
23 Correct 28 ms 5064 KB Output is correct
24 Correct 30 ms 5068 KB Output is correct
25 Correct 28 ms 5184 KB Output is correct
26 Correct 29 ms 5420 KB Output is correct