oj.uz

Submission #709481

# Submission time Handle Problem Language Result Execution time Memory
709481 2023-03-13T16:51:31 Z PixelCat Two Dishes (JOI19_dishes) C++14
54 / 100
 900 ms 150812 KB 
#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define sz(x) ((int)x.size())
#define all(x) x.begin(), x.end()
#define eb emplace_back
#define int LL
using namespace std;
using LL = long long;
using pii = pair<int, int>;

const int MAXN = 1000010;
const int INF = 8e18;

// range add, range max
#define L(id) ((id) * 2 + 1)
#define R(id) ((id) * 2 + 2)
struct SegTree {
    struct Node {
        int mx, add;
    } a[MAXN << 2];
    void init(int val) {
        For(i, 0, (MAXN << 2) - 1) {
            a[i].mx = val;
            a[i].add = 0;
        }
    }
    void _add(int id, int x) {
        a[id].add += x;
        a[id].mx += x;
    }
    void pull(int id) {
        a[id].mx = max(a[L(id)].mx, a[R(id)].mx);
    }
    void push(int id) {
        if(a[id].add != 0) {
            _add(L(id), a[id].add);
            _add(R(id), a[id].add);
            a[id].add = 0;
        }
    }
    void add(int id, int l, int r, int L, int R, int x) {
        // if(l > R || r < L) return;
        if(l >= L && r <= R) {
            _add(id, x);
            return;
        }
        push(id);
        int m = (l + r) / 2;
        if(L <= m) add(L(id), l, m, L, R, x);
        if(R > m)  add(R(id), m + 1, r, L, R, x);
        pull(id);
    }
    void set(int id, int l, int r, int i, int x) {
        if(l == r) {
            // a[id].mx = max(a[id].mx, x);
            a[id].mx = x;
            a[id].add = 0;
            return;
        }
        push(id);
        int m = (l + r) / 2;
        if(i <= m) set(L(id), l, m, i, x);
        else       set(R(id), m + 1, r, i, x);
        pull(id);
    }
    int ask(int id, int l, int r, int L, int R) {
        if(l >= L && r <= R) return a[id].mx;
        push(id);
        int m = (l + r) / 2;
        int res = -INF;
        if(L <= m) res = max(res, ask(L(id), l, m, L, R));
        if(R > m)  res = max(res, ask(R(id), m + 1, r, L, R));
        pull(id);
        return res;
    }
} seg, seg2, seg3;

int a1[MAXN];
int s1[MAXN];
int p1[MAXN];
int pr1[MAXN];
int t1[MAXN];

int a2[MAXN];
int s2[MAXN];
int p2[MAXN];
int pr2[MAXN];
int t2[MAXN];

// int su[MAXN][MAXN];
int dp[MAXN];

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // NYA =^-w-^=
    int n, m;
// #define QWQ
#ifndef QWQ
    cin >> n >> m;
    assert(n <= MAXN);
    For(i, 1, n) {
        cin >> a1[i] >> s1[i] >> p1[i];
        pr1[i] = pr1[i - 1] + a1[i];
    }
    For(i, 1, m) {
        cin >> a2[i] >> s2[i] >> p2[i];
        pr2[i] = pr2[i - 1] + a2[i];
    }
#else
    mt19937 rng(48763);
    n = m = 5;
    For(i, 1, n) {
        a1[i] = rng() % 10 + 1;
        s1[i] = rng() % 100 + 1;
        // p1[i] = rng() % 21 - 10;
        p1[i] = 1;
        pr1[i] = pr1[i - 1] + a1[i];
    }
    For(i, 1, m) {
        a2[i] = rng() % 10 + 1;
        s2[i] = rng() % 100 + 1;
        // p2[i] = rng() % 21 - 10;
        p2[i] = 1;
        pr2[i] = pr2[i - 1] + a2[i];
    }
