Submission #825955

#	Time	Username	Problem	Language	Result	Execution time	Memory
825955		vjudge1	Let's Win the Election (JOI22_ho_t3)	C++17	100 / 100	902 ms	396 KiB

Main

#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

const ld INF = 1e18;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n, k;
    cin >> n >> k;
    pair<ld, ld> c[n + 1];
    for(int i = 1; i <= n; i++) {
        cin >> c[i].first >> c[i].second;
        if(c[i].second == -1) c[i].second = INF;
    }
    sort(c + 1, c + n + 1, [](pair<ld, ld> x, pair<ld, ld> y){return x.second < y.second;});
    ld res = INF;
    for(int t = 0; t <= k; t++) {
        vector<ld> dp(k - t + 1, INF);
        dp[0] = 0;
        for(int i = 1; i <= n; i++) {
            vector<ld> newdp(k - t + 1, INF);
            for(int j = 0; j <= k - t; j++) {
                if(j) newdp[j] = min(newdp[j], dp[j - 1] + c[i].first / (t + 1));
                if(i - j <= t) newdp[j] = min(newdp[j], dp[j] + c[i].second / (i - j));
                else newdp[j] = min(newdp[j], dp[j]);
            }
            dp = newdp;
        }
        res = min(res, dp[k - t]);
    }
    cout << setprecision(9) << fixed << res;
}

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