oj.uz

Submission #948671

# Submission time Handle Problem Language Result Execution time Memory
948671 2024-03-18T10:22:37 Z GrindMachine Sure Bet (CEOI17_sure) C++17
20 / 100
 77 ms 600 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 best = 0;

    rep(mask,1<<(n*2)){
        ll curr = -setbits(mask)*10000;
        ll sum1 = 0, sum2 = 0;

        rep(i,n*2){
            if(mask&(1<<i)){
                if(i&1){
                    sum2 += a[(i>>1)+1].ss;
                }
                else{
                    sum1 += a[(i>>1)+1].ff;
                }
            }
        }

        curr += min(sum1,sum2);
        amax(best,curr);
    }

    cout << fixed << setprecision(4);
    ld ans = best/(ld)1e4;
    cout << ans << 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 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 76 ms 348 KB Output is correct
4 Correct 77 ms 344 KB Output is correct
5 Correct 70 ms 356 KB Output is correct
6 Correct 73 ms 432 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 76 ms 348 KB Output is correct
4 Correct 77 ms 344 KB Output is correct
5 Correct 70 ms 356 KB Output is correct
6 Correct 73 ms 432 KB Output is correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 76 ms 348 KB Output is correct
4 Correct 77 ms 344 KB Output is correct
5 Correct 70 ms 356 KB Output is correct
6 Correct 73 ms 432 KB Output is correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Halted 0 ms 0 KB -