Submission #1295640

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295640		trigon	Let's Win the Election (JOI22_ho_t3)	C++20	5 / 100	2 ms	348 KiB

Main

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

const double INF = 1e9;

struct State {
    int A, B;
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, K;
    cin >> N >> K;
    vector<State> states(N);
    for (int i = 0; i < N; i++) {
        cin >> states[i].A >> states[i].B;
    }

    // DP: dp[v] = min hours to get v votes
    vector<double> dp(N+3, INF);
    dp[0] = 0;

    for (auto &s : states) {
        for (int v = N; v >= 0; v--) {
            // Case 1: Rie alone gets a vote
            dp[v+1] = min(dp[v+1], dp[v] + s.A);
            // Case 2: Rie + collaborator (counts as 2 votes)
            if (s.B != -1) {
                dp[v+2] = min(dp[v+2], dp[v] + s.B);
            }
        }
    }

    cout << fixed << setprecision(6) << dp[K] << "\n";
    return 0;
}

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