oj.uz

Submission #708223

# Submission time Handle Problem Language Result Execution time Memory
708223 2023-03-11T10:38:43 Z LittleCube Two Dishes (JOI19_dishes) C++17
74 / 100
 3814 ms 298108 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
using namespace std;

const ll inf = 1'000'000'000'000'000'000;
const ll mxN = 3'000'006;
int N, M;
ll A[mxN], B[mxN], S[mxN], T[mxN], P[mxN], Q[mxN], dp[mxN], seg[4 * mxN], lazy[4 * mxN], bit[mxN], rcost[mxN], ucost[mxN], tmp[mxN][2];
int rangeA[mxN], rangeB[mxN], nrange[mxN];
vector<int> ins[mxN];

void Bmodify(int pos, ll val)
{
    for (int i = pos; i < mxN; i += (i & -i))
        bit[i] += val;
}

ll Bquery(int pos)
{
    ll ans = 0;
    for (int i = pos; i > 0; i -= (i & -i))
        ans += bit[i];
    return ans;
}

void init(int i = 1, int L = 0, int R = N)
{
    if (L == R)
        seg[i] = -inf, lazy[i] = 0;
    if (L != R)
    {
        int mid = (L + R) / 2;
        init(i << 1, L, mid);
        init(i << 1 | 1, mid + 1, R);
    }
}

void modify(int mL, int mR, ll val, int i = 1, int L = 0, int R = N)
{
    if (mL <= L && R <= mR)
        seg[i] += val, lazy[i] += val;
    else if (R < mL || mR < L)
        return;
    else
    {
        int mid = (L + R) / 2;
        seg[i << 1] += lazy[i], seg[i << 1 | 1] += lazy[i];
        lazy[i << 1] += lazy[i], lazy[i << 1 | 1] += lazy[i];
        lazy[i] = 0;
        modify(mL, mR, val, i << 1, L, mid);
        modify(mL, mR, val, i << 1 | 1, mid + 1, R);
        seg[i] = max(seg[i << 1], seg[i << 1 | 1]);
    }
}

