oj.uz

Submission #708189

# Submission time Handle Problem Language Result Execution time Memory
708189 2023-03-11T09:28:22 Z LittleCube Two Dishes (JOI19_dishes) C++14
74 / 100
 5681 ms 404540 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;
    }
    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)
        {
            // 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;
        P[nN] = 0;
        rangeA[nN] = tmp[i][1] + 1;
        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] && 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';
}

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 558 ms 139540 KB Output is correct
2 Correct 537 ms 139008 KB Output is correct
3 Correct 556 ms 139584 KB Output is correct
4 Correct 533 ms 138748 KB Output is correct
5 Correct 51 ms 94284 KB Output is correct
6 Correct 523 ms 138380 KB Output is correct
7 Correct 144 ms 100168 KB Output is correct
8 Correct 458 ms 133880 KB Output is correct
9 Correct 585 ms 139304 KB Output is correct
10 Correct 527 ms 139308 KB Output is correct
11 Correct 488 ms 139308 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 94356 KB Output is correct
2 Correct 47 ms 94360 KB Output is correct
3 Correct 48 ms 94260 KB Output is correct
4 Correct 50 ms 94284 KB Output is correct
5 Correct 47 ms 94284 KB Output is correct
6 Correct 51 ms 94348 KB Output is correct
7 Correct 58 ms 94292 KB Output is correct
8 Correct 50 ms 94252 KB Output is correct
9 Correct 48 ms 94284 KB Output is correct
10 Correct 48 ms 94312 KB Output is correct
11 Correct 47 ms 94320 KB Output is correct
12 Correct 49 ms 94352 KB Output is correct
13 Correct 51 ms 94332 KB Output is correct
14 Correct 51 ms 94352 KB Output is correct
15 Correct 47 ms 94328 KB Output is correct
16 Correct 49 ms 94284 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 94356 KB Output is correct
2 Correct 47 ms 94360 KB Output is correct
3 Correct 48 ms 94260 KB Output is correct
4 Correct 50 ms 94284 KB Output is correct
5 Correct 47 ms 94284 KB Output is correct
6 Correct 51 ms 94348 KB Output is correct
7 Correct 58 ms 94292 KB Output is correct
8 Correct 50 ms 94252 KB Output is correct
9 Correct 48 ms 94284 KB Output is correct
10 Correct 48 ms 94312 KB Output is correct
11 Correct 47 ms 94320 KB Output is correct
12 Correct 49 ms 94352 KB Output is correct
13 Correct 51 ms 94332 KB Output is correct
14 Correct 51 ms 94352 KB Output is correct
15 Correct 47 ms 94328 KB Output is correct
16 Correct 49 ms 94284 KB Output is correct
17 Correct 50 ms 94804 KB Output is correct
18 Correct 54 ms 95052 KB Output is correct
19 Correct 57 ms 95092 KB Output is correct
20 Correct 54 ms 94948 KB Output is correct
21 Correct 54 ms 95052 KB Output is correct
22 Correct 51 ms 94964 KB Output is correct
23 Correct 52 ms 94960 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 94356 KB Output is correct
2 Correct 47 ms 94360 KB Output is correct
3 Correct 48 ms 94260 KB Output is correct
4 Correct 50 ms 94284 KB Output is correct
5 Correct 47 ms 94284 KB Output is correct
6 Correct 51 ms 94348 KB Output is correct
7 Correct 58 ms 94292 KB Output is correct
8 Correct 50 ms 94252 KB Output is correct
9 Correct 48 ms 94284 KB Output is correct
10 Correct 48 ms 94312 KB Output is correct
11 Correct 47 ms 94320 KB Output is correct
12 Correct 49 ms 94352 KB Output is correct
13 Correct 51 ms 94332 KB Output is correct
14 Correct 51 ms 94352 KB Output is correct
15 Correct 47 ms 94328 KB Output is correct
16 Correct 49 ms 94284 KB Output is correct
17 Correct 50 ms 94804 KB Output is correct
18 Correct 54 ms 95052 KB Output is correct
19 Correct 57 ms 95092 KB Output is correct
20 Correct 54 ms 94948 KB Output is correct
21 Correct 54 ms 95052 KB Output is correct
22 Correct 51 ms 94964 KB Output is correct
23 Correct 52 ms 94960 KB Output is correct
24 Correct 567 ms 141472 KB Output is correct
25 Correct 576 ms 141584 KB Output is correct
26 Correct 529 ms 141456 KB Output is correct
27 Correct 654 ms 148640 KB Output is correct
28 Correct 688 ms 143944 KB Output is correct
29 Correct 521 ms 141520 KB Output is correct
30 Correct 936 ms 147548 KB Output is correct
31 Correct 155 ms 102928 KB Output is correct
32 Correct 481 ms 135428 KB Output is correct
33 Correct 713 ms 142364 KB Output is correct
34 Correct 920 ms 163928 KB Output is correct
35 Correct 901 ms 145660 KB Output is correct
36 Correct 873 ms 145516 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 94356 KB Output is correct
2 Correct 47 ms 94360 KB Output is correct
3 Correct 48 ms 94260 KB Output is correct
4 Correct 50 ms 94284 KB Output is correct
5 Correct 47 ms 94284 KB Output is correct
6 Correct 51 ms 94348 KB Output is correct
7 Correct 58 ms 94292 KB Output is correct
8 Correct 50 ms 94252 KB Output is correct
9 Correct 48 ms 94284 KB Output is correct
10 Correct 48 ms 94312 KB Output is correct
11 Correct 47 ms 94320 KB Output is correct
12 Correct 49 ms 94352 KB Output is correct
13 Correct 51 ms 94332 KB Output is correct
14 Correct 51 ms 94352 KB Output is correct
15 Correct 47 ms 94328 KB Output is correct
16 Correct 49 ms 94284 KB Output is correct
17 Correct 50 ms 94804 KB Output is correct
18 Correct 54 ms 95052 KB Output is correct
19 Correct 57 ms 95092 KB Output is correct
20 Correct 54 ms 94948 KB Output is correct
21 Correct 54 ms 95052 KB Output is correct
22 Correct 51 ms 94964 KB Output is correct
23 Correct 52 ms 94960 KB Output is correct
24 Correct 567 ms 141472 KB Output is correct
25 Correct 576 ms 141584 KB Output is correct
26 Correct 529 ms 141456 KB Output is correct
27 Correct 654 ms 148640 KB Output is correct
28 Correct 688 ms 143944 KB Output is correct
29 Correct 521 ms 141520 KB Output is correct
30 Correct 936 ms 147548 KB Output is correct
31 Correct 155 ms 102928 KB Output is correct
32 Correct 481 ms 135428 KB Output is correct
33 Correct 713 ms 142364 KB Output is correct
34 Correct 920 ms 163928 KB Output is correct
35 Correct 901 ms 145660 KB Output is correct
36 Correct 873 ms 145516 KB Output is correct
37 Correct 584 ms 139808 KB Output is correct
38 Correct 706 ms 157936 KB Output is correct
39 Correct 562 ms 148360 KB Output is correct
40 Correct 555 ms 148484 KB Output is correct
41 Correct 48 ms 94232 KB Output is correct
42 Correct 983 ms 156916 KB Output is correct
43 Correct 731 ms 151888 KB Output is correct
44 Correct 944 ms 174400 KB Output is correct
45 Correct 893 ms 151028 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 94356 KB Output is correct
2 Correct 47 ms 94360 KB Output is correct
3 Correct 48 ms 94260 KB Output is correct
4 Correct 50 ms 94284 KB Output is correct
5 Correct 47 ms 94284 KB Output is correct
6 Correct 51 ms 94348 KB Output is correct
7 Correct 58 ms 94292 KB Output is correct
8 Correct 50 ms 94252 KB Output is correct
9 Correct 48 ms 94284 KB Output is correct
10 Correct 48 ms 94312 KB Output is correct
11 Correct 47 ms 94320 KB Output is correct
12 Correct 49 ms 94352 KB Output is correct
13 Correct 51 ms 94332 KB Output is correct
14 Correct 51 ms 94352 KB Output is correct
15 Correct 47 ms 94328 KB Output is correct
16 Correct 49 ms 94284 KB Output is correct
17 Correct 50 ms 94804 KB Output is correct
18 Correct 54 ms 95052 KB Output is correct
19 Correct 57 ms 95092 KB Output is correct
20 Correct 54 ms 94948 KB Output is correct
21 Correct 54 ms 95052 KB Output is correct
22 Correct 51 ms 94964 KB Output is correct
23 Correct 52 ms 94960 KB Output is correct
24 Correct 567 ms 141472 KB Output is correct
25 Correct 576 ms 141584 KB Output is correct
26 Correct 529 ms 141456 KB Output is correct
27 Correct 654 ms 148640 KB Output is correct
28 Correct 688 ms 143944 KB Output is correct
29 Correct 521 ms 141520 KB Output is correct
30 Correct 936 ms 147548 KB Output is correct
31 Correct 155 ms 102928 KB Output is correct
32 Correct 481 ms 135428 KB Output is correct
33 Correct 713 ms 142364 KB Output is correct
34 Correct 920 ms 163928 KB Output is correct
35 Correct 901 ms 145660 KB Output is correct
36 Correct 873 ms 145516 KB Output is correct
37 Correct 584 ms 139808 KB Output is correct
38 Correct 706 ms 157936 KB Output is correct
39 Correct 562 ms 148360 KB Output is correct
40 Correct 555 ms 148484 KB Output is correct
41 Correct 48 ms 94232 KB Output is correct
42 Correct 983 ms 156916 KB Output is correct
43 Correct 731 ms 151888 KB Output is correct
44 Correct 944 ms 174400 KB Output is correct
45 Correct 893 ms 151028 KB Output is correct
46 Correct 2967 ms 311068 KB Output is correct
47 Correct 3476 ms 404540 KB Output is correct
48 Correct 2863 ms 303320 KB Output is correct
49 Correct 2851 ms 303116 KB Output is correct
50 Correct 5681 ms 399832 KB Output is correct
51 Correct 3856 ms 304304 KB Output is correct
52 Correct 5137 ms 404540 KB Output is correct
53 Correct 5373 ms 400612 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 558 ms 139540 KB Output is correct
2 Correct 537 ms 139008 KB Output is correct
3 Correct 556 ms 139584 KB Output is correct
4 Correct 533 ms 138748 KB Output is correct
5 Correct 51 ms 94284 KB Output is correct
6 Correct 523 ms 138380 KB Output is correct
7 Correct 144 ms 100168 KB Output is correct
8 Correct 458 ms 133880 KB Output is correct
9 Correct 585 ms 139304 KB Output is correct
10 Correct 527 ms 139308 KB Output is correct
11 Correct 488 ms 139308 KB Output is correct
12 Correct 48 ms 94356 KB Output is correct
13 Correct 47 ms 94360 KB Output is correct
14 Correct 48 ms 94260 KB Output is correct
15 Correct 50 ms 94284 KB Output is correct
16 Correct 47 ms 94284 KB Output is correct
17 Correct 51 ms 94348 KB Output is correct
18 Correct 58 ms 94292 KB Output is correct
19 Correct 50 ms 94252 KB Output is correct
20 Correct 48 ms 94284 KB Output is correct
21 Correct 48 ms 94312 KB Output is correct
22 Correct 47 ms 94320 KB Output is correct
23 Correct 49 ms 94352 KB Output is correct
24 Correct 51 ms 94332 KB Output is correct
25 Correct 51 ms 94352 KB Output is correct
26 Correct 47 ms 94328 KB Output is correct
27 Correct 49 ms 94284 KB Output is correct
28 Correct 50 ms 94804 KB Output is correct
29 Correct 54 ms 95052 KB Output is correct
30 Correct 57 ms 95092 KB Output is correct
31 Correct 54 ms 94948 KB Output is correct
32 Correct 54 ms 95052 KB Output is correct
33 Correct 51 ms 94964 KB Output is correct
34 Correct 52 ms 94960 KB Output is correct
35 Correct 567 ms 141472 KB Output is correct
36 Correct 576 ms 141584 KB Output is correct
37 Correct 529 ms 141456 KB Output is correct
38 Correct 654 ms 148640 KB Output is correct
39 Correct 688 ms 143944 KB Output is correct
40 Correct 521 ms 141520 KB Output is correct
41 Correct 936 ms 147548 KB Output is correct
42 Correct 155 ms 102928 KB Output is correct
43 Correct 481 ms 135428 KB Output is correct
44 Correct 713 ms 142364 KB Output is correct
45 Correct 920 ms 163928 KB Output is correct
46 Correct 901 ms 145660 KB Output is correct
47 Correct 873 ms 145516 KB Output is correct
48 Correct 584 ms 139808 KB Output is correct
49 Correct 706 ms 157936 KB Output is correct
50 Correct 562 ms 148360 KB Output is correct
51 Correct 555 ms 148484 KB Output is correct
52 Correct 48 ms 94232 KB Output is correct
53 Correct 983 ms 156916 KB Output is correct
54 Correct 731 ms 151888 KB Output is correct
55 Correct 944 ms 174400 KB Output is correct
56 Correct 893 ms 151028 KB Output is correct
57 Correct 563 ms 143580 KB Output is correct
58 Correct 683 ms 148140 KB Output is correct
59 Incorrect 583 ms 141052 KB Output isn't correct
60 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 558 ms 139540 KB Output is correct
2 Correct 537 ms 139008 KB Output is correct
3 Correct 556 ms 139584 KB Output is correct
4 Correct 533 ms 138748 KB Output is correct
5 Correct 51 ms 94284 KB Output is correct
6 Correct 523 ms 138380 KB Output is correct
7 Correct 144 ms 100168 KB Output is correct
8 Correct 458 ms 133880 KB Output is correct
9 Correct 585 ms 139304 KB Output is correct
10 Correct 527 ms 139308 KB Output is correct
11 Correct 488 ms 139308 KB Output is correct
12 Correct 48 ms 94356 KB Output is correct
13 Correct 47 ms 94360 KB Output is correct
14 Correct 48 ms 94260 KB Output is correct
15 Correct 50 ms 94284 KB Output is correct
16 Correct 47 ms 94284 KB Output is correct
17 Correct 51 ms 94348 KB Output is correct
18 Correct 58 ms 94292 KB Output is correct
19 Correct 50 ms 94252 KB Output is correct
20 Correct 48 ms 94284 KB Output is correct
21 Correct 48 ms 94312 KB Output is correct
22 Correct 47 ms 94320 KB Output is correct
23 Correct 49 ms 94352 KB Output is correct
24 Correct 51 ms 94332 KB Output is correct
25 Correct 51 ms 94352 KB Output is correct
26 Correct 47 ms 94328 KB Output is correct
27 Correct 49 ms 94284 KB Output is correct
28 Correct 50 ms 94804 KB Output is correct
29 Correct 54 ms 95052 KB Output is correct
30 Correct 57 ms 95092 KB Output is correct
31 Correct 54 ms 94948 KB Output is correct
32 Correct 54 ms 95052 KB Output is correct
33 Correct 51 ms 94964 KB Output is correct
34 Correct 52 ms 94960 KB Output is correct
35 Correct 567 ms 141472 KB Output is correct
36 Correct 576 ms 141584 KB Output is correct
37 Correct 529 ms 141456 KB Output is correct
38 Correct 654 ms 148640 KB Output is correct
39 Correct 688 ms 143944 KB Output is correct
40 Correct 521 ms 141520 KB Output is correct
41 Correct 936 ms 147548 KB Output is correct
42 Correct 155 ms 102928 KB Output is correct
43 Correct 481 ms 135428 KB Output is correct
44 Correct 713 ms 142364 KB Output is correct
45 Correct 920 ms 163928 KB Output is correct
46 Correct 901 ms 145660 KB Output is correct
47 Correct 873 ms 145516 KB Output is correct
48 Correct 584 ms 139808 KB Output is correct
49 Correct 706 ms 157936 KB Output is correct
50 Correct 562 ms 148360 KB Output is correct
51 Correct 555 ms 148484 KB Output is correct
52 Correct 48 ms 94232 KB Output is correct
53 Correct 983 ms 156916 KB Output is correct
54 Correct 731 ms 151888 KB Output is correct
55 Correct 944 ms 174400 KB Output is correct
56 Correct 893 ms 151028 KB Output is correct
57 Correct 2967 ms 311068 KB Output is correct
58 Correct 3476 ms 404540 KB Output is correct
59 Correct 2863 ms 303320 KB Output is correct
60 Correct 2851 ms 303116 KB Output is correct
61 Correct 5681 ms 399832 KB Output is correct
62 Correct 3856 ms 304304 KB Output is correct
63 Correct 5137 ms 404540 KB Output is correct
64 Correct 5373 ms 400612 KB Output is correct
65 Correct 563 ms 143580 KB Output is correct
66 Correct 683 ms 148140 KB Output is correct
67 Incorrect 583 ms 141052 KB Output isn't correct
68 Halted 0 ms 0 KB -