제출 #1150187

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1150187		Zero_OP	Two Dishes (JOI19_dishes)	C++20	0 / 100	214 ms	67108 KiB

dishes

#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, l, r) for(int i = (l) - 1; i >= (r); --i)

#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second

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

#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 db = double;
using ld = long double;
using ull = unsigned long long;

using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;

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

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

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

    void apply_add(int id, ll val){
        st[id] += val;
        lazy_add[id] += val;
        if(lazy_max[id] != LLONG_MIN) 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] != LLONG_MIN){
            apply_max(id << 1, lazy_max[id]);
            apply_max(id << 1 | 1, lazy_max[id]);
            lazy_max[id] = LLONG_MIN;
        }
    }

    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(u <= l && r <= v) return st[id];
        int mid = l + r >> 1;
        down(id);
        if(u > mid)  return query(id << 1 | 1, mid + 1, r, u, v);
        if(mid >= v) return query(id << 1, l, mid, u, v);
        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 << dbg(l) << " : " << dbg(st[id]) << '\n';
        else{
            int mid = l + r >> 1;
            down(id);
            debug(id << 1, l, mid);
            debug(id << 1 | 1, mid + 1, r);
        }
    }
};

const int MAX = 1e6 + 5;

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

void testcase(int num_testcase){
    cin >> N >> M;
    FOR(i, 1, N+1) cin >> A[i] >> S[i] >> P[i];
    FOR(i, 1, M+1) cin >> B[i] >> T[i] >> Q[i];

    vl sumA(N+1), sumB(M+1);
    FOR(i, 1, N+1) sumA[i] = sumA[i - 1] + A[i];
    FOR(i, 1, M+1) sumB[i] = sumB[i - 1] + B[i];

    vi X(N+1), Y(M+1);
    FOR(i, 1, N+1){
        X[i] = upper_bound(all(sumB), S[i] - sumA[i]) - sumB.begin() - 1; //sumA[i] + sumB[j] <= S[i]
//        cout << '(' << i << ',' << X[i] << ") : " << P[i] << '\n';
        if(X[i] >= 0) points[X[i]].pb(mp(i, +P[i]));
    }

//    cout << '\n';
    FOR(i, 1, M+1){
        Y[i] = upper_bound(all(sumA), T[i] - sumB[i]) - sumA.begin() - 1; //sumB[i] + sumA[j] <= T[i]
//        cout << '(' << Y[i] << ',' << i << ") : " << Q[i] << '\n';
        if(Y[i] >= 0){
            points[i].pb(mp(Y[i], Q[i]));
            if(Y[i]+1 <= N) points[i-1].pb(mp(Y[i]+1, -Q[i]));
        }
    }
//    cout << '\n';

    SegmentTree tr(N+1);
    FOR(i, 0, M+1){
        sort(all(points[i]));
//        for(auto [j, delta] : points[i]){
//            cout << '(' << i << ',' << j << ") = " << delta << '\n';
//        }
//        continue;
        vector<pair<int, ll>> reduced_points;
        int last = -1; ll total_sum = 0;
        FOR(j, 0, sz(points[i])){
            ll sum = points[i][j].ss;
            while(j+1 < sz(points[i]) && points[i][j].ff == points[i][j+1].ff) sum += points[i][++j].ss;
            reduced_points.pb(mp(points[i][j].ff, sum));
            tr.update_add(1, 0, N, points[i][j].ff, N, sum);
        }

        swap(reduced_points, points[i]);
        if(i > 0){
            ll pref = 0, max_pref = 0;
            FOR(j, 0, sz(points[i-1])){
                int lst = (j+1 < sz(points[i-1]) ? points[i-1][j].ff - 1 : N);
                pref += points[i-1][j].ss;
                ll cur = pref - max_pref;
                maximize(max_pref, pref);
                if(cur < 0) {
                    tr.update_add(1, 0, N, points[i-1][j].ff, lst, -cur);
                }
            }
        }
    }

    cout << tr.query(1, 0, N, N, N) << '\n';
}

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

    file("task");

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

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

dishes.cpp: In function 'int main()':
dishes.cpp:23:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |                         freopen(task".inp", "r", stdin); \
      |                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:197:5: note: in expansion of macro 'file'
  197 |     file("task");
      |     ^~~~
dishes.cpp:24:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |                         freopen(task".out", "w", stdout); }
      |                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:197:5: note: in expansion of macro 'file'
  197 |     file("task");
      |     ^~~~

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