#endif

    vector<pair<pii, int>> v;
    For(i, 1, n) {
        auto it = upper_bound(pr2, pr2 + m + 1, s1[i] - pr1[i]);
        t1[i] = it - pr2 - 1;
        if(t1[i] >= 0) v.eb(pii(t1[i], i), 1);
    }
    
    For(i, 1, m) {
        auto it = upper_bound(pr1, pr1 + n + 1, s2[i] - pr2[i]);
        t2[i] = it - pr1 - 1;
        if(t2[i] < n && t2[i] >= 0 && t1[t2[i] + 1] != i - 1) v.eb(pii(i - 1, t2[i] + 1), 0);
    }

    // For(i, 1, n) cout << t1[i] << " \n"[i == n];
    // For(i, 1, m) cout << t2[i] << " \n"[i == m];

    sort(all(v));
    reverse(all(v));
    
    seg.init(-INF);
    seg2.init(0);
    for(auto &i:v) if(i.S) {
        seg2.add(0, 0, n, i.F.S, n, p1[i.F.S]);
    }
    seg.set(0, 0, n, 0, 0);

    For(it, 0, m) {
        if(it && (t2[it] >= 0)) {
            seg.add(0, 0, n, 0, t2[it], p2[it]);
        }
        while(sz(v) && v.back().F.F == it) {
            int i = v.back().F.S;
            int owo = v.back().S;
            // cout << v.back().F.F << " " << i << " " << owo << "\n" << flush;
            v.pop_back();

            int val = seg.ask(0, 0, n, 0, i - 1) + seg2.ask(0, 0, n, i, i);
            // val = max(val, seg.ask(0, 0, n, i, i) + seg2.ask(0, 0, n, i, i));
            if(owo) {
                seg2.add(0, 0, n, i, n, -p1[i]);
                seg.add(0, 0, n, i, n, p1[i]);
            }
            
            seg.set(0, 0, n, i, val - seg2.ask(0, 0, n, i, i));

            // cout << i << " " << it << " " << val << "\n";
        }
    }
    cout << seg.ask(0, 0, n, 0, n) << "\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 146976 KB Output is correct
