Submission #1258005

#	Time	Username	Problem	Language	Result	Execution time	Memory
1258005		chikien2009	Let's Win the Election (JOI22_ho_t3)	C++20	10 / 100	608 ms	984888 KiB

Main

#include <bits/stdc++.h>

using namespace std;

void setup()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int n, m;
double f[501][501][501], res = 1e18;
pair<int, int> p[501];

int main()
{
    setup();

    cin >> n >> m;
    for (int i = 0; i <= n; ++i)
    {
        for (int j = 0; j <= m; ++j)
        {
            for (int k = 0; k <= m; ++k)
            {
                f[i][j][k] = 1e18;
            }
        }
    }
    f[0][0][0] = 0;
    for (int i = 1; i <= n; ++i)
    {
        cin >> p[i].second >> p[i].first;
        p[i].first = (p[i].first == -1 ? 1e9 : p[i].first);
    }
    sort(p + 1, p + 1 + n);
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 0; j <= m; ++j)
        {
            for (int k = j; k <= m; ++k)
            {
                f[i][j][k] = f[i - 1][j][k];
                if (k > 0)
                {
                    if (k == j)
                    {
                        if (p[i].first != 1e9)
                        {
                            f[i][j][k] = min(f[i][j][k], f[i - 1][j - 1][k - 1] + (double)p[i].first / j);
                        }
                    }
                    else
                    {
                        f[i][j][k] = min(f[i][j][k], f[i - 1][j][k - 1] + (double)p[i].second / (j + 1));
                    }
                }
                if (k == m)
                {
                    res = min(res, f[i][j][k]);
                }
            }
        }
    }
    // for (int i = 0; i <= m; ++i)
    // {
    //     for (int j = 0; j <= m; ++j)
    //     {
    //         cout << fixed << setprecision(2) << f[n][i][j] << " ";
    //     }
    //     cout << "\n";
    // }
    cout << fixed << setprecision(6) << res;
    return 0;
}

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