제출 #858907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
858907		Hanksburger	Let's Win the Election (JOI22_ho_t3)	C++17	100 / 100	167 ms	4440 KiB

Main

#include <bits/stdc++.h>
using namespace std;
pair<double, double> a[505];
double dp[505][505][2];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, k;
    cin >> n >> k;
    for (int i=1; i<=n; i++)
    {
        cin >> a[i].second >> a[i].first;
        if (a[i].first==-1)
            a[i].first=1e9;
    }
    sort(a+1, a+n+1);
    double ans=1e9;
    for (int m=0; m<=k; m++)
    {
        for (int i=0; i<=n; i++)
            for (int j=0; j<=k-m; j++)
                dp[i][j][0]=dp[i][j][1]=1e9;
        dp[0][0][1-(bool)m]=0;
        for (int i=1; i<=n; i++)
        {
            for (int j=0; j<=min(i, k-m); j++)
            {
                if (i-j<m)
                {
                    if (!j)
                        dp[i][j][0]=dp[i-1][j][0]+a[i].first/(i-j);
                    else if (j==i)
                        dp[i][j][0]=dp[i-1][j-1][0]+a[i].second/(m+1);
                    else
                        dp[i][j][0]=min(dp[i-1][j][0]+a[i].first/(i-j), dp[i-1][j-1][0]+a[i].second/(m+1));
                }
                else
                {
                    dp[i][j][1]=dp[i-1][j][1];
                    if (j)
                        dp[i][j][1]=min(dp[i][j][1], dp[i-1][j-1][1]+a[i].second/(m+1));
                    if (i-j==m)
                        dp[i][j][1]=min(dp[i][j][1], dp[i-1][j][0]+a[i].first/m);
                }
            }
        }
        ans=min(ans, dp[n][k-m][1]);
    }
    cout << ans;
}

• 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