제출 #1069514

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069514		GrindMachine	Tricks of the Trade (CEOI23_trade)	C++17	10 / 100	8093 ms	10188 KiB

trade

#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(...) 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<ll> a(n+5), b(n+5);
    rep1(i,n) cin >> a[i];
    rep1(i,n) cin >> b[i];    

    ll ans = -inf2;

    auto go = [&](ll l, ll r, auto &&go) -> pair<vector<ll>,vector<ll>>{
        if(l > r) return {{0},{0}};
        if(l == r){
            return {{0,-a[l]+b[l]},{0,-a[l]+b[l]}};
        }
    
        ll mid = (l+r) >> 1;
        auto [lp,ls] = go(l,mid,go);
        auto [rp,rs] = go(mid+1,r,go);
        ll siz = r-l+1;

        vector<ll> cp(siz+1,-inf2), cs(siz+1,-inf2);
        rep(i,sz(lp)) amax(cp[i],lp[i]);
        rep(i,sz(rs)) amax(cs[i],rs[i]);

        {
            vector<ll> vals;
            ll sum = 0;
            for(int i = l; i <= mid; ++i){
                sum -= a[i];
                vals.pb(b[i]);
            }

            sort(rall(vals));
            rep(j,sz(vals)+1){
                if(j) sum += vals[j-1];
                rep(k,sz(rp)){
                    amax(cp[j+k],sum+rp[k]);
                }
            }
        }

        {
            vector<ll> vals;
            ll sum = 0;
            for(int i = mid+1; i <= r; ++i){
                sum -= a[i];
                vals.pb(b[i]);
            }

            sort(rall(vals));
            rep(j,sz(vals)+1){
                if(j) sum += vals[j-1];
                rep(k,sz(ls)){
                    amax(cs[j+k],sum+ls[k]);
                }
            }
        }

        if(k < sz(cp)) amax(ans,cp[k]);
        if(k < sz(cs)) amax(ans,cs[k]);

        rep(j,sz(ls)){
            ll p = k-j;
            if(p >= 0 and p < sz(rp)){
                amax(ans,ls[j]+rp[p]);
            }
        }

        return {cp,cs};
    };

    go(1,n,go);
    cout << ans << endl;
    rep1(i,n) cout << 0;
    cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

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