Submission #1336014

#	Time	Username	Problem	Language	Result	Execution time	Memory
1336014		retarde	Let's Win the Election (JOI22_ho_t3)	C++20	28 / 100	2594 ms	456 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()

typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;

const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;

inline void solve() {
    int n, k;
    cin >> n >> k;
    vector<pii> s(n); vi can;
    for (int i = 0; i < n; i++) {cin >> s[i].fi >> s[i].se; if (s[i].se != -1) can.pb(i);}

    ld ans = 1e18;
    for (int msk = 0; msk < ((int)1 << (int)can.size()); msk++) {
        vi cont(n); vi bs; vi as;
        // cout << "Mask:\n";
        for (int j = 0; j < can.size(); j++) {
            // cout << ((msk & ((int)1 << j)) > 0);
            if (!(msk & ((int)1 << j))) {continue;}
            cont[can[j]] = 1;
            bs.pb(s[can[j]].se);
        }
        // cout << '\n';

        sort(all(bs));
        for (int i = 0; i < n; i++) if (!cont[i]) as.pb(s[i].fi);
        sort(all(as));

        ld cur = 0;
        for (int i = 0; i < bs.size(); i++) {
            cur += (ld)bs[i]/(ld)(i+1);
        }

        // cout << fixed << setprecision(8) << cur << " to get the guys\n";
        // cout << k << " " << bs.size() << " " << as.size() << '\n';
        // if (!(k-bs.size() <= as.size())) {cout << k-(int)(bs.size()) << " and " << as.size() << "\n";break;}
        assert((int)k-(int)bs.size() <= (int)as.size());
        for (int i = 0; i < k-(int)bs.size(); i++) {
            // cout << "getting " << as[i] << " with " << bs.size()+1 << "guys\n";
            cur += (ld)as[i]/(ld)((int)bs.size()+1);
        }
        // cout << "totans " << cur << '\n';
        ans = min(ans, cur);
    }
    std::cout << std::fixed << std::setprecision(8) << ans << '\n';
}

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    //setIO();

    int t = 1;
    if (tc) {
        cin >> t;
    }

    while (t--) {
        solve();
    }
}

Compilation message (stderr)

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:75:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:76:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 0 / 33
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23