oj.uz

답안 #938900

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938900 2024-03-05T19:21:29 Z danikoynov Two Antennas (JOI19_antennas) C++14
13 / 100
 3000 ms 84816 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}


const ll maxn = 2e5 + 10;

struct query
{
    ll l, r, idx;

    query(ll _l = 0, ll _r = 0, ll _idx = 0)
    {
        l = _l;
        r = _r;
        idx = _idx;
    }
} task[maxn];

ll n, q;
ll h[maxn], a[maxn], b[maxn];
vector < query > spot[maxn];
ll ans[maxn];

void input()
{
    cin >> n;
    for (ll i = 1; i <= n; i ++)
    {
        cin >> h[i] >> a[i] >> b[i];
    }
    cin >> q;
    for (ll i = 1; i <= q; i ++)
        ans[i] = -1;

    for (ll i = 1; i <= q; i ++)
    {
        cin >> task[i].l >> task[i].r;
        task[i].idx = i;
        spot[task[i].r].push_back(task[i]);
    }
}

const ll inf = 2e9 + 10;
ll act[maxn], low[maxn];
vector < ll > upd[2][2 * maxn];

struct node
{
    ll max_dif, max_low, sec_low;
    ll res;

    node()
    {
        max_dif = -inf;
        max_low = inf;
        sec_low = -inf;
        res = -inf;
    }
};

node merge_nodes(node lf, node rf)
{
    /// careful for free node

    node mf;
    mf.max_low = max(lf.max_low, rf.max_low);
    if (lf.max_low != mf.max_low && lf.max_low > mf.sec_low)
        mf.sec_low = lf.max_low;
    if (lf.sec_low != mf.max_low && lf.sec_low > mf.sec_low)
        mf.sec_low = lf.sec_low;

    if (rf.max_low != mf.max_low && rf.max_low > mf.sec_low)
        mf.sec_low = rf.max_low;
    if (rf.sec_low != mf.max_low && rf.sec_low > mf.sec_low)
        mf.sec_low = rf.sec_low;

    if (lf.max_low == mf.max_low && lf.max_dif > mf.max_dif)
        mf.max_dif = lf.max_dif;
    if (rf.max_low == mf.max_low && rf.max_dif > mf.max_dif)
        mf.max_dif = rf.max_dif;

    mf.res = max(lf.res, rf.res);

    return mf;
}

node tree[4 * maxn];

ll lazy[4 * maxn];
ll tag[4 * maxn];
void build(ll root, ll left, ll right)
{
    lazy[root] = tag[root] = 0;
    if (left == right)
    {
        tree[root] = node();
        tree[root].max_dif = 0 - inf;
        tree[root].max_low = inf;
        tree[root].sec_low = -inf;
        tree[root].res = tree[root].max_dif;
        return;
    }

    ll mid = (left + right) / 2;
    build(root * 2, left, mid);
    build(root * 2 + 1, mid + 1, right);

    tree[root] = merge_nodes(tree[root * 2], tree[root * 2 + 1]);
}


void push_lazy(ll root, ll left, ll right)
{
    if (tag[root] == 0 || lazy[root] > tree[root].max_low)
    {
        tag[root] = 0;
        lazy[root] = 0;
        return;
    }
    ///cout << "push " << root << " " << left << " " << right << " " << lazy[root] << endl;
        //cout << "push_lazy " << endl;

    ll delta = tree[root].max_low - lazy[root];
    tree[root].max_dif += delta;
    tree[root].res = max(tree[root].res, tree[root].max_dif);
    tree[root].max_low = lazy[root];

    if (left != right)
    {
        lazy[root * 2] = lazy[root];
        lazy[root * 2 + 1] = lazy[root];

        tag[root * 2] = tag[root * 2 + 1] = 1;
    }
    tag[root] = 0;
    lazy[root] = 0;
}

void chmin(ll root, ll left, ll right, ll qleft, ll qright, ll val)
{
    //cout << root << " " << tag[16] << endl;
    push_lazy(root, left, right);
    if (left > qright || right < qleft || tree[root].max_low < val)
        return;

    if (left >= qleft && right <= qright && tree[root].sec_low < val)
    {
        //if (left <= 5 && right >= 5)
        //cout << "CHMIN " << left << " " << right << " " << val << endl;
        lazy[root] = val;
        tag[root] = 1;
        push_lazy(root, left, right);
        return;
    }

    ll mid = (left + right) / 2;
    chmin(root * 2, left, mid, qleft, qright, val);
    chmin(root * 2 + 1, mid + 1, right, qleft, qright, val);

    tree[root] = merge_nodes(tree[root * 2], tree[root * 2 + 1]);
}

