Submission #1217300

#	Time	Username	Problem	Language	Result	Execution time	Memory
1217300		12345678	Tricks of the Trade (CEOI23_trade)	C++20	20 / 100	1914 ms	397984 KiB

trade

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const ll nx=250005, kx=201, inf=1e18;

ll n, k, c[nx], s[nx], qs[nx], dp[kx][nx], ans=-inf;

void solve(int l, int r, int optl, int optr, int layer)
{
    if (r<l) return;
    int md=(l+r)/2;
    pair<ll, ll> mx={-inf, 0};
    for (int i=optl; i<=min(optr, md-1); i++) mx=max(mx, {dp[layer-1][i]+qs[i]-qs[md]+s[md], i});
    dp[layer][md]=mx.first;
    //cout<<"debug "<<layer<<' '<<md<<' '<<dp[layer][md]<<'\n';
    solve(l, md-1, optl, mx.second, layer);
    solve(md+1, r, mx.second, optr, layer);
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=1; i<=n; i++) cin>>c[i], qs[i]=qs[i-1]+c[i];
    for (int i=1; i<=n; i++) cin>>s[i];
    for (int i=1; i<=k; i++) for (int j=0; j<=n; j++) dp[i][j]=-inf;
    for (int i=1; i<=k; i++) solve(i, n, 0, n, i);
    for (int i=k; i<=n; i++) ans=max(ans, dp[k][i]);
    cout<<ans<<'\n';
    for (int i=1; i<=n; i++) cout<<'0';
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 10
• Subtask 2: 0 / 10
• Subtask 3: 5 / 10
• Subtask 4: 10 / 25
• Subtask 5: 0 / 45