Submission #1150440

#	Time	Username	Problem	Language	Result	Execution time	Memory
1150440		Zero_OP	Two Dishes (JOI19_dishes)	C++20	100 / 100	3495 ms	223572 KiB

dishes

#include <bits/stdc++.h>

using namespace std;

//loops (warning : long long)
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r - 1); i >= l; --i)

//pairs, tuples
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second

//vectors
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define pb push_back
#define eb emplace_back
#define sum_of(v) accumulate(all(v), 0ll)
#define sz(v) (int)v.size()
#define compact(v) v.erase(unique(all(v)), end(v))

//binary search
#define lwb lower_bound
#define upb upper_bound

//other stuffs
#define dbg(x) "[" #x " = " << (x) << "]"
#define file(task) if(fopen(task".inp", "r")){ freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); }

template<typename T>
bool minimize(T& a, const T& b){
    if(a > b) return a = b, true;
    return false;
}

template<typename T>
bool maximize(T& a, const T& b){
    if(a < b) return a = b, true;
    return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using db = double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAX = 1e6 + 5;
const ll inf = 4e18;

int N, M;
ll A[MAX], B[MAX], S[MAX], T[MAX], P[MAX], Q[MAX];
vector<pair<int, ll>> events[MAX];

struct SegmentTree{
    vl st, lazy_add, lazy_max;
    SegmentTree(int n) : st(n << 2), lazy_max(n << 2, -inf), lazy_add(n << 2) {}

    void apply_add(int id, ll val){
        st[id] += val;
        lazy_add[id] += val;
        if(lazy_max[id] != -inf) lazy_max[id] += val;
    }

    void apply_max(int id, ll val){
        maximize(st[id], val);
        maximize(lazy_max[id], val);
    }

    void down(int id){
        if(lazy_add[id] != 0){
            apply_add(id << 1, lazy_add[id]);
            apply_add(id << 1 | 1, lazy_add[id]);
            lazy_add[id] = 0;
        }

        if(lazy_max[id] != -inf){
            apply_max(id << 1, lazy_max[id]);
            apply_max(id << 1 | 1, lazy_max[id]);
            lazy_max[id] = -inf;
        }
    }

    void update_add(int id, int l, int r, int u, int v, ll val){
        if(u <= l && r <= v) apply_add(id, val);
        else{
            int mid = l + r >> 1;
            down(id);
            if(u <= mid) update_add(id << 1, l, mid, u, v, val);
            if(mid < v)  update_add(id << 1 | 1, mid + 1, r, u, v, val);
            st[id] = max(st[id << 1], st[id << 1 | 1]);
        }
    }

    void update_max(int id, int l, int r, int u, int v, ll val){
        if(u <= l && r <= v) apply_max(id, val);
        else{
            int mid = l + r >> 1;
            down(id);
            if(u <= mid) update_max(id << 1, l, mid, u, v, val);
            if(mid < v)  update_max(id << 1 | 1, mid + 1, r, u, v, val);
            st[id] = max(st[id << 1], st[id << 1 | 1]);
        }
    }

    ll query(int id, int l, int r, int u, int v){
        if(v < l || u > r) return LLONG_MIN;
        if(u <= l && r <= v) return st[id];
        int mid = l + r >> 1;
        down(id);
        return max(query(id << 1, l, mid, u, v), query(id << 1 | 1, mid + 1, r, u, v));
    }

    void debug(int id, int l, int r){
        if(l == r) cout << st[id] << ' ';
        else{
            int mid = l + r >> 1;
            down(id);
            debug(id << 1, l, mid);
            debug(id << 1 | 1, mid + 1, r);
        }
    }
};

void testcase(int ntestcase){
    cin >> N >> M;
    FOR(i, 1, N+1){
        cin >> A[i] >> S[i] >> P[i];
        A[i] += A[i-1];
    }

    FOR(i, 1, M+1){
        cin >> B[i] >> T[i] >> Q[i];
        B[i] += B[i-1];
    }

    FOR(i, 1, N+1){
        int reach = upper_bound(B, B + M + 1, S[i] - A[i]) - B - 1;
        if(reach >= 0){
            //(i, X[i]) with +P[i]
//            cout << "A : " << "(" << i << ", " << reach << ") : " << P[i] << '\n';
            events[i].pb(mp(reach, +P[i]));
        }
    }

    ll result = 0;
    FOR(i, 1, M+1){
        int reach = upper_bound(A, A + N + 1, T[i] - B[i]) - A - 1;
        if(reach >= 0){
            //(Y[i], i) with +Q[i]
            //(Y[i]+1, i-1) with -Q[i]
//            cout << "B : " << "(" << reach << ", " << i << ") : " << Q[i] << '\n';
//            events[reach].pb(mp(i, +Q[i]));
            result += Q[i];
            if(reach+1 <= N) events[reach+1].pb(mp(i-1, -Q[i]));
        }
    }

//    cout << result << '\n';

    SegmentTree T(M+1);
    FOR(i, 0, N+1){
        sort(rall(events[i]));
        //reduce
        FOR(j, 0, sz(events[i])){
            ll sum = events[i][j].ss;
            while(j+1 < sz(events[i]) && events[i][j].ff == events[i][j+1].ff){
                ++j;
                sum += events[i][j].ss;
            }

            int y = events[i][j].ff;
//            cout << i << ' ' << y << ' ' << sum << ' ';
            ll cur = T.query(1, 0, M, 0, y);
//            cout << dbg(cur) << '\n';
            T.update_max(1, 0, M, y, M, cur);
            T.update_add(1, 0, M, 0, y, +sum);
        }

//        cout << dbg(i) << " : "; T.debug(1, 0, M); cout << '\n';
    }

    result += T.query(1, 0, M, 0, M);
    cout << result << '\n';
}

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

#ifdef LOCAL
    freopen("task.inp", "r", stdin);
    freopen("task.out", "w", stdout);
#endif // LOCAL

    int T = 1;
//    cin >> T;
    FOR(i, 0, T) testcase(i);

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 3 / 3
• Subtask 3: 7 / 7
• Subtask 4: 39 / 39
• Subtask 5: 11 / 11
• Subtask 6: 9 / 9
• Subtask 7: 17 / 17
• Subtask 8: 9 / 9