void point_update(ll root, ll left, ll right, ll pivot, ll val)
{
    assert( left <= right);
    push_lazy(root, left, right);

    if (left == right)
    {
        tree[root] = node();
            tree[root].max_dif = val - inf;
        tree[root].max_low = inf;
        tree[root].sec_low = -inf;
        tree[root].res = tree[root].max_dif;
        return;
    }

    ll mid = (left + right) / 2;
    if (pivot <= mid)
    {

        push_lazy(root * 2 + 1, mid + 1, right);
        point_update(root * 2, left, mid, pivot, val);
    }
    else
    {
        push_lazy(root * 2, left, mid);
        point_update(root * 2 + 1, mid + 1, right, pivot, val);
    }

    tree[root] = merge_nodes(tree[root * 2], tree[root * 2 + 1]);
}

ll point_query(ll root, ll left, ll right, ll pivot)
{

    push_lazy(root, left, right);
    if (left == right)
        return tree[root].res;
    ll mid = (left + right) / 2;
    if (pivot <= mid)
        return point_query(root * 2, left, mid, pivot);
    else
        return point_query(root * 2 + 1, mid + 1, right, pivot);
}

ll range_query(ll root, ll left, ll right, ll qleft, ll qright)
{

    push_lazy(root, left, right);
    if (left > qright || right < qleft)
        return -inf;

    if (left >= qleft && right <= qright)
        return tree[root].res;

    ll mid = (left + right) / 2;
    return max(range_query(root * 2, left, mid, qleft, qright),
               range_query(root * 2 + 1, mid + 1, right, qleft, qright));
}

ll values[maxn];
void sweep_line()
{
    ///cerr << task[49].l << " : " << task[49].r << endl;
    for (ll i = 1; i <= n; i ++)
    {
        low[i] = inf;
        act[i] = 0;
        values[i] = -inf;
        upd[0][i + a[i]].push_back(i);
        upd[1][i + b[i]].push_back(i);
    }

    build(1, 1, n);
    for (ll i = 1; i <= n; i ++)
    {
        for (ll cur : upd[0][i])
        {
            //cout << "Activate " << cur << endl;
            act[cur] = 1;
            point_update(1, 1, n, cur, h[cur]);
        }

        ll lf = max((ll)1, i - b[i]), rf = max((ll)0, i - a[i]);
        chmin(1, 1, n, lf, rf, h[i]);
        for (ll j = lf; j <= rf; j ++)
        {
            if (act[j])
                low[j] = min(low[j], h[i]);
        }

        //if (i == 95)
        /**for (int i = 1; i <= n; i ++)
            cerr << act[i] << " ";
        cerr << endl;
        for (int i = 1; i <= n; i ++)
            cerr << low[i] << " ";
        cerr << endl;*/
    //cout << "step " << i << " " << lf << " " << rf << " " << h[i] << endl;
        /**for (int j = 5; j <= 5; j ++)
        {
            ll t1 = point_query(1, 1, n, j);
            if (t1 > h[j] - low[j] && h[j] - low[j] >= 0)
            {
                cout << "STOP!" << endl;
                cout << t1 << " " << h[j] - low[j] << " " << j <<  " " << act[j] << endl;
                exit(0);
            }
        }*/
//            cerr << point_query(1 ,1 ,n, j) << " " << h[j] - low[j] << endl;
  //      cerr << endl;cerr<< "--------------" << endl;}
        for (ll cur : upd[1][i])
        {
            act[cur] = 0;
            //cout << "Deactivate " << cur << endl;
            values[cur] = point_query(1 ,1, n, cur);
            point_update(1, 1, n, cur, 0);
        }

        for (query cur : spot[i])
        {
            for (ll j = cur.l; j <= cur.r; j ++)
            {
                ans[cur.idx] = max(ans[cur.idx], values[j]);
            }
            ll cs = range_query(1, 1, n, cur.l, cur.r);
            /**if (cs == 841326895)
            {

                cout << "CHANGE HERE" << " " << i << endl;
            }*/
            ans[cur.idx] = max(ans[cur.idx], cs);
        }

    }

    ///cout << "FINISH" << endl;
}

void reverse_data()
{
    reverse(h + 1, h + n + 1);
    reverse(a + 1, a + n + 1);
    reverse(b + 1, b + n + 1);

    for (ll i = 1; i <= n; i ++)
    {
        spot[i].clear();
        upd[0][i].clear();
        upd[1][i].clear();
    }

    for (ll i = 1; i <= q; i ++)
    {
        ll nl = n - task[i].r + 1, nr = n - task[i].l + 1;
        ///cout << i << " : " << nl << " " << nr << endl;
        task[i].l = nl;
        task[i].r = nr;
        spot[task[i].r].push_back(task[i]);
    }
}

