Submission #936917

#	Time	Username	Problem	Language	Result	Execution time	Memory
936917		Marco_Escandon	Let's Win the Election (JOI22_ho_t3)	C++11	0 / 100	756 ms	1048576 KiB

Main

#include<bits/stdc++.h>
#define optimizar_io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(15);
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
#define x first
#define y second
pair<double,double> cad[501];
int main()
{
    optimizar_io
    ll n,m;
    cin>>n>>m;
    cad[0]={-1,-1};
    for(int i=1; i<=n; i++)
        cin>>cad[i].second>>cad[i].first;
    sort(cad,cad+n);
    pair<double,double> dp[n+3][m+3][m+3];
    for(int i=0; i<n+2; i++)
        for(int j=0; j<=m+2; j++)
            for(int k=0; k<=m+2; k++)
                dp[i][j][k]={1e9,1e9};
    dp[0][1][1]={0,0};
    double bs=1e9;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m+1; j++)
        {
            for(int k=1; k<=m+1; k++)
            {
                pair<double,double> temp={1e9,1e9};
                temp=min(temp,dp[i-1][j][k]);
                temp=min(temp,{dp[i-1][j][k-1].x+cad[i].y/j,dp[i-1][j][k-1].y});
                if(cad[i].first!=-1&&j!=1)
                    temp=min(temp,{(dp[i-1][j-1][k-1].x-dp[i-1][j-1][k-1].y)*(j-1)/j+dp[i-1][j-1][k-1].y+cad[i].x/(j-1),dp[i-1][j-1][k-1].y+cad[i].x/(j-1)});
                dp[i][j][k]=temp;
                if(k==m+1)
                {
                    //cout<<i<<j<<k<<":"<<temp.first<<" "<<temp.second<<"  ";
                    bs=min(bs,dp[i][j][k].first);
                }
            }
            //cout<<"\n";
        }
        //cout<<"\n\n";
    }
    cout<<bs;
}

• Subtask 1: 0 / 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