oj.uz

Submission #708184

# Submission time Handle Problem Language Result Execution time Memory
708184 2023-03-11T09:08:34 Z LittleCube Two Dishes (JOI19_dishes) C++14
74 / 100
 4345 ms 287612 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 = 2'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;
    }
    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]] > i)
            ins[rangeB[i]].emplace_back(i);
    }
    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<>());
        nrange[i] = ++nN;
        P[nN] = tmp[i][0];
        rangeA[nN] = tmp[i][1];
        for(int j : ins[i])
        {
            ++nN;
            rangeA[nN] = j;
            P[nN] = 0;
        }
    }
    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])
        {
            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';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 95816 KB Output is correct
2 Correct 440 ms 104460 KB Output is correct
3 Correct 504 ms 108868 KB Output is correct
4 Correct 354 ms 91884 KB Output is correct
5 Correct 33 ms 63040 KB Output is correct
6 Correct 443 ms 104380 KB Output is correct
7 Correct 281 ms 84860 KB Output is correct
8 Correct 249 ms 86400 KB Output is correct
9 Correct 497 ms 108744 KB Output is correct
10 Correct 327 ms 91976 KB Output is correct
11 Correct 454 ms 108656 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 63060 KB Output is correct
2 Correct 37 ms 63032 KB Output is correct
3 Correct 34 ms 63016 KB Output is correct
4 Correct 35 ms 62928 KB Output is correct
5 Correct 37 ms 63012 KB Output is correct
6 Correct 33 ms 63060 KB Output is correct
7 Correct 33 ms 62964 KB Output is correct
8 Correct 37 ms 63008 KB Output is correct
9 Correct 35 ms 62976 KB Output is correct
10 Correct 35 ms 63048 KB Output is correct
11 Correct 34 ms 62924 KB Output is correct
12 Correct 34 ms 63016 KB Output is correct
13 Correct 37 ms 63048 KB Output is correct
14 Correct 36 ms 62984 KB Output is correct
15 Correct 33 ms 63012 KB Output is correct
16 Correct 34 ms 63060 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 63060 KB Output is correct
2 Correct 37 ms 63032 KB Output is correct
3 Correct 34 ms 63016 KB Output is correct
4 Correct 35 ms 62928 KB Output is correct
5 Correct 37 ms 63012 KB Output is correct
6 Correct 33 ms 63060 KB Output is correct
7 Correct 33 ms 62964 KB Output is correct
8 Correct 37 ms 63008 KB Output is correct
9 Correct 35 ms 62976 KB Output is correct
10 Correct 35 ms 63048 KB Output is correct
11 Correct 34 ms 62924 KB Output is correct
12 Correct 34 ms 63016 KB Output is correct
13 Correct 37 ms 63048 KB Output is correct
14 Correct 36 ms 62984 KB Output is correct
15 Correct 33 ms 63012 KB Output is correct
16 Correct 34 ms 63060 KB Output is correct
17 Correct 36 ms 63380 KB Output is correct
18 Correct 38 ms 63312 KB Output is correct
19 Correct 38 ms 63448 KB Output is correct
20 Correct 37 ms 63452 KB Output is correct
21 Correct 37 ms 63488 KB Output is correct
22 Correct 37 ms 63436 KB Output is correct
23 Correct 37 ms 63436 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 63060 KB Output is correct
2 Correct 37 ms 63032 KB Output is correct
3 Correct 34 ms 63016 KB Output is correct
4 Correct 35 ms 62928 KB Output is correct
5 Correct 37 ms 63012 KB Output is correct
6 Correct 33 ms 63060 KB Output is correct
7 Correct 33 ms 62964 KB Output is correct
8 Correct 37 ms 63008 KB Output is correct
9 Correct 35 ms 62976 KB Output is correct
10 Correct 35 ms 63048 KB Output is correct
11 Correct 34 ms 62924 KB Output is correct
12 Correct 34 ms 63016 KB Output is correct
13 Correct 37 ms 63048 KB Output is correct
14 Correct 36 ms 62984 KB Output is correct
15 Correct 33 ms 63012 KB Output is correct
16 Correct 34 ms 63060 KB Output is correct
17 Correct 36 ms 63380 KB Output is correct
18 Correct 38 ms 63312 KB Output is correct
19 Correct 38 ms 63448 KB Output is correct
20 Correct 37 ms 63452 KB Output is correct
21 Correct 37 ms 63488 KB Output is correct
22 Correct 37 ms 63436 KB Output is correct
23 Correct 37 ms 63436 KB Output is correct
24 Correct 341 ms 102196 KB Output is correct
25 Correct 368 ms 102188 KB Output is correct
26 Correct 466 ms 114888 KB Output is correct
27 Correct 456 ms 117660 KB Output is correct
28 Correct 554 ms 117524 KB Output is correct
29 Correct 500 ms 119748 KB Output is correct
30 Correct 691 ms 116708 KB Output is correct
31 Correct 143 ms 74960 KB Output is correct
32 Correct 253 ms 91456 KB Output is correct
33 Correct 480 ms 103400 KB Output is correct
34 Correct 715 ms 119016 KB Output is correct
35 Correct 644 ms 110380 KB Output is correct
36 Correct 646 ms 110560 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 63060 KB Output is correct
2 Correct 37 ms 63032 KB Output is correct
3 Correct 34 ms 63016 KB Output is correct
4 Correct 35 ms 62928 KB Output is correct
5 Correct 37 ms 63012 KB Output is correct
6 Correct 33 ms 63060 KB Output is correct
7 Correct 33 ms 62964 KB Output is correct
8 Correct 37 ms 63008 KB Output is correct
9 Correct 35 ms 62976 KB Output is correct
10 Correct 35 ms 63048 KB Output is correct
11 Correct 34 ms 62924 KB Output is correct
12 Correct 34 ms 63016 KB Output is correct
13 Correct 37 ms 63048 KB Output is correct
14 Correct 36 ms 62984 KB Output is correct
15 Correct 33 ms 63012 KB Output is correct
16 Correct 34 ms 63060 KB Output is correct
17 Correct 36 ms 63380 KB Output is correct
18 Correct 38 ms 63312 KB Output is correct
19 Correct 38 ms 63448 KB Output is correct
20 Correct 37 ms 63452 KB Output is correct
21 Correct 37 ms 63488 KB Output is correct
22 Correct 37 ms 63436 KB Output is correct
23 Correct 37 ms 63436 KB Output is correct
24 Correct 341 ms 102196 KB Output is correct
25 Correct 368 ms 102188 KB Output is correct
26 Correct 466 ms 114888 KB Output is correct
27 Correct 456 ms 117660 KB Output is correct
28 Correct 554 ms 117524 KB Output is correct
29 Correct 500 ms 119748 KB Output is correct
30 Correct 691 ms 116708 KB Output is correct
31 Correct 143 ms 74960 KB Output is correct
32 Correct 253 ms 91456 KB Output is correct
33 Correct 480 ms 103400 KB Output is correct
34 Correct 715 ms 119016 KB Output is correct
35 Correct 644 ms 110380 KB Output is correct
36 Correct 646 ms 110560 KB Output is correct
37 Correct 391 ms 105456 KB Output is correct
38 Correct 485 ms 120572 KB Output is correct
39 Correct 372 ms 102784 KB Output is correct
40 Correct 384 ms 102756 KB Output is correct
41 Correct 34 ms 62924 KB Output is correct
42 Correct 742 ms 119764 KB Output is correct
43 Correct 521 ms 106240 KB Output is correct
44 Correct 747 ms 121340 KB Output is correct
45 Correct 673 ms 113392 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 63060 KB Output is correct
2 Correct 37 ms 63032 KB Output is correct
3 Correct 34 ms 63016 KB Output is correct
4 Correct 35 ms 62928 KB Output is correct
5 Correct 37 ms 63012 KB Output is correct
6 Correct 33 ms 63060 KB Output is correct
7 Correct 33 ms 62964 KB Output is correct
8 Correct 37 ms 63008 KB Output is correct
9 Correct 35 ms 62976 KB Output is correct
10 Correct 35 ms 63048 KB Output is correct
11 Correct 34 ms 62924 KB Output is correct
12 Correct 34 ms 63016 KB Output is correct
13 Correct 37 ms 63048 KB Output is correct
14 Correct 36 ms 62984 KB Output is correct
15 Correct 33 ms 63012 KB Output is correct
16 Correct 34 ms 63060 KB Output is correct
17 Correct 36 ms 63380 KB Output is correct
18 Correct 38 ms 63312 KB Output is correct
19 Correct 38 ms 63448 KB Output is correct
20 Correct 37 ms 63452 KB Output is correct
21 Correct 37 ms 63488 KB Output is correct
22 Correct 37 ms 63436 KB Output is correct
23 Correct 37 ms 63436 KB Output is correct
24 Correct 341 ms 102196 KB Output is correct
25 Correct 368 ms 102188 KB Output is correct
26 Correct 466 ms 114888 KB Output is correct
27 Correct 456 ms 117660 KB Output is correct
28 Correct 554 ms 117524 KB Output is correct
29 Correct 500 ms 119748 KB Output is correct
30 Correct 691 ms 116708 KB Output is correct
31 Correct 143 ms 74960 KB Output is correct
32 Correct 253 ms 91456 KB Output is correct
33 Correct 480 ms 103400 KB Output is correct
34 Correct 715 ms 119016 KB Output is correct
35 Correct 644 ms 110380 KB Output is correct
36 Correct 646 ms 110560 KB Output is correct
37 Correct 391 ms 105456 KB Output is correct
38 Correct 485 ms 120572 KB Output is correct
39 Correct 372 ms 102784 KB Output is correct
40 Correct 384 ms 102756 KB Output is correct
41 Correct 34 ms 62924 KB Output is correct
42 Correct 742 ms 119764 KB Output is correct
43 Correct 521 ms 106240 KB Output is correct
44 Correct 747 ms 121340 KB Output is correct
45 Correct 673 ms 113392 KB Output is correct
46 Correct 1924 ms 213088 KB Output is correct
47 Correct 2426 ms 287612 KB Output is correct
48 Correct 1762 ms 215060 KB Output is correct
49 Correct 1763 ms 214824 KB Output is correct
50 Correct 4345 ms 283124 KB Output is correct
51 Correct 2750 ms 248796 KB Output is correct
52 Correct 3959 ms 286292 KB Output is correct
53 Correct 4177 ms 268596 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 95816 KB Output is correct
2 Correct 440 ms 104460 KB Output is correct
3 Correct 504 ms 108868 KB Output is correct
4 Correct 354 ms 91884 KB Output is correct
5 Correct 33 ms 63040 KB Output is correct
6 Correct 443 ms 104380 KB Output is correct
7 Correct 281 ms 84860 KB Output is correct
8 Correct 249 ms 86400 KB Output is correct
9 Correct 497 ms 108744 KB Output is correct
10 Correct 327 ms 91976 KB Output is correct
11 Correct 454 ms 108656 KB Output is correct
12 Correct 34 ms 63060 KB Output is correct
13 Correct 37 ms 63032 KB Output is correct
14 Correct 34 ms 63016 KB Output is correct
15 Correct 35 ms 62928 KB Output is correct
16 Correct 37 ms 63012 KB Output is correct
17 Correct 33 ms 63060 KB Output is correct
18 Correct 33 ms 62964 KB Output is correct
19 Correct 37 ms 63008 KB Output is correct
20 Correct 35 ms 62976 KB Output is correct
21 Correct 35 ms 63048 KB Output is correct
22 Correct 34 ms 62924 KB Output is correct
23 Correct 34 ms 63016 KB Output is correct
24 Correct 37 ms 63048 KB Output is correct
25 Correct 36 ms 62984 KB Output is correct
26 Correct 33 ms 63012 KB Output is correct
27 Correct 34 ms 63060 KB Output is correct
28 Correct 36 ms 63380 KB Output is correct
29 Correct 38 ms 63312 KB Output is correct
30 Correct 38 ms 63448 KB Output is correct
31 Correct 37 ms 63452 KB Output is correct
32 Correct 37 ms 63488 KB Output is correct
33 Correct 37 ms 63436 KB Output is correct
34 Correct 37 ms 63436 KB Output is correct
35 Correct 341 ms 102196 KB Output is correct
36 Correct 368 ms 102188 KB Output is correct
37 Correct 466 ms 114888 KB Output is correct
38 Correct 456 ms 117660 KB Output is correct
39 Correct 554 ms 117524 KB Output is correct
40 Correct 500 ms 119748 KB Output is correct
41 Correct 691 ms 116708 KB Output is correct
42 Correct 143 ms 74960 KB Output is correct
43 Correct 253 ms 91456 KB Output is correct
44 Correct 480 ms 103400 KB Output is correct
45 Correct 715 ms 119016 KB Output is correct
46 Correct 644 ms 110380 KB Output is correct
47 Correct 646 ms 110560 KB Output is correct
48 Correct 391 ms 105456 KB Output is correct
49 Correct 485 ms 120572 KB Output is correct
50 Correct 372 ms 102784 KB Output is correct
51 Correct 384 ms 102756 KB Output is correct
52 Correct 34 ms 62924 KB Output is correct
53 Correct 742 ms 119764 KB Output is correct
54 Correct 521 ms 106240 KB Output is correct
55 Correct 747 ms 121340 KB Output is correct
56 Correct 673 ms 113392 KB Output is correct
57 Incorrect 502 ms 118348 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 95816 KB Output is correct
2 Correct 440 ms 104460 KB Output is correct
3 Correct 504 ms 108868 KB Output is correct
4 Correct 354 ms 91884 KB Output is correct
5 Correct 33 ms 63040 KB Output is correct
6 Correct 443 ms 104380 KB Output is correct
7 Correct 281 ms 84860 KB Output is correct
8 Correct 249 ms 86400 KB Output is correct
9 Correct 497 ms 108744 KB Output is correct
10 Correct 327 ms 91976 KB Output is correct
11 Correct 454 ms 108656 KB Output is correct
12 Correct 34 ms 63060 KB Output is correct
13 Correct 37 ms 63032 KB Output is correct
14 Correct 34 ms 63016 KB Output is correct
15 Correct 35 ms 62928 KB Output is correct
16 Correct 37 ms 63012 KB Output is correct
17 Correct 33 ms 63060 KB Output is correct
18 Correct 33 ms 62964 KB Output is correct
19 Correct 37 ms 63008 KB Output is correct
20 Correct 35 ms 62976 KB Output is correct
21 Correct 35 ms 63048 KB Output is correct
22 Correct 34 ms 62924 KB Output is correct
23 Correct 34 ms 63016 KB Output is correct
24 Correct 37 ms 63048 KB Output is correct
25 Correct 36 ms 62984 KB Output is correct
26 Correct 33 ms 63012 KB Output is correct
27 Correct 34 ms 63060 KB Output is correct
28 Correct 36 ms 63380 KB Output is correct
29 Correct 38 ms 63312 KB Output is correct
30 Correct 38 ms 63448 KB Output is correct
31 Correct 37 ms 63452 KB Output is correct
32 Correct 37 ms 63488 KB Output is correct
33 Correct 37 ms 63436 KB Output is correct
34 Correct 37 ms 63436 KB Output is correct
35 Correct 341 ms 102196 KB Output is correct
36 Correct 368 ms 102188 KB Output is correct
37 Correct 466 ms 114888 KB Output is correct
38 Correct 456 ms 117660 KB Output is correct
39 Correct 554 ms 117524 KB Output is correct
40 Correct 500 ms 119748 KB Output is correct
41 Correct 691 ms 116708 KB Output is correct
42 Correct 143 ms 74960 KB Output is correct
43 Correct 253 ms 91456 KB Output is correct
44 Correct 480 ms 103400 KB Output is correct
45 Correct 715 ms 119016 KB Output is correct
46 Correct 644 ms 110380 KB Output is correct
47 Correct 646 ms 110560 KB Output is correct
48 Correct 391 ms 105456 KB Output is correct
49 Correct 485 ms 120572 KB Output is correct
50 Correct 372 ms 102784 KB Output is correct
51 Correct 384 ms 102756 KB Output is correct
52 Correct 34 ms 62924 KB Output is correct
53 Correct 742 ms 119764 KB Output is correct
54 Correct 521 ms 106240 KB Output is correct
55 Correct 747 ms 121340 KB Output is correct
56 Correct 673 ms 113392 KB Output is correct
57 Correct 1924 ms 213088 KB Output is correct
58 Correct 2426 ms 287612 KB Output is correct
59 Correct 1762 ms 215060 KB Output is correct
60 Correct 1763 ms 214824 KB Output is correct
61 Correct 4345 ms 283124 KB Output is correct
62 Correct 2750 ms 248796 KB Output is correct
63 Correct 3959 ms 286292 KB Output is correct
64 Correct 4177 ms 268596 KB Output is correct
65 Incorrect 502 ms 118348 KB Output isn't correct
66 Halted 0 ms 0 KB -