ll query(int mL, int mR, int i = 1, int L = 0, int R = N)
{
    if (mL <= L && R <= mR)
        return seg[i];
    else if (R < mL || mR < L)
        return -inf;
    else
    {
        int mid = (L + R) / 2;
        seg[i << 1] += lazy[i], seg[i << 1 | 1] += lazy[i];
        lazy[i << 1] += lazy[i], lazy[i << 1 | 1] += lazy[i];
        lazy[i] = 0;
        return max(query(mL, mR, i << 1, L, mid),
                   query(mL, mR, i << 1 | 1, mid + 1, R));
    }
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> N >> M;
    for (int i = 1; i <= N; i++)
    {
        cin >> A[i] >> S[i] >> P[i];
        A[i] += A[i - 1];
    }
    for (int i = 1; i <= M; i++)
    {
        cin >> B[i] >> T[i] >> Q[i];
        B[i] += B[i - 1];
    }
    for (int i = 1; i <= N; i++)
    {
        rangeA[i] = upper_bound(B, B + 1 + M, S[i] - A[i]) - B - 1;
        if (rangeA[i] == -1)
            rangeA[i] = 0, P[i] = 0;
        ins[i].emplace_back(rangeA[i]);
    }
    for (int i = 1; i <= M; i++)
    {
        rangeB[i] = upper_bound(A, A + 1 + N, T[i] - B[i]) - A - 1;
        if (rangeB[i] == -1)
            rangeB[i] = 0, Q[i] = 0;
        else if (rangeA[rangeB[i] + 1] != i - 1)
        {
            // cerr << "build insert " << i << " -> " << rangeB[i] + 1 << '\n';
            ins[rangeB[i] + 1].emplace_back(i - 1);
        }
    }
    rangeA[++N] = M;
    int nN = 0;
    for (int i = 1; i <= N; i++)
        tmp[i][0] = P[i], tmp[i][1] = rangeA[i];
    for (int i = 1; i <= N; i++)
    {
        sort(ins[i].begin(), ins[i].end(), greater<>());
        ++nN;
        for (int j : ins[i])
        {
            rangeA[nN] = j;
            P[nN] = 0;
            if (j == rangeA[i])
            {
                P[nN] = tmp[i][0];
                rangeA[nN] = tmp[i][1];
                nrange[i] = nN;
            }
        }
    }
    for (int i = 1; i <= M; i++)
        rangeB[i] = nrange[rangeB[i]];
    N = nN;
    vector<int> v;

    for (int i = 1; i <= N; i++)
        v.emplace_back(i);
    sort(v.begin(), v.end(), [&](int i, int j)
         { return make_pair(rangeA[i], i) < make_pair(rangeA[j], j); });

    ll sumR = 0;
    for (int i = N; i >= 1; i--)
    {
        rcost[i] = sumR - Bquery(rangeA[i]);
        sumR += P[i];
        Bmodify(rangeA[i] + 1, P[i]);
    }
    for (int i = 0; i < mxN; i++)
        bit[i] = 0;

    int last = 1;
    ll sumU = 0;

    init();
    modify(0, 0, inf);
    for (int i = 1; i <= N; i++)
        modify(0, i, P[i]);
    for (int i : v)
    {
        while (last <= rangeA[i] && last <= M)
        {
            sumU += Q[last];
            Bmodify(rangeB[last] + 1, Q[last]);
            modify(0, rangeB[last], Q[last]);
            last++;
        }
        ucost[i] = sumU - Bquery(i);
        dp[i] = query(0, i - 1) - rcost[i];
        // cerr << ' ' << query(0, 0) << '\n';
        // cerr << i << ' ' << query(0, i - 1) << '-' << rcost[i] << '\n';
        modify(0, i, -P[i]);
        modify(i, i, inf + dp[i] - ucost[i]);
    }
    cout << dp[N] << '\n';
}