2 Correct 453 ms 147008 KB Output is correct
3 Correct 392 ms 146108 KB Output is correct
4 Correct 343 ms 144108 KB Output is correct
5 Correct 49 ms 125596 KB Output is correct
6 Correct 451 ms 146384 KB Output is correct
7 Correct 120 ms 133360 KB Output is correct
8 Correct 312 ms 138220 KB Output is correct
9 Correct 390 ms 146048 KB Output is correct
10 Correct 382 ms 146144 KB Output is correct
11 Correct 345 ms 146220 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 125556 KB Output is correct
2 Correct 50 ms 125516 KB Output is correct
3 Correct 47 ms 125540 KB Output is correct
4 Correct 48 ms 125516 KB Output is correct
5 Correct 52 ms 125564 KB Output is correct
6 Correct 49 ms 125660 KB Output is correct
7 Correct 48 ms 125608 KB Output is correct
8 Correct 48 ms 125516 KB Output is correct
9 Correct 50 ms 125524 KB Output is correct
10 Correct 47 ms 125624 KB Output is correct
11 Correct 49 ms 125516 KB Output is correct
12 Correct 48 ms 125544 KB Output is correct
13 Correct 48 ms 125596 KB Output is correct
14 Correct 48 ms 125632 KB Output is correct
15 Correct 52 ms 125576 KB Output is correct
16 Correct 50 ms 125532 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 125556 KB Output is correct
2 Correct 50 ms 125516 KB Output is correct
3 Correct 47 ms 125540 KB Output is correct
4 Correct 48 ms 125516 KB Output is correct
5 Correct 52 ms 125564 KB Output is correct
6 Correct 49 ms 125660 KB Output is correct
7 Correct 48 ms 125608 KB Output is correct
8 Correct 48 ms 125516 KB Output is correct
9 Correct 50 ms 125524 KB Output is correct
10 Correct 47 ms 125624 KB Output is correct
11 Correct 49 ms 125516 KB Output is correct
12 Correct 48 ms 125544 KB Output is correct
13 Correct 48 ms 125596 KB Output is correct
14 Correct 48 ms 125632 KB Output is correct
15 Correct 52 ms 125576 KB Output is correct
16 Correct 50 ms 125532 KB Output is correct
17 Correct 52 ms 125904 KB Output is correct
18 Correct 50 ms 125972 KB Output is correct
19 Correct 53 ms 125964 KB Output is correct
20 Correct 52 ms 125964 KB Output is correct
21 Correct 52 ms 126008 KB Output is correct
22 Correct 52 ms 125972 KB Output is correct
23 Correct 53 ms 125880 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 125556 KB Output is correct
2 Correct 50 ms 125516 KB Output is correct
3 Correct 47 ms 125540 KB Output is correct
4 Correct 48 ms 125516 KB Output is correct
5 Correct 52 ms 125564 KB Output is correct
6 Correct 49 ms 125660 KB Output is correct
7 Correct 48 ms 125608 KB Output is correct
8 Correct 48 ms 125516 KB Output is correct
9 Correct 50 ms 125524 KB Output is correct
10 Correct 47 ms 125624 KB Output is correct
11 Correct 49 ms 125516 KB Output is correct
12 Correct 48 ms 125544 KB Output is correct
13 Correct 48 ms 125596 KB Output is correct
14 Correct 48 ms 125632 KB Output is correct
15 Correct 52 ms 125576 KB Output is correct
16 Correct 50 ms 125532 KB Output is correct
17 Correct 52 ms 125904 KB Output is correct
18 Correct 50 ms 125972 KB Output is correct
19 Correct 53 ms 125964 KB Output is correct
20 Correct 52 ms 125964 KB Output is correct
21 Correct 52 ms 126008 KB Output is correct
22 Correct 52 ms 125972 KB Output is correct
23 Correct 53 ms 125880 KB Output is correct
24 Correct 378 ms 146232 KB Output is correct
25 Correct 394 ms 148540 KB Output is correct
26 Correct 375 ms 146268 KB Output is correct
27 Correct 419 ms 148616 KB Output is correct
28 Correct 463 ms 146764 KB Output is correct
29 Correct 362 ms 146220 KB Output is correct
30 Correct 804 ms 150672 KB Output is correct
31 Correct 115 ms 136080 KB Output is correct
32 Correct 321 ms 138344 KB Output is correct
33 Correct 499 ms 145908 KB Output is correct
34 Correct 699 ms 149772 KB Output is correct
35 Correct 770 ms 150792 KB Output is correct
36 Correct 732 ms 150448 KB Output is correct

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 125556 KB Output is correct
2 Correct 50 ms 125516 KB Output is correct
3 Correct 47 ms 125540 KB Output is correct
4 Correct 48 ms 125516 KB Output is correct
5 Correct 52 ms 125564 KB Output is correct
6 Correct 49 ms 125660 KB Output is correct
7 Correct 48 ms 125608 KB Output is correct
8 Correct 48 ms 125516 KB Output is correct
9 Correct 50 ms 125524 KB Output is correct
10 Correct 47 ms 125624 KB Output is correct
11 Correct 49 ms 125516 KB Output is correct
12 Correct 48 ms 125544 KB Output is correct
13 Correct 48 ms 125596 KB Output is correct
14 Correct 48 ms 125632 KB Output is correct
15 Correct 52 ms 125576 KB Output is correct
16 Correct 50 ms 125532 KB Output is correct
17 Correct 52 ms 125904 KB Output is correct
18 Correct 50 ms 125972 KB Output is correct
19 Correct 53 ms 125964 KB Output is correct
20 Correct 52 ms 125964 KB Output is correct
21 Correct 52 ms 126008 KB Output is correct
22 Correct 52 ms 125972 KB Output is correct
23 Correct 53 ms 125880 KB Output is correct
24 Correct 378 ms 146232 KB Output is correct
25 Correct 394 ms 148540 KB Output is correct
26 Correct 375 ms 146268 KB Output is correct
27 Correct 419 ms 148616 KB Output is correct
28 Correct 463 ms 146764 KB Output is correct
29 Correct 362 ms 146220 KB Output is correct
30 Correct 804 ms 150672 KB Output is correct
31 Correct 115 ms 136080 KB Output is correct
32 Correct 321 ms 138344 KB Output is correct
33 Correct 499 ms 145908 KB Output is correct
34 Correct 699 ms 149772 KB Output is correct
35 Correct 770 ms 150792 KB Output is correct
36 Correct 732 ms 150448 KB Output is correct
37 Correct 417 ms 146288 KB Output is correct
38 Correct 448 ms 148532 KB Output is correct
39 Correct 418 ms 146420 KB Output is correct
40 Correct 418 ms 146220 KB Output is correct
41 Correct 49 ms 125616 KB Output is correct
42 Correct 900 ms 150672 KB Output is correct
43 Correct 520 ms 145860 KB Output is correct
44 Correct 723 ms 149684 KB Output is correct
45 Incorrect 778 ms 150812 KB Output isn't correct
46 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 125556 KB Output is correct
2 Correct 50 ms 125516 KB Output is correct
3 Correct 47 ms 125540 KB Output is correct
4 Correct 48 ms 125516 KB Output is correct
5 Correct 52 ms 125564 KB Output is correct
6 Correct 49 ms 125660 KB Output is correct
7 Correct 48 ms 125608 KB Output is correct
8 Correct 48 ms 125516 KB Output is correct
9 Correct 50 ms 125524 KB Output is correct
10 Correct 47 ms 125624 KB Output is correct
11 Correct 49 ms 125516 KB Output is correct
12 Correct 48 ms 125544 KB Output is correct
13 Correct 48 ms 125596 KB Output is correct
14 Correct 48 ms 125632 KB Output is correct
15 Correct 52 ms 125576 KB Output is correct
16 Correct 50 ms 125532 KB Output is correct
17 Correct 52 ms 125904 KB Output is correct
18 Correct 50 ms 125972 KB Output is correct
19 Correct 53 ms 125964 KB Output is correct
20 Correct 52 ms 125964 KB Output is correct
21 Correct 52 ms 126008 KB Output is correct
22 Correct 52 ms 125972 KB Output is correct
23 Correct 53 ms 125880 KB Output is correct
24 Correct 378 ms 146232 KB Output is correct
25 Correct 394 ms 148540 KB Output is correct
26 Correct 375 ms 146268 KB Output is correct
27 Correct 419 ms 148616 KB Output is correct
28 Correct 463 ms 146764 KB Output is correct
29 Correct 362 ms 146220 KB Output is correct
30 Correct 804 ms 150672 KB Output is correct
31 Correct 115 ms 136080 KB Output is correct
32 Correct 321 ms 138344 KB Output is correct
33 Correct 499 ms 145908 KB Output is correct
34 Correct 699 ms 149772 KB Output is correct
35 Correct 770 ms 150792 KB Output is correct
36 Correct 732 ms 150448 KB Output is correct
37 Correct 417 ms 146288 KB Output is correct
38 Correct 448 ms 148532 KB Output is correct
39 Correct 418 ms 146420 KB Output is correct
40 Correct 418 ms 146220 KB Output is correct
41 Correct 49 ms 125616 KB Output is correct
42 Correct 900 ms 150672 KB Output is correct
43 Correct 520 ms 145860 KB Output is correct
44 Correct 723 ms 149684 KB Output is correct
45 Incorrect 778 ms 150812 KB Output isn't correct
46 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 146976 KB Output is correct
2 Correct 453 ms 147008 KB Output is correct
3 Correct 392 ms 146108 KB Output is correct
4 Correct 343 ms 144108 KB Output is correct
5 Correct 49 ms 125596 KB Output is correct
6 Correct 451 ms 146384 KB Output is correct
7 Correct 120 ms 133360 KB Output is correct
8 Correct 312 ms 138220 KB Output is correct
9 Correct 390 ms 146048 KB Output is correct
10 Correct 382 ms 146144 KB Output is correct
11 Correct 345 ms 146220 KB Output is correct
12 Correct 48 ms 125556 KB Output is correct
13 Correct 50 ms 125516 KB Output is correct
14 Correct 47 ms 125540 KB Output is correct
15 Correct 48 ms 125516 KB Output is correct
16 Correct 52 ms 125564 KB Output is correct
17 Correct 49 ms 125660 KB Output is correct
18 Correct 48 ms 125608 KB Output is correct
19 Correct 48 ms 125516 KB Output is correct
20 Correct 50 ms 125524 KB Output is correct
21 Correct 47 ms 125624 KB Output is correct
22 Correct 49 ms 125516 KB Output is correct
23 Correct 48 ms 125544 KB Output is correct
24 Correct 48 ms 125596 KB Output is correct
25 Correct 48 ms 125632 KB Output is correct
26 Correct 52 ms 125576 KB Output is correct
27 Correct 50 ms 125532 KB Output is correct
28 Correct 52 ms 125904 KB Output is correct
29 Correct 50 ms 125972 KB Output is correct
30 Correct 53 ms 125964 KB Output is correct
31 Correct 52 ms 125964 KB Output is correct
32 Correct 52 ms 126008 KB Output is correct
33 Correct 52 ms 125972 KB Output is correct
34 Correct 53 ms 125880 KB Output is correct
35 Correct 378 ms 146232 KB Output is correct
36 Correct 394 ms 148540 KB Output is correct
37 Correct 375 ms 146268 KB Output is correct
38 Correct 419 ms 148616 KB Output is correct
39 Correct 463 ms 146764 KB Output is correct
40 Correct 362 ms 146220 KB Output is correct
41 Correct 804 ms 150672 KB Output is correct
42 Correct 115 ms 136080 KB Output is correct
43 Correct 321 ms 138344 KB Output is correct
44 Correct 499 ms 145908 KB Output is correct
45 Correct 699 ms 149772 KB Output is correct
46 Correct 770 ms 150792 KB Output is correct
47 Correct 732 ms 150448 KB Output is correct
48 Correct 417 ms 146288 KB Output is correct
49 Correct 448 ms 148532 KB Output is correct
50 Correct 418 ms 146420 KB Output is correct
51 Correct 418 ms 146220 KB Output is correct
52 Correct 49 ms 125616 KB Output is correct
53 Correct 900 ms 150672 KB Output is correct
54 Correct 520 ms 145860 KB Output is correct
55 Correct 723 ms 149684 KB Output is correct
56 Incorrect 778 ms 150812 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 146976 KB Output is correct
2 Correct 453 ms 147008 KB Output is correct
3 Correct 392 ms 146108 KB Output is correct
4 Correct 343 ms 144108 KB Output is correct
5 Correct 49 ms 125596 KB Output is correct
6 Correct 451 ms 146384 KB Output is correct
7 Correct 120 ms 133360 KB Output is correct
8 Correct 312 ms 138220 KB Output is correct
9 Correct 390 ms 146048 KB Output is correct
10 Correct 382 ms 146144 KB Output is correct
11 Correct 345 ms 146220 KB Output is correct
12 Correct 48 ms 125556 KB Output is correct
13 Correct 50 ms 125516 KB Output is correct
14 Correct 47 ms 125540 KB Output is correct
15 Correct 48 ms 125516 KB Output is correct
16 Correct 52 ms 125564 KB Output is correct
17 Correct 49 ms 125660 KB Output is correct
18 Correct 48 ms 125608 KB Output is correct
19 Correct 48 ms 125516 KB Output is correct
20 Correct 50 ms 125524 KB Output is correct
21 Correct 47 ms 125624 KB Output is correct
22 Correct 49 ms 125516 KB Output is correct
23 Correct 48 ms 125544 KB Output is correct
24 Correct 48 ms 125596 KB Output is correct
25 Correct 48 ms 125632 KB Output is correct
26 Correct 52 ms 125576 KB Output is correct
27 Correct 50 ms 125532 KB Output is correct
28 Correct 52 ms 125904 KB Output is correct
29 Correct 50 ms 125972 KB Output is correct
30 Correct 53 ms 125964 KB Output is correct
31 Correct 52 ms 125964 KB Output is correct
32 Correct 52 ms 126008 KB Output is correct
33 Correct 52 ms 125972 KB Output is correct
34 Correct 53 ms 125880 KB Output is correct
35 Correct 378 ms 146232 KB Output is correct
36 Correct 394 ms 148540 KB Output is correct
37 Correct 375 ms 146268 KB Output is correct
38 Correct 419 ms 148616 KB Output is correct
39 Correct 463 ms 146764 KB Output is correct
40 Correct 362 ms 146220 KB Output is correct
41 Correct 804 ms 150672 KB Output is correct
42 Correct 115 ms 136080 KB Output is correct
43 Correct 321 ms 138344 KB Output is correct
44 Correct 499 ms 145908 KB Output is correct
45 Correct 699 ms 149772 KB Output is correct
46 Correct 770 ms 150792 KB Output is correct
47 Correct 732 ms 150448 KB Output is correct
48 Correct 417 ms 146288 KB Output is correct
49 Correct 448 ms 148532 KB Output is correct
50 Correct 418 ms 146420 KB Output is correct
51 Correct 418 ms 146220 KB Output is correct
52 Correct 49 ms 125616 KB Output is correct
53 Correct 900 ms 150672 KB Output is correct
54 Correct 520 ms 145860 KB Output is correct
55 Correct 723 ms 149684 KB Output is correct
56 Incorrect 778 ms 150812 KB Output isn't correct
57 Halted 0 ms 0 KB -