oj.uz

Submission #918230

# Submission time Handle Problem Language Result Execution time Memory
918230 2024-01-29T13:40:55 Z borisAngelov Divide and conquer (IZhO14_divide) C++17
100 / 100
 69 ms 9536 KB 
//BLYAT
#include <bits/stdc++.h>

using namespace std;

const int maxn = 100005;
const long long inf = 1e17;

int n;

struct Element
{
    int pos;
    long long gold;
    long long energy;
};

Element a[maxn];

long long prefEenrgy[maxn];
long long prefGold[maxn];

struct SegmentTree
{
    long long tree[maxn * 4];
    long long lazy[maxn * 4];

    void build(int node, int l, int r)
    {
        lazy[node] = 0;

        if (l == r)
        {
            tree[node] = prefEenrgy[l] - a[l].pos;
            return;
        }

        int mid = (l + r) / 2;

        build(2 * node, l, mid);
        build(2 * node + 1, mid + 1, r);

        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }

    void pushLazy(int node, int l, int r)
    {
        tree[node] += lazy[node];

        if (l != r)
        {
            lazy[2 * node] += lazy[node];
            lazy[2 * node + 1] += lazy[node];
        }

        lazy[node] = 0;
    }

    void update(int node, int l, int r, int ql, int qr, long long delta)
    {
        pushLazy(node, l, r);

        if (l > qr || r < ql)
        {
            return;
        }

        if (ql <= l && r <= qr)
        {
            lazy[node] += delta;
            pushLazy(node, l, r);
            return;
        }

        int mid = (l + r) / 2;

        update(2 * node, l, mid, ql, qr, delta);
        update(2 * node + 1, mid + 1, r, ql, qr, delta);

        tree[node] = max(tree[2 * node], tree[2 * node + 1]);
    }

    int walk(int node, int l, int r) // sure you made all PUSHING LAZY !!!!!
    {
        pushLazy(node, l, r);

        if (l == r)
        {
            if (tree[node] >= 0)
            {
                return l;
            }
            else
            {
                return -1;
            }
        }

        int mid = (l + r) / 2;

        if (tree[2 * node + 1] + lazy[2 * node + 1] >= 0)
        {
            return walk(2 * node + 1, mid + 1, r);
        }
        else
        {
            return walk(2 * node, l, mid);
        }
    }

    void build()
    {
        build(1, 1, n);
    }

    void update(int l, int r, long long delta)
    {
        update(1, 1, n, l, r, delta);
    }
};

SegmentTree tree;

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n;

    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i].pos >> a[i].gold >> a[i].energy;
        prefEenrgy[i] = prefEenrgy[i - 1] + a[i].energy;
        prefGold[i] = prefGold[i - 1] + a[i].gold;
    }

    for (int i = 2; i <= n; ++i)
    {
        a[i].pos -= a[1].pos;
    }

    a[1].pos = 0;

    tree.build();

    long long ans = -inf;

    for (int i = 1; i <= n; ++i)
    {
        ans = max(ans, a[i].gold);
    }

    for (int i = 1; i <= n; ++i)
    {
        int pos = tree.walk(1, 1, n);

        if (pos != -1)
        {
            ans = max(ans, prefGold[pos] - prefGold[i - 1]);
        }

        if (i + 1 <= n)
        {
            tree.update(i + 1, n, (a[i + 1].pos - a[i].pos) - a[i].energy);
        }

        tree.update(i, i, -inf);
    }

    cout << ans << endl;

    return 0;
}

/*
4
0 5 1
1 7 2
4 4 1
7 15 1

4
1 5 1
2 7 2
5 4 1
8 15 1

2
2 4 1
5 5 1
*/

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4508 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4508 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4696 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 4 ms 4700 KB Output is correct
24 Correct 4 ms 4700 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4508 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4696 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 4 ms 4700 KB Output is correct
24 Correct 4 ms 4700 KB Output is correct
25 Correct 3 ms 4700 KB Output is correct
26 Correct 8 ms 6744 KB Output is correct
27 Correct 7 ms 6748 KB Output is correct
28 Correct 31 ms 7488 KB Output is correct
29 Correct 34 ms 7464 KB Output is correct
30 Correct 69 ms 9296 KB Output is correct
31 Correct 63 ms 9536 KB Output is correct
32 Correct 68 ms 9336 KB Output is correct
33 Correct 62 ms 9304 KB Output is correct
34 Correct 64 ms 9304 KB Output is correct
35 Correct 65 ms 9308 KB Output is correct
36 Correct 67 ms 9296 KB Output is correct