oj.uz

답안 #1069543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069543 2024-08-22T05:17:16 Z GrindMachine Tricks of the Trade (CEOI23_trade) C++17
0 / 100
 138 ms 22956 KB 
#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];    

    vector<pll> dp(n+5,{-1,-1});

    auto go = [&](ll i, ll lambda, auto &&go) -> pll{
        if(i > n) return {0,0};
        if(dp[i].ss != -1) return dp[i];

        auto p1 = go(i+1,lambda,go), p2 = go(i+1,lambda,go);
        p1.ff += -a[i];
        p2.ff += -a[i]+b[i]-lambda;
        auto px = p1;

        if(p2.ff >= p1.ff){
            px = p2;
            px.ss++;
        }

        return dp[i] = px;
    };

    auto get = [&](ll lambda){
        fill(all(dp),pll{-1,-1});
        pll ans = {0,0};
        rep1(i,n){
            amax(ans,go(i,lambda,go));
        }
        return ans;
    };

    ll lo = -inf1, hi = inf1;
    ll lambda = -inf1-1;

    while(lo <= hi){
        ll mid = (lo+hi) >> 1;
        auto [cost,cnt] = get(mid);
        if(cnt <= k){
            lambda = mid;
            hi = mid-1;
        }
        else{
            lo = mid+1;
        }
    }

    auto [cost,cnt] = get(lambda);
    ll ans = cost+lambda*cnt;
    cout << ans << endl;
}

int main()
{
    fastio;

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

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

    return 0;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 348 KB Partially correct
2 Partially correct 0 ms 348 KB Partially correct

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 348 KB Partially correct
2 Partially correct 0 ms 348 KB Partially correct
3 Partially correct 0 ms 348 KB Partially correct
4 Incorrect 0 ms 456 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 348 KB Partially correct
2 Partially correct 0 ms 348 KB Partially correct
3 Partially correct 0 ms 348 KB Partially correct
4 Incorrect 0 ms 456 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB Partially correct
2 Incorrect 138 ms 22956 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 344 KB Partially correct
2 Incorrect 138 ms 22956 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 348 KB Partially correct
2 Partially correct 0 ms 348 KB Partially correct
3 Partially correct 1 ms 348 KB Partially correct
4 Partially correct 0 ms 348 KB Partially correct
5 Partially correct 0 ms 348 KB Partially correct
6 Incorrect 0 ms 456 KB Output isn't correct
7 Halted 0 ms 0 KB -