oj.uz

Submission #918160

# Submission time Handle Problem Language Result Execution time Memory
918160 2024-01-29T13:20:31 Z borisAngelov Divide and conquer (IZhO14_divide) C++17
0 / 100
 3 ms 4564 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 100005;
const long long inf = (1LL << 60);

int n;

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

Element a[maxn];

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

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

    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 query(int node, int l ,int r, int ql, int qr)
    {
        pushLazy(node, l, r);

        if (l == r)
        {
            return l;
        }

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

        if (ql <= l && r <= qr)
        {
            return tree[node];
        }

        int mid = (l + r) / 2;

        long long resultLeft = query(2 * node, l, mid, ql, qr);
        long long resultRight = query(2 * node + 1, mid + 1, r, ql, qr);

        if (resultRight != 0)
        {
            return resultRight;
        }

        if (resultLeft != 0)
        {
            return resultLeft;
        }

        return -1;
    }

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

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

    int query(int l, int r)
    {
        return query(1, 1, n, l, r);
    }
};

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)
    {
        if (prefEenrgy[i] - a[i].pos >= 0)
        {
            ans = max(ans, prefGold[i]);
        }
    }

    //cout << "now " << ans << endl;

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

        //cout << i << " " << pos << " " << ans << endl;

        int pos = tree.query(i, 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);
        }
    }

    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
*/

Compilation message

divide.cpp: In member function 'int SegmentTree::query(int, int, int, int, int)':
divide.cpp:93:20: warning: overflow in conversion from 'long long int' to 'int' changes value from '-1152921504606846976' to '0' [-Woverflow]
   93 |             return -inf;
      |                    ^~~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Runtime error 3 ms 4564 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Runtime error 3 ms 4564 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Runtime error 3 ms 4564 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -