Submission #871093

#	Time	Username	Problem	Language	Result	Execution time	Memory
871093		HorizonWest	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	728 ms	1002836 KiB

Main

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

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void printdb(double ans, int k)
{
    cout << setiosflags(ios::fixed)
         << setiosflags(ios::showpoint)
         << setprecision(k) << ans << endl;
}

void solve()
{
    int n, m; cin >> n >> m; 
    vector <pair<int, int>> v(n); 
    for(auto& u : v) 
    {
        cin >> u.sd >> u.fs;
        if(u.fs == -1) u.fs = Inf;  
    } 
    sort(all(v)); 

    vector <vector<vector<db>>> dp(n + 2, vector <vector<db>> (
        m + 2, vector <db> (m + 2, Inf)
    )); 

    db ans = Inf; dp[0][1][0] = 0; 

    for(int i = 0; i < n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            for(int k = 0; k < m; k++)
            {
                dp[i+1][j][k] = min(dp[i+1][j][k], dp[i][j][k]);  
                dp[i+1][j][k+1] = min(dp[i+1][j][k+1], dp[i][j][k] + v[i].sd / db(j)); 
                if(v[i].fs != Inf)
                {
                    dp[i+1][j+1][k+1] = min(dp[i+1][j+1][k+1], dp[i][j][k] + v[i].fs / db(j)); 
                } 
            }
            ans = min(ans, dp[i+1][j][m]); 
        }
    }

    printdb(ans, 5); 
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    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