Submission #828879

#	Time	Username	Problem	Language	Result	Execution time	Memory
828879		green_gold_dog	Let's Win the Election (JOI22_ho_t3)	C++17	11 / 100	592 ms	990696 KiB

Main

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

bool cmp(pair<ll, ll> p1, pair<ll, ll> p2) {
        return p1.second < p2.second;
}

void solve() {
        ll n, k;
        cin >> n >> k;
        vector<pair<ll, ll>> arr(n);
        for (ll i = 0; i < n; i++) {
                cin >> arr[i].first >> arr[i].second;
                if (arr[i].second == -1) {
                        arr[i].second = INF32;
                }
        }
        sort(arr.begin(), arr.end(), cmp);
        vector<vector<vector<double>>> dp(n, vector<vector<double>>(n, vector<double>(n, INF32)));
        for (ll i = 0; i < n; i++) {
                dp[0][0][i] = arr[0].first / (double)(i + 1);
                if (i > 0) {
                        dp[0][1][i] = arr[0].second;
                }
        }
        for (ll i = 1; i < n; i++) {
                for (ll j = 0; j < n; j++) {
                        for (ll k = j; k < n; k++) {
                                assign_min(dp[i][j][k], dp[i - 1][j][k] + arr[i].first / (double)(k + 1));
                                if (j && arr[i].second != INF32) {
                                        assign_min(dp[i][j][k], dp[i - 1][j - 1][k] + arr[i].second / (double)j);
                                }
                        }
                }
        }
        double ans = INF32;
        multiset<ll> now;
        ll na;
        for (ll i = k; i < n; i++) {
                now.insert(arr[i].first);
        }
        ll ns = 0;
        for (ll i = k - 1; i >= 0; i--) {
                for (ll j = 0; j < n; j++) {
                        assign_min(ans, dp[i][j][j] + ns / (double)(j + 1));
                }
                now.insert(arr[i].first);
                ns += *now.begin();
                now.erase(now.begin());
        }
        cout << setprecision(100) << ans << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message (stderr)

Main.cpp: In function 'void solve()':
Main.cpp:84:12: warning: unused variable 'na' [-Wunused-variable]
   84 |         ll na;
      |            ^~
Main.cpp: In function 'int main()':
Main.cpp:102:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
Main.cpp:103:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

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