void prll()
{
    for (ll i = 1; i <= q; i ++)
    {

        cout << ans[i]  << endl;

    }
}
void solve()
{
    input();

    sweep_line();
    reverse_data();
    sweep_line();
    prll();
}

int main()
{
    speed();
    ///freopen("output.txt", "w", stdout);
    ///freopen("input.txt", "r", stdin);
    solve();
    return 0;
}
/**
5
10 2 4
1 1 1
2 1 3
1 1 1
100 1 1
1
1 2


111
2342163 25 76
738276997 50 52
1669890 26 40
14902411 56 81
899007094 32 85
422634516 2 71
936109680 79 100
638713463 109 110
119468142 28 104\
713258492 104 107
267306336 1 39
973810399 87 90
835929417 43 86
335127775 12 104
840490095 39 66
459253103 11 104
706538155 4 101
194912428 82 96
949222000 73 96
910118043 85 95
226986709 46 100
827920993 75 83
768390729 46 87
314695927 26 30
230872586 49 82
995156805 60 93
497044719 3 103
827805975 75 83
499889872 95 110
590726845 66 73
607078123 59 99
370425117 26 76
490217622 18 32
431150446 77 89
9267221 13 81
693001694 64 95
866349101 26 93
844742196 6 63
655634427 33 88
829473857 67 92
311419714 15 56
900123935 42 87
665050273 42 59
792230034 12 34
847490718 11 21
177697704 66 81
198679758 24 54
668213379 14 45
45659509 82 91
327099919 21 82
118001173 81 85
738608951 80 101
214209461 38 97
324473845 107 109
879267283 109 109
190386778 43 77
881527758 25 44
18672166 13 21
733749641 73 92
653264399 103 110
870234612 104 106
101340654 33 40
710067113 71 104
616465791 8 14
610725519 6 58
376168562 89 109
93289534 79 107
973278654 55 85
183001646 37 50
70495079 47 89
383449644 76 77
239592436 26 49
561740304 21 27
326305893 94 101
376448990 28 85
558483855 107 110
58797040 8 97
479096372 76 90
435216279 42 87
583841698 92 106
277031377 63 110
56594141 34 38
381128173 40 95
275114013 110 110
716940824 48 85
805968236 44 55
997032121 87 92
958531100 90 104
459788004 39 85
618435405 34 97
833464071 87 99
527989265 92 92
708140049 65 87
707609457 2 78
937680650 71 105
969561745 81 102
960172678 49 65
56883909 7 40
602118268 53 69
980631740 95 101
795277058 19 26
572270576 13 89
440358047 25 79
467566899 16 24
634175510 30 38
673050101 21 60
768461341 54 107
331110483 58 87
218341925 68 77
419836470 30 77
925521790 29 36
1
38 95

*/

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 58460 KB Output is correct
2 Correct 15 ms 58460 KB Output is correct
3 Correct 15 ms 58548 KB Output is correct
4 Correct 17 ms 58460 KB Output is correct
5 Correct 15 ms 58456 KB Output is correct
6 Correct 16 ms 58620 KB Output is correct
7 Correct 14 ms 58460 KB Output is correct
8 Correct 15 ms 58460 KB Output is correct
9 Correct 15 ms 58536 KB Output is correct
10 Correct 15 ms 58540 KB Output is correct
11 Correct 14 ms 58460 KB Output is correct
12 Correct 15 ms 58460 KB Output is correct
13 Correct 14 ms 58456 KB Output is correct
14 Correct 15 ms 58460 KB Output is correct
15 Correct 15 ms 58456 KB Output is correct
16 Correct 14 ms 58712 KB Output is correct
17 Correct 15 ms 58444 KB Output is correct
18 Correct 16 ms 58460 KB Output is correct
19 Correct 14 ms 58460 KB Output is correct
20 Correct 14 ms 58424 KB Output is correct
21 Correct 15 ms 58632 KB Output is correct
22 Correct 16 ms 58460 KB Output is correct
23 Correct 15 ms 58460 KB Output is correct
24 Correct 14 ms 58416 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 58460 KB Output is correct
2 Correct 15 ms 58460 KB Output is correct
3 Correct 15 ms 58548 KB Output is correct
4 Correct 17 ms 58460 KB Output is correct
5 Correct 15 ms 58456 KB Output is correct
6 Correct 16 ms 58620 KB Output is correct
7 Correct 14 ms 58460 KB Output is correct
8 Correct 15 ms 58460 KB Output is correct
9 Correct 15 ms 58536 KB Output is correct
10 Correct 15 ms 58540 KB Output is correct
11 Correct 14 ms 58460 KB Output is correct
12 Correct 15 ms 58460 KB Output is correct
13 Correct 14 ms 58456 KB Output is correct
14 Correct 15 ms 58460 KB Output is correct
15 Correct 15 ms 58456 KB Output is correct
16 Correct 14 ms 58712 KB Output is correct
17 Correct 15 ms 58444 KB Output is correct
18 Correct 16 ms 58460 KB Output is correct
19 Correct 14 ms 58460 KB Output is correct
20 Correct 14 ms 58424 KB Output is correct
21 Correct 15 ms 58632 KB Output is correct
22 Correct 16 ms 58460 KB Output is correct
23 Correct 15 ms 58460 KB Output is correct
24 Correct 14 ms 58416 KB Output is correct
25 Correct 159 ms 68244 KB Output is correct
26 Correct 45 ms 59728 KB Output is correct
27 Correct 303 ms 71920 KB Output is correct
28 Correct 329 ms 71504 KB Output is correct
29 Correct 167 ms 68852 KB Output is correct
30 Correct 225 ms 68160 KB Output is correct
31 Correct 133 ms 70428 KB Output is correct
32 Correct 346 ms 71380 KB Output is correct
33 Correct 247 ms 77220 KB Output is correct
34 Correct 170 ms 72992 KB Output is correct
35 Correct 273 ms 78160 KB Output is correct
36 Correct 334 ms 76932 KB Output is correct
37 Correct 187 ms 73552 KB Output is correct
38 Correct 324 ms 78072 KB Output is correct
39 Correct 56 ms 66532 KB Output is correct
40 Correct 318 ms 75876 KB Output is correct
41 Correct 247 ms 73856 KB Output is correct
42 Correct 321 ms 77936 KB Output is correct
43 Correct 113 ms 68944 KB Output is correct
44 Correct 318 ms 75976 KB Output is correct
45 Correct 66 ms 67068 KB Output is correct
46 Correct 329 ms 75924 KB Output is correct
47 Correct 90 ms 67920 KB Output is correct
48 Correct 318 ms 75740 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3076 ms 84816 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 58460 KB Output is correct
2 Correct 15 ms 58460 KB Output is correct
3 Correct 15 ms 58548 KB Output is correct
4 Correct 17 ms 58460 KB Output is correct
5 Correct 15 ms 58456 KB Output is correct
6 Correct 16 ms 58620 KB Output is correct
7 Correct 14 ms 58460 KB Output is correct
8 Correct 15 ms 58460 KB Output is correct
9 Correct 15 ms 58536 KB Output is correct
10 Correct 15 ms 58540 KB Output is correct
11 Correct 14 ms 58460 KB Output is correct
12 Correct 15 ms 58460 KB Output is correct
13 Correct 14 ms 58456 KB Output is correct
14 Correct 15 ms 58460 KB Output is correct
15 Correct 15 ms 58456 KB Output is correct
16 Correct 14 ms 58712 KB Output is correct
17 Correct 15 ms 58444 KB Output is correct
18 Correct 16 ms 58460 KB Output is correct
19 Correct 14 ms 58460 KB Output is correct
20 Correct 14 ms 58424 KB Output is correct
21 Correct 15 ms 58632 KB Output is correct
22 Correct 16 ms 58460 KB Output is correct
23 Correct 15 ms 58460 KB Output is correct
24 Correct 14 ms 58416 KB Output is correct
25 Correct 159 ms 68244 KB Output is correct
26 Correct 45 ms 59728 KB Output is correct
27 Correct 303 ms 71920 KB Output is correct
28 Correct 329 ms 71504 KB Output is correct
29 Correct 167 ms 68852 KB Output is correct
30 Correct 225 ms 68160 KB Output is correct
31 Correct 133 ms 70428 KB Output is correct
32 Correct 346 ms 71380 KB Output is correct
33 Correct 247 ms 77220 KB Output is correct
34 Correct 170 ms 72992 KB Output is correct
35 Correct 273 ms 78160 KB Output is correct
36 Correct 334 ms 76932 KB Output is correct
37 Correct 187 ms 73552 KB Output is correct
38 Correct 324 ms 78072 KB Output is correct
39 Correct 56 ms 66532 KB Output is correct
40 Correct 318 ms 75876 KB Output is correct
41 Correct 247 ms 73856 KB Output is correct
42 Correct 321 ms 77936 KB Output is correct
43 Correct 113 ms 68944 KB Output is correct
44 Correct 318 ms 75976 KB Output is correct
45 Correct 66 ms 67068 KB Output is correct
46 Correct 329 ms 75924 KB Output is correct
47 Correct 90 ms 67920 KB Output is correct
48 Correct 318 ms 75740 KB Output is correct
49 Execution timed out 3076 ms 84816 KB Time limit exceeded
50 Halted 0 ms 0 KB -