oj.uz

Submission #709448

# Submission time Handle Problem Language Result Execution time Memory
709448 2023-03-13T15:29:36 Z PixelCat Two Dishes (JOI19_dishes) C++14
74 / 100
 4859 ms 229012 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].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));
        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] = 1;
        pr1[i] = pr1[i - 1] + a1[i];
    }
    For(i, 1, m) {
        a2[i] = rng() % 10 + 1;
        s2[i] = rng() % 100 + 1;
        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(p2[i] < 0 && t2[i] < n && t2[i] >= 0) v.eb(pii(i - 1, t2[i] + 1), 0);
    }

    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();

            if(owo) {
                seg2.add(0, 0, n, i, n, -p1[i]);
                seg.add(0, 0, n, i, n, p1[i]);
            }
            
            int val = seg.ask(0, 0, n, 0, i - 1) + seg2.ask(0, 0, n, i, i);
            if(it <= t1[i]) val += p1[i];
            val = max(val, seg.ask(0, 0, n, i, i) + seg2.ask(0, 0, n, i, i));
            seg.set(0, 0, n, i, val - seg2.ask(0, 0, n, i, i));
        }
    }
    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 448 ms 146972 KB Output is correct
2 Correct 460 ms 147064 KB Output is correct
3 Correct 522 ms 147300 KB Output is correct
4 Correct 349 ms 145144 KB Output is correct
5 Correct 50 ms 125516 KB Output is correct
6 Correct 423 ms 146520 KB Output is correct
7 Correct 121 ms 134732 KB Output is correct
8 Correct 321 ms 139508 KB Output is correct
9 Correct 420 ms 147256 KB Output is correct
10 Correct 392 ms 147244 KB Output is correct
11 Correct 368 ms 147316 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 125596 KB Output is correct
2 Correct 51 ms 125576 KB Output is correct
3 Correct 54 ms 125508 KB Output is correct
4 Correct 50 ms 125560 KB Output is correct
5 Correct 50 ms 125608 KB Output is correct
6 Correct 49 ms 125516 KB Output is correct
7 Correct 58 ms 125600 KB Output is correct
8 Correct 52 ms 125564 KB Output is correct
9 Correct 52 ms 125516 KB Output is correct
10 Correct 52 ms 125616 KB Output is correct
11 Correct 49 ms 125568 KB Output is correct
12 Correct 50 ms 125532 KB Output is correct
13 Correct 50 ms 125612 KB Output is correct
14 Correct 50 ms 125572 KB Output is correct
15 Correct 49 ms 125624 KB Output is correct
16 Correct 60 ms 125596 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 125596 KB Output is correct
2 Correct 51 ms 125576 KB Output is correct
3 Correct 54 ms 125508 KB Output is correct
4 Correct 50 ms 125560 KB Output is correct
5 Correct 50 ms 125608 KB Output is correct
6 Correct 49 ms 125516 KB Output is correct
7 Correct 58 ms 125600 KB Output is correct
8 Correct 52 ms 125564 KB Output is correct
9 Correct 52 ms 125516 KB Output is correct
10 Correct 52 ms 125616 KB Output is correct
11 Correct 49 ms 125568 KB Output is correct
12 Correct 50 ms 125532 KB Output is correct
13 Correct 50 ms 125612 KB Output is correct
14 Correct 50 ms 125572 KB Output is correct
15 Correct 49 ms 125624 KB Output is correct
16 Correct 60 ms 125596 KB Output is correct
17 Correct 58 ms 125984 KB Output is correct
18 Correct 59 ms 125840 KB Output is correct
19 Correct 57 ms 125924 KB Output is correct
20 Correct 51 ms 125932 KB Output is correct
21 Correct 51 ms 125912 KB Output is correct
22 Correct 50 ms 125916 KB Output is correct
23 Correct 55 ms 125828 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 125596 KB Output is correct
2 Correct 51 ms 125576 KB Output is correct
3 Correct 54 ms 125508 KB Output is correct
4 Correct 50 ms 125560 KB Output is correct
5 Correct 50 ms 125608 KB Output is correct
6 Correct 49 ms 125516 KB Output is correct
7 Correct 58 ms 125600 KB Output is correct
8 Correct 52 ms 125564 KB Output is correct
9 Correct 52 ms 125516 KB Output is correct
10 Correct 52 ms 125616 KB Output is correct
11 Correct 49 ms 125568 KB Output is correct
12 Correct 50 ms 125532 KB Output is correct
13 Correct 50 ms 125612 KB Output is correct
14 Correct 50 ms 125572 KB Output is correct
15 Correct 49 ms 125624 KB Output is correct
16 Correct 60 ms 125596 KB Output is correct
17 Correct 58 ms 125984 KB Output is correct
18 Correct 59 ms 125840 KB Output is correct
19 Correct 57 ms 125924 KB Output is correct
20 Correct 51 ms 125932 KB Output is correct
21 Correct 51 ms 125912 KB Output is correct
22 Correct 50 ms 125916 KB Output is correct
23 Correct 55 ms 125828 KB Output is correct
24 Correct 417 ms 147224 KB Output is correct
25 Correct 563 ms 144828 KB Output is correct
26 Correct 384 ms 147156 KB Output is correct
27 Correct 567 ms 144816 KB Output is correct
28 Correct 464 ms 146524 KB Output is correct
29 Correct 401 ms 147068 KB Output is correct
30 Correct 689 ms 147040 KB Output is correct
31 Correct 114 ms 134596 KB Output is correct
32 Correct 484 ms 139404 KB Output is correct
33 Correct 427 ms 144604 KB Output is correct
34 Correct 620 ms 146620 KB Output is correct
35 Correct 618 ms 147036 KB Output is correct
36 Correct 668 ms 146932 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 125596 KB Output is correct
2 Correct 51 ms 125576 KB Output is correct
3 Correct 54 ms 125508 KB Output is correct
4 Correct 50 ms 125560 KB Output is correct
5 Correct 50 ms 125608 KB Output is correct
6 Correct 49 ms 125516 KB Output is correct
7 Correct 58 ms 125600 KB Output is correct
8 Correct 52 ms 125564 KB Output is correct
9 Correct 52 ms 125516 KB Output is correct
10 Correct 52 ms 125616 KB Output is correct
11 Correct 49 ms 125568 KB Output is correct
12 Correct 50 ms 125532 KB Output is correct
13 Correct 50 ms 125612 KB Output is correct
14 Correct 50 ms 125572 KB Output is correct
15 Correct 49 ms 125624 KB Output is correct
16 Correct 60 ms 125596 KB Output is correct
17 Correct 58 ms 125984 KB Output is correct
18 Correct 59 ms 125840 KB Output is correct
19 Correct 57 ms 125924 KB Output is correct
20 Correct 51 ms 125932 KB Output is correct
21 Correct 51 ms 125912 KB Output is correct
22 Correct 50 ms 125916 KB Output is correct
23 Correct 55 ms 125828 KB Output is correct
24 Correct 417 ms 147224 KB Output is correct
25 Correct 563 ms 144828 KB Output is correct
26 Correct 384 ms 147156 KB Output is correct
27 Correct 567 ms 144816 KB Output is correct
28 Correct 464 ms 146524 KB Output is correct
29 Correct 401 ms 147068 KB Output is correct
30 Correct 689 ms 147040 KB Output is correct
31 Correct 114 ms 134596 KB Output is correct
32 Correct 484 ms 139404 KB Output is correct
33 Correct 427 ms 144604 KB Output is correct
34 Correct 620 ms 146620 KB Output is correct
35 Correct 618 ms 147036 KB Output is correct
36 Correct 668 ms 146932 KB Output is correct
37 Correct 449 ms 146804 KB Output is correct
38 Correct 440 ms 144500 KB Output is correct
39 Correct 435 ms 146860 KB Output is correct
40 Correct 445 ms 146684 KB Output is correct
41 Correct 54 ms 125632 KB Output is correct
42 Correct 798 ms 146584 KB Output is correct
43 Correct 465 ms 144056 KB Output is correct
44 Correct 645 ms 146420 KB Output is correct
45 Correct 671 ms 146736 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 125596 KB Output is correct
2 Correct 51 ms 125576 KB Output is correct
3 Correct 54 ms 125508 KB Output is correct
4 Correct 50 ms 125560 KB Output is correct
5 Correct 50 ms 125608 KB Output is correct
6 Correct 49 ms 125516 KB Output is correct
7 Correct 58 ms 125600 KB Output is correct
8 Correct 52 ms 125564 KB Output is correct
9 Correct 52 ms 125516 KB Output is correct
10 Correct 52 ms 125616 KB Output is correct
11 Correct 49 ms 125568 KB Output is correct
12 Correct 50 ms 125532 KB Output is correct
13 Correct 50 ms 125612 KB Output is correct
14 Correct 50 ms 125572 KB Output is correct
15 Correct 49 ms 125624 KB Output is correct
16 Correct 60 ms 125596 KB Output is correct
17 Correct 58 ms 125984 KB Output is correct
18 Correct 59 ms 125840 KB Output is correct
19 Correct 57 ms 125924 KB Output is correct
20 Correct 51 ms 125932 KB Output is correct
21 Correct 51 ms 125912 KB Output is correct
22 Correct 50 ms 125916 KB Output is correct
23 Correct 55 ms 125828 KB Output is correct
24 Correct 417 ms 147224 KB Output is correct
25 Correct 563 ms 144828 KB Output is correct
26 Correct 384 ms 147156 KB Output is correct
27 Correct 567 ms 144816 KB Output is correct
28 Correct 464 ms 146524 KB Output is correct
29 Correct 401 ms 147068 KB Output is correct
30 Correct 689 ms 147040 KB Output is correct
31 Correct 114 ms 134596 KB Output is correct
32 Correct 484 ms 139404 KB Output is correct
33 Correct 427 ms 144604 KB Output is correct
34 Correct 620 ms 146620 KB Output is correct
35 Correct 618 ms 147036 KB Output is correct
36 Correct 668 ms 146932 KB Output is correct
37 Correct 449 ms 146804 KB Output is correct
38 Correct 440 ms 144500 KB Output is correct
39 Correct 435 ms 146860 KB Output is correct
40 Correct 445 ms 146684 KB Output is correct
41 Correct 54 ms 125632 KB Output is correct
42 Correct 798 ms 146584 KB Output is correct
43 Correct 465 ms 144056 KB Output is correct
44 Correct 645 ms 146420 KB Output is correct
45 Correct 671 ms 146736 KB Output is correct
46 Correct 1949 ms 228388 KB Output is correct
47 Correct 1596 ms 216228 KB Output is correct
48 Correct 2025 ms 228208 KB Output is correct
49 Correct 2222 ms 227912 KB Output is correct
50 Correct 4859 ms 229012 KB Output is correct
51 Correct 2736 ms 213384 KB Output is correct
52 Correct 3559 ms 224036 KB Output is correct
53 Correct 3900 ms 227224 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 146972 KB Output is correct
2 Correct 460 ms 147064 KB Output is correct
3 Correct 522 ms 147300 KB Output is correct
4 Correct 349 ms 145144 KB Output is correct
5 Correct 50 ms 125516 KB Output is correct
6 Correct 423 ms 146520 KB Output is correct
7 Correct 121 ms 134732 KB Output is correct
8 Correct 321 ms 139508 KB Output is correct
9 Correct 420 ms 147256 KB Output is correct
10 Correct 392 ms 147244 KB Output is correct
11 Correct 368 ms 147316 KB Output is correct
12 Correct 52 ms 125596 KB Output is correct
13 Correct 51 ms 125576 KB Output is correct
14 Correct 54 ms 125508 KB Output is correct
15 Correct 50 ms 125560 KB Output is correct
16 Correct 50 ms 125608 KB Output is correct
17 Correct 49 ms 125516 KB Output is correct
18 Correct 58 ms 125600 KB Output is correct
19 Correct 52 ms 125564 KB Output is correct
20 Correct 52 ms 125516 KB Output is correct
21 Correct 52 ms 125616 KB Output is correct
22 Correct 49 ms 125568 KB Output is correct
23 Correct 50 ms 125532 KB Output is correct
24 Correct 50 ms 125612 KB Output is correct
25 Correct 50 ms 125572 KB Output is correct
26 Correct 49 ms 125624 KB Output is correct
27 Correct 60 ms 125596 KB Output is correct
28 Correct 58 ms 125984 KB Output is correct
29 Correct 59 ms 125840 KB Output is correct
30 Correct 57 ms 125924 KB Output is correct
31 Correct 51 ms 125932 KB Output is correct
32 Correct 51 ms 125912 KB Output is correct
33 Correct 50 ms 125916 KB Output is correct
34 Correct 55 ms 125828 KB Output is correct
35 Correct 417 ms 147224 KB Output is correct
36 Correct 563 ms 144828 KB Output is correct
37 Correct 384 ms 147156 KB Output is correct
38 Correct 567 ms 144816 KB Output is correct
39 Correct 464 ms 146524 KB Output is correct
40 Correct 401 ms 147068 KB Output is correct
41 Correct 689 ms 147040 KB Output is correct
42 Correct 114 ms 134596 KB Output is correct
43 Correct 484 ms 139404 KB Output is correct
44 Correct 427 ms 144604 KB Output is correct
45 Correct 620 ms 146620 KB Output is correct
46 Correct 618 ms 147036 KB Output is correct
47 Correct 668 ms 146932 KB Output is correct
48 Correct 449 ms 146804 KB Output is correct
49 Correct 440 ms 144500 KB Output is correct
50 Correct 435 ms 146860 KB Output is correct
51 Correct 445 ms 146684 KB Output is correct
52 Correct 54 ms 125632 KB Output is correct
53 Correct 798 ms 146584 KB Output is correct
54 Correct 465 ms 144056 KB Output is correct
55 Correct 645 ms 146420 KB Output is correct
56 Correct 671 ms 146736 KB Output is correct
57 Correct 421 ms 146952 KB Output is correct
58 Incorrect 448 ms 149268 KB Output isn't correct
59 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 146972 KB Output is correct
2 Correct 460 ms 147064 KB Output is correct
3 Correct 522 ms 147300 KB Output is correct
4 Correct 349 ms 145144 KB Output is correct
5 Correct 50 ms 125516 KB Output is correct
6 Correct 423 ms 146520 KB Output is correct
7 Correct 121 ms 134732 KB Output is correct
8 Correct 321 ms 139508 KB Output is correct
9 Correct 420 ms 147256 KB Output is correct
10 Correct 392 ms 147244 KB Output is correct
11 Correct 368 ms 147316 KB Output is correct
12 Correct 52 ms 125596 KB Output is correct
13 Correct 51 ms 125576 KB Output is correct
14 Correct 54 ms 125508 KB Output is correct
15 Correct 50 ms 125560 KB Output is correct
16 Correct 50 ms 125608 KB Output is correct
17 Correct 49 ms 125516 KB Output is correct
18 Correct 58 ms 125600 KB Output is correct
19 Correct 52 ms 125564 KB Output is correct
20 Correct 52 ms 125516 KB Output is correct
21 Correct 52 ms 125616 KB Output is correct
22 Correct 49 ms 125568 KB Output is correct
23 Correct 50 ms 125532 KB Output is correct
24 Correct 50 ms 125612 KB Output is correct
25 Correct 50 ms 125572 KB Output is correct
26 Correct 49 ms 125624 KB Output is correct
27 Correct 60 ms 125596 KB Output is correct
28 Correct 58 ms 125984 KB Output is correct
29 Correct 59 ms 125840 KB Output is correct
30 Correct 57 ms 125924 KB Output is correct
31 Correct 51 ms 125932 KB Output is correct
32 Correct 51 ms 125912 KB Output is correct
33 Correct 50 ms 125916 KB Output is correct
34 Correct 55 ms 125828 KB Output is correct
35 Correct 417 ms 147224 KB Output is correct
36 Correct 563 ms 144828 KB Output is correct
37 Correct 384 ms 147156 KB Output is correct
38 Correct 567 ms 144816 KB Output is correct
39 Correct 464 ms 146524 KB Output is correct
40 Correct 401 ms 147068 KB Output is correct
41 Correct 689 ms 147040 KB Output is correct
42 Correct 114 ms 134596 KB Output is correct
43 Correct 484 ms 139404 KB Output is correct
44 Correct 427 ms 144604 KB Output is correct
45 Correct 620 ms 146620 KB Output is correct
46 Correct 618 ms 147036 KB Output is correct
47 Correct 668 ms 146932 KB Output is correct
48 Correct 449 ms 146804 KB Output is correct
49 Correct 440 ms 144500 KB Output is correct
50 Correct 435 ms 146860 KB Output is correct
51 Correct 445 ms 146684 KB Output is correct
52 Correct 54 ms 125632 KB Output is correct
53 Correct 798 ms 146584 KB Output is correct
54 Correct 465 ms 144056 KB Output is correct
55 Correct 645 ms 146420 KB Output is correct
56 Correct 671 ms 146736 KB Output is correct
57 Correct 1949 ms 228388 KB Output is correct
58 Correct 1596 ms 216228 KB Output is correct
59 Correct 2025 ms 228208 KB Output is correct
60 Correct 2222 ms 227912 KB Output is correct
61 Correct 4859 ms 229012 KB Output is correct
62 Correct 2736 ms 213384 KB Output is correct
63 Correct 3559 ms 224036 KB Output is correct
64 Correct 3900 ms 227224 KB Output is correct
65 Correct 421 ms 146952 KB Output is correct
66 Incorrect 448 ms 149268 KB Output isn't correct
67 Halted 0 ms 0 KB -