제출 #1026304

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1026304		Hando	Cloud Computing (CEOI18_clo)	C++17	0 / 100	433 ms	3668 KiB

clo

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <tr2/dynamic_bitset>

using namespace std;
using namespace __gnu_pbds;
using namespace tr2;

#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back
#define mt make_tuple

#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(x) (int)x.size()
#define uniq(x) unique(all(x)), x.end()

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template<class Fun> class y_combinator_result {
    Fun fun_;
public:
    template<class T> explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
    template<class ...Args> decltype(auto) operator()(Args &&...args) { return fun_(std::ref(*this), std::forward<Args>(args)...); }
};
template<class Fun> decltype(auto) y_combinator(Fun &&fun) { return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun)); }

template <class T, size_t N>
void re(array <T, N>& x);
template <class T> 
void re(vt <T>& x);

template <class T> 
void re(T& x) {
    cin >> x;
}

template <class T, class... M> 
void re(T& x, M&... args) {
    re(x), re(args...);
}

template <class T> 
void re(vt <T>& x) {
    for(auto& it : x) re(it);
}

template <class T, size_t N>
void re(array <T, N>& x) {
    for(auto& it : x) re(it);
}

template <class T, size_t N>
void wr(const array <T, N>& x);
template <class T> 
void wr(const vt <T>& x);

template <class T> 
void wr(const T& x) {
    cout << x;
}

template <class T, class ...M>  
void wr(const T& x, const M&... args) {
    wr(x), wr(args...);
}

template <class T> 
void wr(const vt <T>& x) {
    for(auto it : x) wr(it, ' ');
}

template <class T, size_t N>
void wr(const array <T, N>& x) {
    for(auto it : x) wr(it, ' ');
}

template<class T, class... M>
auto mvt(size_t n, M&&... args) {
    if constexpr(sizeof...(args) == 1)
        return vector<T>(n, args...);
    else
        return vector(n, mvt<T>(args...));
}

void set_fixed(int p = 0) {
    cout << fixed << setprecision(p);
}

void set_scientific() {
    cout << scientific;
}

void Open(const string& name) {
#ifndef ONLINE_JUDGE
    (void)!freopen((name + ".in").c_str(), "r", stdin);
    (void)!freopen((name + ".out").c_str(), "w", stdout);
#endif
}

struct segtree {
    vt <ll> t;
    int n;
    segtree(int _n) {
        n = _n;
        t = vt <ll>(2 * n, 0);
    }

    inline ll comb(ll l, ll r) {
        return max(l, r);
    }

    void build(vt <int>& a) {
        for(int i = 0;i < n;i++)
            t[i + n] = a[i];
        for (int i = n - 1;i > 0;i--)
            t[i] = comb(t[i << 1], t[i << 1 | 1]);
    }

    void upd(int p, ll v) {
        --p;
        for(t[p += n] = v;p >>= 1;)
            t[p] = comb(t[p << 1], t[p << 1 | 1]);
    }

    int query(int l, int r) {
        if (r < l) return 0;
        int resl = 0, resr = 0;
        --l;
        for(l += n, r += n;l < r;l >>= 1, r >>= 1) {
            if(l & 1) resl = comb(resl, t[l++]);
            if(r & 1) resr = comb(t[--r], resr);
        }
        return comb(resl, resr);
    }
};

void solve() {
    int n; re(n);
    vt <ar <int, 3>> a(n); re(a);
    int m; re(m);
    vt <ar <int, 3>> b(m); re(b);

    vt <int> compress;
    for (auto& [x, y, z] : a)
        compress.pub(y);
    for (auto& [x, y, z] : b)
        compress.pub(y);

    sort(all(compress));
    
    for (auto& [x, y, z] : a)
        y = lower_bound(all(compress), y) - compress.begin();
    for (auto& [x, y, z] : b)
        y = lower_bound(all(compress), y) - compress.begin();
    
    // dp0 yields the minimal sum and maximal clock rate to form i cores
    vt <bool> check0(100'005);
    vt <ar <ll, 2>> dp0(100'005, {(ll)1e18, (ll)1e18}); 
   
    check0[0] = true;
    dp0[0] = {0, (ll)1e18};
    
    for (auto& [x, y, z] : a)
        for (int i = 100'000; i >= x; --i)
            if (check0[i - x] && dp0[i - x][0] + z < dp0[i][0]) {
                check0[i] = true;
                dp0[i] = {dp0[i - x][0] + z, min(dp0[i - x][1], (ll)y)};
            } else if (check0[i - x] && dp0[i - x][0] + z == dp0[i][0]) {
                if (min(dp0[i - x][1], (ll)y) > dp0[i][1])
                    dp0[i] = {dp0[i][0], min(dp0[i - x][1], (ll)y)};
            }

    // dp1 yields the maximum sum and minimal clock rate to form i core
    vt <bool> check1(100'005);
    vt <ar <ll, 2>> dp1(100'005, {(ll)-1e18, (ll)-1e18});
    
    check1[0] = true;
    dp1[0] = {0, (ll)-1e18};

    for (auto& [x, y, z] : b)
        for (int i = 100'000; i >= x; --i)
            if (check1[i - x] && dp1[i - x][0] + z > dp1[i][0]) {
                check1[i] = true;
                dp1[i] = {dp1[i - x][0] + z, max(dp1[i - x][1], (ll)y)};
            } else {
                if (max(dp1[i - x][1], (ll)y) < dp1[i][1])
                    dp1[i] = {dp1[i][0], max(dp1[i - x][1], (ll)y)};
            }

    ll res = 0;
    segtree T(len(compress) + 5);
    for (int i = 1; i <= 100'000; ++i) {
        if (check1[i]) {
            T.upd(dp1[i][1] + 1, dp1[i][0]);
        }

        if (check0[i]) {
            res = max(res, T.query(1, dp0[i][1] + 1) - dp0[i][0]);
        }
    } 

    wr(res, '\n');
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    //Open("");

    int t = 1;
    for(;t;t--) {
        solve();
    }
    
    return 0;
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 18
• Subtask 3: 0 / 18
• Subtask 4: 0 / 18
• Subtask 5: 0 / 18
• Subtask 6: 0 / 10