/*
3 2
1 1 -1
1 2 2
1 5 5
1 2 1
1 0 0
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 394 ms 131564 KB Output is correct
2 Correct 415 ms 131032 KB Output is correct
3 Correct 392 ms 132340 KB Output is correct
4 Correct 415 ms 130936 KB Output is correct
5 Correct 50 ms 94284 KB Output is correct
6 Correct 406 ms 130572 KB Output is correct
7 Correct 144 ms 103264 KB Output is correct
8 Correct 283 ms 126448 KB Output is correct
9 Correct 398 ms 132080 KB Output is correct
10 Correct 367 ms 131900 KB Output is correct
11 Correct 378 ms 132596 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 94348 KB Output is correct
2 Correct 54 ms 94284 KB Output is correct
3 Correct 61 ms 94288 KB Output is correct
4 Correct 51 ms 94476 KB Output is correct
5 Correct 57 ms 94312 KB Output is correct
6 Correct 54 ms 94284 KB Output is correct
7 Correct 49 ms 94292 KB Output is correct
8 Correct 55 ms 94304 KB Output is correct
9 Correct 49 ms 94284 KB Output is correct
10 Correct 51 ms 94252 KB Output is correct
11 Correct 49 ms 94284 KB Output is correct
12 Correct 55 ms 94288 KB Output is correct
13 Correct 51 ms 94296 KB Output is correct
14 Correct 49 ms 94272 KB Output is correct
15 Correct 54 ms 94312 KB Output is correct
16 Correct 48 ms 94264 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 94348 KB Output is correct
2 Correct 54 ms 94284 KB Output is correct
3 Correct 61 ms 94288 KB Output is correct
4 Correct 51 ms 94476 KB Output is correct
5 Correct 57 ms 94312 KB Output is correct
6 Correct 54 ms 94284 KB Output is correct
7 Correct 49 ms 94292 KB Output is correct
8 Correct 55 ms 94304 KB Output is correct
9 Correct 49 ms 94284 KB Output is correct
10 Correct 51 ms 94252 KB Output is correct
11 Correct 49 ms 94284 KB Output is correct
12 Correct 55 ms 94288 KB Output is correct
13 Correct 51 ms 94296 KB Output is correct
14 Correct 49 ms 94272 KB Output is correct
15 Correct 54 ms 94312 KB Output is correct
16 Correct 48 ms 94264 KB Output is correct
17 Correct 52 ms 94684 KB Output is correct
18 Correct 57 ms 94800 KB Output is correct
19 Correct 63 ms 94700 KB Output is correct
20 Correct 57 ms 94764 KB Output is correct
21 Correct 53 ms 94796 KB Output is correct
22 Correct 52 ms 94672 KB Output is correct
23 Correct 52 ms 94632 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 94348 KB Output is correct
2 Correct 54 ms 94284 KB Output is correct
3 Correct 61 ms 94288 KB Output is correct
4 Correct 51 ms 94476 KB Output is correct
5 Correct 57 ms 94312 KB Output is correct
6 Correct 54 ms 94284 KB Output is correct
7 Correct 49 ms 94292 KB Output is correct
8 Correct 55 ms 94304 KB Output is correct
9 Correct 49 ms 94284 KB Output is correct
10 Correct 51 ms 94252 KB Output is correct
11 Correct 49 ms 94284 KB Output is correct
12 Correct 55 ms 94288 KB Output is correct
13 Correct 51 ms 94296 KB Output is correct
14 Correct 49 ms 94272 KB Output is correct
15 Correct 54 ms 94312 KB Output is correct
16 Correct 48 ms 94264 KB Output is correct
17 Correct 52 ms 94684 KB Output is correct
18 Correct 57 ms 94800 KB Output is correct
19 Correct 63 ms 94700 KB Output is correct
20 Correct 57 ms 94764 KB Output is correct
21 Correct 53 ms 94796 KB Output is correct
22 Correct 52 ms 94672 KB Output is correct
23 Correct 52 ms 94632 KB Output is correct
24 Correct 443 ms 140052 KB Output is correct
25 Correct 403 ms 140544 KB Output is correct
26 Correct 381 ms 140148 KB Output is correct
27 Correct 408 ms 139764 KB Output is correct
28 Correct 462 ms 140324 KB Output is correct
29 Correct 362 ms 141188 KB Output is correct
30 Correct 611 ms 140000 KB Output is correct
31 Correct 131 ms 105892 KB Output is correct
32 Correct 293 ms 129076 KB Output is correct
33 Correct 559 ms 139240 KB Output is correct
34 Correct 563 ms 140156 KB Output is correct
35 Correct 594 ms 133744 KB Output is correct
36 Correct 597 ms 133892 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 94348 KB Output is correct
2 Correct 54 ms 94284 KB Output is correct
3 Correct 61 ms 94288 KB Output is correct
4 Correct 51 ms 94476 KB Output is correct
5 Correct 57 ms 94312 KB Output is correct
6 Correct 54 ms 94284 KB Output is correct
7 Correct 49 ms 94292 KB Output is correct
8 Correct 55 ms 94304 KB Output is correct
9 Correct 49 ms 94284 KB Output is correct
10 Correct 51 ms 94252 KB Output is correct
11 Correct 49 ms 94284 KB Output is correct
12 Correct 55 ms 94288 KB Output is correct
13 Correct 51 ms 94296 KB Output is correct
14 Correct 49 ms 94272 KB Output is correct
15 Correct 54 ms 94312 KB Output is correct
16 Correct 48 ms 94264 KB Output is correct
17 Correct 52 ms 94684 KB Output is correct
18 Correct 57 ms 94800 KB Output is correct
19 Correct 63 ms 94700 KB Output is correct
20 Correct 57 ms 94764 KB Output is correct
21 Correct 53 ms 94796 KB Output is correct
22 Correct 52 ms 94672 KB Output is correct
23 Correct 52 ms 94632 KB Output is correct
24 Correct 443 ms 140052 KB Output is correct
25 Correct 403 ms 140544 KB Output is correct
26 Correct 381 ms 140148 KB Output is correct
27 Correct 408 ms 139764 KB Output is correct
28 Correct 462 ms 140324 KB Output is correct
29 Correct 362 ms 141188 KB Output is correct
30 Correct 611 ms 140000 KB Output is correct
31 Correct 131 ms 105892 KB Output is correct
32 Correct 293 ms 129076 KB Output is correct
33 Correct 559 ms 139240 KB Output is correct
34 Correct 563 ms 140156 KB Output is correct
35 Correct 594 ms 133744 KB Output is correct
36 Correct 597 ms 133892 KB Output is correct
37 Correct 431 ms 143284 KB Output is correct
38 Correct 439 ms 132900 KB Output is correct
39 Correct 419 ms 132920 KB Output is correct
40 Correct 412 ms 132804 KB Output is correct
41 Correct 48 ms 94284 KB Output is correct
42 Correct 609 ms 132936 KB Output is correct
43 Correct 558 ms 131756 KB Output is correct
44 Correct 569 ms 132796 KB Output is correct
45 Correct 599 ms 133028 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 94348 KB Output is correct
2 Correct 54 ms 94284 KB Output is correct
3 Correct 61 ms 94288 KB Output is correct
4 Correct 51 ms 94476 KB Output is correct
5 Correct 57 ms 94312 KB Output is correct
6 Correct 54 ms 94284 KB Output is correct
7 Correct 49 ms 94292 KB Output is correct
8 Correct 55 ms 94304 KB Output is correct
9 Correct 49 ms 94284 KB Output is correct
10 Correct 51 ms 94252 KB Output is correct
11 Correct 49 ms 94284 KB Output is correct
12 Correct 55 ms 94288 KB Output is correct
13 Correct 51 ms 94296 KB Output is correct
14 Correct 49 ms 94272 KB Output is correct
15 Correct 54 ms 94312 KB Output is correct
16 Correct 48 ms 94264 KB Output is correct
17 Correct 52 ms 94684 KB Output is correct
18 Correct 57 ms 94800 KB Output is correct
19 Correct 63 ms 94700 KB Output is correct
20 Correct 57 ms 94764 KB Output is correct
21 Correct 53 ms 94796 KB Output is correct
22 Correct 52 ms 94672 KB Output is correct
23 Correct 52 ms 94632 KB Output is correct
24 Correct 443 ms 140052 KB Output is correct
25 Correct 403 ms 140544 KB Output is correct
26 Correct 381 ms 140148 KB Output is correct
27 Correct 408 ms 139764 KB Output is correct
28 Correct 462 ms 140324 KB Output is correct
29 Correct 362 ms 141188 KB Output is correct
30 Correct 611 ms 140000 KB Output is correct
31 Correct 131 ms 105892 KB Output is correct
32 Correct 293 ms 129076 KB Output is correct
33 Correct 559 ms 139240 KB Output is correct
34 Correct 563 ms 140156 KB Output is correct
35 Correct 594 ms 133744 KB Output is correct
36 Correct 597 ms 133892 KB Output is correct
37 Correct 431 ms 143284 KB Output is correct
38 Correct 439 ms 132900 KB Output is correct
39 Correct 419 ms 132920 KB Output is correct
40 Correct 412 ms 132804 KB Output is correct
41 Correct 48 ms 94284 KB Output is correct
42 Correct 609 ms 132936 KB Output is correct
43 Correct 558 ms 131756 KB Output is correct
44 Correct 569 ms 132796 KB Output is correct
45 Correct 599 ms 133028 KB Output is correct
46 Correct 2126 ms 286308 KB Output is correct
47 Correct 2142 ms 297288 KB Output is correct
48 Correct 1952 ms 288432 KB Output is correct
49 Correct 1838 ms 288328 KB Output is correct
50 Correct 3814 ms 298108 KB Output is correct
51 Correct 2907 ms 287972 KB Output is correct
52 Correct 3108 ms 289972 KB Output is correct
53 Correct 3608 ms 275104 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 394 ms 131564 KB Output is correct
2 Correct 415 ms 131032 KB Output is correct
3 Correct 392 ms 132340 KB Output is correct
4 Correct 415 ms 130936 KB Output is correct
5 Correct 50 ms 94284 KB Output is correct
6 Correct 406 ms 130572 KB Output is correct
7 Correct 144 ms 103264 KB Output is correct
8 Correct 283 ms 126448 KB Output is correct
9 Correct 398 ms 132080 KB Output is correct
10 Correct 367 ms 131900 KB Output is correct
11 Correct 378 ms 132596 KB Output is correct
12 Correct 50 ms 94348 KB Output is correct
13 Correct 54 ms 94284 KB Output is correct
14 Correct 61 ms 94288 KB Output is correct
15 Correct 51 ms 94476 KB Output is correct
16 Correct 57 ms 94312 KB Output is correct
17 Correct 54 ms 94284 KB Output is correct
18 Correct 49 ms 94292 KB Output is correct
19 Correct 55 ms 94304 KB Output is correct
20 Correct 49 ms 94284 KB Output is correct
21 Correct 51 ms 94252 KB Output is correct
22 Correct 49 ms 94284 KB Output is correct
23 Correct 55 ms 94288 KB Output is correct
24 Correct 51 ms 94296 KB Output is correct
25 Correct 49 ms 94272 KB Output is correct
26 Correct 54 ms 94312 KB Output is correct
27 Correct 48 ms 94264 KB Output is correct
28 Correct 52 ms 94684 KB Output is correct
29 Correct 57 ms 94800 KB Output is correct
30 Correct 63 ms 94700 KB Output is correct
31 Correct 57 ms 94764 KB Output is correct
32 Correct 53 ms 94796 KB Output is correct
33 Correct 52 ms 94672 KB Output is correct
34 Correct 52 ms 94632 KB Output is correct
35 Correct 443 ms 140052 KB Output is correct
36 Correct 403 ms 140544 KB Output is correct
37 Correct 381 ms 140148 KB Output is correct
38 Correct 408 ms 139764 KB Output is correct
39 Correct 462 ms 140324 KB Output is correct
40 Correct 362 ms 141188 KB Output is correct
41 Correct 611 ms 140000 KB Output is correct
42 Correct 131 ms 105892 KB Output is correct
43 Correct 293 ms 129076 KB Output is correct
44 Correct 559 ms 139240 KB Output is correct
45 Correct 563 ms 140156 KB Output is correct
46 Correct 594 ms 133744 KB Output is correct
47 Correct 597 ms 133892 KB Output is correct
48 Correct 431 ms 143284 KB Output is correct
49 Correct 439 ms 132900 KB Output is correct
50 Correct 419 ms 132920 KB Output is correct
51 Correct 412 ms 132804 KB Output is correct
52 Correct 48 ms 94284 KB Output is correct
53 Correct 609 ms 132936 KB Output is correct
54 Correct 558 ms 131756 KB Output is correct
55 Correct 569 ms 132796 KB Output is correct
56 Correct 599 ms 133028 KB Output is correct
57 Correct 439 ms 141352 KB Output is correct
58 Correct 437 ms 143376 KB Output is correct
59 Correct 425 ms 141360 KB Output is correct
60 Correct 422 ms 141220 KB Output is correct
61 Correct 645 ms 140208 KB Output is correct
62 Correct 63 ms 94284 KB Output is correct
63 Incorrect 641 ms 143320 KB Output isn't correct
64 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 394 ms 131564 KB Output is correct
2 Correct 415 ms 131032 KB Output is correct
3 Correct 392 ms 132340 KB Output is correct
4 Correct 415 ms 130936 KB Output is correct
5 Correct 50 ms 94284 KB Output is correct
6 Correct 406 ms 130572 KB Output is correct
7 Correct 144 ms 103264 KB Output is correct
8 Correct 283 ms 126448 KB Output is correct
9 Correct 398 ms 132080 KB Output is correct
10 Correct 367 ms 131900 KB Output is correct
11 Correct 378 ms 132596 KB Output is correct
12 Correct 50 ms 94348 KB Output is correct
13 Correct 54 ms 94284 KB Output is correct
14 Correct 61 ms 94288 KB Output is correct
15 Correct 51 ms 94476 KB Output is correct
16 Correct 57 ms 94312 KB Output is correct
17 Correct 54 ms 94284 KB Output is correct
18 Correct 49 ms 94292 KB Output is correct
19 Correct 55 ms 94304 KB Output is correct
20 Correct 49 ms 94284 KB Output is correct
21 Correct 51 ms 94252 KB Output is correct
22 Correct 49 ms 94284 KB Output is correct
23 Correct 55 ms 94288 KB Output is correct
24 Correct 51 ms 94296 KB Output is correct
25 Correct 49 ms 94272 KB Output is correct
26 Correct 54 ms 94312 KB Output is correct
27 Correct 48 ms 94264 KB Output is correct
28 Correct 52 ms 94684 KB Output is correct
29 Correct 57 ms 94800 KB Output is correct
30 Correct 63 ms 94700 KB Output is correct
31 Correct 57 ms 94764 KB Output is correct
32 Correct 53 ms 94796 KB Output is correct
33 Correct 52 ms 94672 KB Output is correct
34 Correct 52 ms 94632 KB Output is correct
35 Correct 443 ms 140052 KB Output is correct
36 Correct 403 ms 140544 KB Output is correct
37 Correct 381 ms 140148 KB Output is correct
38 Correct 408 ms 139764 KB Output is correct
39 Correct 462 ms 140324 KB Output is correct
40 Correct 362 ms 141188 KB Output is correct
41 Correct 611 ms 140000 KB Output is correct
42 Correct 131 ms 105892 KB Output is correct
43 Correct 293 ms 129076 KB Output is correct
44 Correct 559 ms 139240 KB Output is correct
45 Correct 563 ms 140156 KB Output is correct
46 Correct 594 ms 133744 KB Output is correct
47 Correct 597 ms 133892 KB Output is correct
48 Correct 431 ms 143284 KB Output is correct
49 Correct 439 ms 132900 KB Output is correct
50 Correct 419 ms 132920 KB Output is correct
51 Correct 412 ms 132804 KB Output is correct
52 Correct 48 ms 94284 KB Output is correct
53 Correct 609 ms 132936 KB Output is correct
54 Correct 558 ms 131756 KB Output is correct
55 Correct 569 ms 132796 KB Output is correct
56 Correct 599 ms 133028 KB Output is correct
57 Correct 2126 ms 286308 KB Output is correct
58 Correct 2142 ms 297288 KB Output is correct
59 Correct 1952 ms 288432 KB Output is correct
60 Correct 1838 ms 288328 KB Output is correct
61 Correct 3814 ms 298108 KB Output is correct
62 Correct 2907 ms 287972 KB Output is correct
63 Correct 3108 ms 289972 KB Output is correct
64 Correct 3608 ms 275104 KB Output is correct
65 Correct 439 ms 141352 KB Output is correct
66 Correct 437 ms 143376 KB Output is correct
67 Correct 425 ms 141360 KB Output is correct
68 Correct 422 ms 141220 KB Output is correct
69 Correct 645 ms 140208 KB Output is correct
70 Correct 63 ms 94284 KB Output is correct
71 Incorrect 641 ms 143320 KB Output isn't correct
72 Halted 0 ms 0 KB -