Submission #922727

#	Time	Username	Problem	Language	Result	Execution time	Memory
922727		GrindMachine	Let's Win the Election (JOI22_ho_t3)	C++17	100 / 100	1040 ms	2648 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
 
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
 
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
 
template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}
 
template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}
 
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
 
/*
 
 
 
*/
 
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
 
void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    vector<pll> a(n);
    rep(i,n) cin >> a[i].ff >> a[i].ss;
    rep(i,n) if(a[i].ss == -1) a[i].ss = inf2;
 
    auto cmp = [&](pll p1, pll p2){
        return p1.ss < p2.ss;
    };
 
    sort(all(a),cmp);

    ll sum[n+5][n+5];
    memset(sum,0x3f,sizeof sum);
    sum[n][0] = 0;

    rev(i,n-1,0){
        sum[i][0] = 0;
        rep1(j,n){
            sum[i][j] = min(sum[i+1][j],sum[i+1][j-1]+a[i].ff);
        }
    }

    ld ans = inf2;
    amin(ans,(ld)sum[0][k]);

    vector<ld> dp1(n+5,inf2), dp2(n+5,inf2);

    rep1(cnt,n){
        fill(all(dp1),inf2);
        dp1[0] = 0;

        rep(i,n){
            fill(all(dp2),inf2);
            rep(guys,i+1){
                // vote
                amin(dp2[guys],dp1[guys]+(ld)a[i].ff/(cnt+1));

                // collab
                amin(dp2[guys+1],dp1[guys]+(ld)a[i].ss/(guys+1));
            }

            dp1 = dp2;

            ll votes = i+1;
            if(votes >= k){
                amin(ans,dp1[cnt]);
            }
            else{
                ll more = k-votes;
                amin(ans,dp1[cnt]+(ld)sum[i+1][more]/(cnt+1));
            }
        }
    }
 
    cout << fixed << setprecision(11);
    cout << ans << endl;
}
 
int main()
{
    fastio;
 
    int t = 1;
    // cin >> t;
 
    rep1(i, t) {
        solve(i);
    }
 
    return 0;
}

• 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