제출 #1171129

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171129		Nelt	Sure Bet (CEOI17_sure)	C++20	20 / 100	2096 ms	328 KiB

sure

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define endl "\n"
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;

void solve()
{
    ll n;
    cin >> n;
    long double a[n], b[n];
    for (ll i = 0; i < n; i++) cin >> a[i] >> b[i];
    long double ans = 0;
    ll pw4 = 1;
    for (ll i = 1; i <= n; i++) pw4 *= 4;
    for (ll msk = 0; msk < pw4; msk++)
    {
        long double resa = 0, resb = 0;
        ll pw = msk, cnt = 0;
        for (ll i = 0; i < n; i++) 
        {
            if (pw % 4 == 1) resa += a[i], cnt++;
            else if (pw % 4 == 2) resb += b[i], cnt++;
            else if (pw % 4 == 3) resa += a[i], resb += b[i], cnt += 2;
            pw /= 4;
        }
        ans = max(ans, min(resa, resb) - cnt);
    }
    cout << setprecision(4) << fixed << ans << endl;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t = 1;
    // precomp();
    // cin >> t;
    for (ll cs = 1; cs <= t; cs++)
        solve();
    // cerr << "\nTime elapsed: " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 40
• Subtask 3: 0 / 40