oj.uz

Submission #876334

# Submission time Handle Problem Language Result Execution time Memory
876334 2023-11-21T14:44:08 Z danikoynov Fish 2 (JOI22_fish2) C++14
48 / 100
 4000 ms 21188 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;

typedef long long ll;

const int maxn = 1e5 + 10;


int n, q;
ll a[maxn], pref[maxn];
void input()
{
    cin >> n;
    for (int i = 1; i <= n; i ++)
        cin >> a[i];
    cin >> q;
    a[0] = 1e9 + 10;
    a[n + 1] = 1e9 + 10;

}

vector < pair < int, int > > ranges;
void get_ranges()
{

    for (int i = 1; i <= n; i ++)
        pref[i] = pref[i - 1] + a[i];
    pref[n + 1] = pref[n];

    ranges.clear();
    stack < int > st;
    st.push(0);
    for (int i = 1; i <= n; i ++)
    {
        while(!st.empty() && a[st.top()] < a[i])
            st.pop();


        if (pref[i - 1] - pref[st.top()] < a[i])
            ranges.push_back({st.top() + 1, i - 1});

        st.push(i);
    }

    while(!st.empty())
        st.pop();
    st.push(n + 1);
    for (int i = n; i > 0; i --)
    {
        while(!st.empty() && a[st.top()] < a[i])
            st.pop();

        if (pref[st.top() - 1] - pref[i] < a[i])
            ranges.push_back({i + 1, st.top() - 1});

        st.push(i);
    }
}

int b[maxn];

struct node
{
    int cnt, mx;

    node(int _cnt = 0, int _mx = 1e9 + 10)
    {
        cnt = _cnt;
        mx = _mx;
    }
};

node tree[4 * maxn];

node merge_node(node lf, node rf)
{
    if (lf.cnt == -1 || rf.mx < lf.mx)
        return rf;
    if (rf.cnt == -1 || lf.mx < rf.mx)
        return lf;

    return node(lf.cnt + rf.cnt, lf.mx);
}

void build_tree(int root, int left, int right)
{
    if (left == right)
    {
        tree[root].mx = b[left];
        tree[root].cnt = 1;
        return;
    }

    int mid = (left + right) / 2;
    build_tree(root * 2, left, mid);
    build_tree(root * 2 + 1, mid + 1, right);

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

node query(int root, int left, int right, int qleft, int qright)
{
    if (left > qright || right < qleft)
        return node(-1, 1e9 + 10);

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

    int mid = (left + right) / 2;

    return merge_node(query(root * 2, left, mid, qleft, qright),
            query(root * 2 + 1, mid + 1, right, qleft, qright));
}

ll values[maxn];

struct segment_tree
{
    ll tree[4 * maxn], lazy[4 * maxn];


    void build_tree(int root, int left, int right)
    {
        lazy[root] = 0;
        if (left == right)
        {
            tree[root] = values[left];
            return;
        }

        int mid = (left + right) / 2;
        build_tree(root * 2, left, mid);
        build_tree(root * 2 + 1, mid + 1, right);

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

    void push_lazy(int root, int left, int right)
    {
        tree[root] += lazy[root];
        if (left != right)
        {
            lazy[root * 2] += lazy[root];
            lazy[root * 2 + 1] += lazy[root];
        }

        lazy[root] = 0;
    }

    void update_range(int root, int left, int right, int qleft, int qright, ll val)
    {
        push_lazy(root, left, right);
        if (left > qright || right < qleft)
            return;

        if (left >= qleft && right <= qright)
        {
            lazy[root] += val;
            push_lazy(root, left, right);
            return;
        }

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

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

    ll walk_left(int root, int left, int right, int qleft, int qright, ll val)
    {
        push_lazy(root, left, right);
        if (left > qright || right < qleft || tree[root] <= val)
            return n + 1;

        if (left == right)
            return left;

        int mid = (left + right) / 2;
        if (left >= qleft && right <= qright)
        {
            if (tree[root * 2] > val)
                return walk_left(root * 2, left, mid, qleft, qright, val);
            return walk_left(root * 2 + 1, mid + 1, right, qleft, qright, val);
        }

        return min(walk_left(root * 2, left, mid, qleft, qright, val),
                walk_left(root * 2 + 1, mid + 1, right, qleft, qright, val));
    }

    ll walk_right(int root, int left, int right, int qleft, int qright, ll val)
    {
        push_lazy(root, left, right);
        if (left > qright || right < qleft || tree[root] <= val)
            return 0;

        if (left == right)
            return left;

        int mid = (left + right) / 2;
        if (left >= qleft && right <= qright)
        {
            if (tree[root * 2 + 1] > val)
                    return walk_right(root * 2 + 1, mid + 1, right, qleft, qright, val);
            return walk_right(root * 2, left, mid, qleft, qright, val);
        }

        return max(walk_right(root * 2, left, mid, qleft, qright, val),
                walk_right(root * 2 + 1, mid + 1, right, qleft, qright, val));
    }
};

segment_tree left_tree, right_tree;

void solve_query(int left, int right)
{

    //for (pair < int, int > cur : ranges)
      //  cout << cur.first << " : " << cur.second << endl;


    /**int lb = left, rb = right;
    for (int i = left; i <= right; i ++)
    {
        //if (a[i] > pref[i - 1] - pref[left - 1])
          //  lb = max(lb, i);
        if (a[i] > pref[right] - pref[i])
            rb = min(rb, i);
    }*/
    int lb = left_tree.walk_right(1, 1, n, left, right, - pref[left - 1]);
    int rb = right_tree.walk_left(1, 1, n, left, right, pref[right]);
    /**cout << lb << " " << a[left + 2] - pref[left + 1] << " " << " " << -pref[left - 1] << endl;
    for (int i = 1; i <= n; i ++)
        cout << pref[i] << " ";
    cout << endl;*/

    /**int minx = 1e9;
    for (int i = lb; i <= rb; i ++)
        minx = min(minx, b[i]);

    int ans = 0;
    for (int i = lb; i <= rb; i ++)
        if (b[i] == minx)
        ans ++;*/

    cout << query(1, 1, n, lb, rb).cnt << endl;
}

void restructure()
{
    get_ranges();
    for (int i = 1; i <= n; i ++)
        b[i] = 0;
    for (pair < int, int > cur : ranges)
        for (int i = cur.first; i <= cur.second; i ++)
        b[i] ++;
    build_tree(1, 1, n);
    for (int i = 1; i <= n; i ++)
    {
        values[i] = a[i] - pref[i - 1];
    }
    left_tree.build_tree(1, 1, n);

    for (int i = 1; i <= n; i ++)
    {
        values[i] = a[i] + pref[i];
    }
    right_tree.build_tree(1, 1, n);
}
void simulate()
{
    restructure();
    for (int i = 1; i <= q; i ++)
    {
        int type;
        cin >> type;
        if (type == 1)
        {
            int idx;
            ll x;
            cin >> idx >> x;
            a[idx] = x;
            restructure();
        }
        else
        {
            int l, r;
            cin >> l >> r;
            solve_query(l, r);
        }
    }
}
void solve()
{
    input();
    simulate();
}

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
int main()
{
    speed();
    solve();
    return 0;
}
/*
12
32 32 4 1 1 1 1 4 4 16 32 128
1
2 8 10

*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 9 ms 10588 KB Output is correct
6 Correct 4 ms 10588 KB Output is correct
7 Correct 9 ms 10688 KB Output is correct
8 Correct 6 ms 10588 KB Output is correct
9 Correct 4 ms 10588 KB Output is correct
10 Correct 7 ms 10760 KB Output is correct
11 Correct 3 ms 10692 KB Output is correct
12 Correct 9 ms 10588 KB Output is correct
13 Correct 4 ms 10764 KB Output is correct
14 Correct 10 ms 10588 KB Output is correct
15 Correct 7 ms 10588 KB Output is correct
16 Correct 4 ms 10840 KB Output is correct
17 Correct 8 ms 10588 KB Output is correct
18 Correct 3 ms 10588 KB Output is correct
19 Correct 7 ms 10588 KB Output is correct
20 Correct 3 ms 10588 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 14 ms 20224 KB Output is correct
3 Correct 13 ms 20436 KB Output is correct
4 Correct 14 ms 20276 KB Output is correct
5 Correct 14 ms 20312 KB Output is correct
6 Correct 16 ms 19920 KB Output is correct
7 Correct 13 ms 20076 KB Output is correct
8 Correct 16 ms 20080 KB Output is correct
9 Correct 13 ms 20180 KB Output is correct
10 Correct 14 ms 20180 KB Output is correct
11 Correct 14 ms 20436 KB Output is correct
12 Correct 15 ms 19924 KB Output is correct
13 Correct 14 ms 19924 KB Output is correct
14 Correct 14 ms 20176 KB Output is correct
15 Correct 15 ms 20180 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 9 ms 10588 KB Output is correct
6 Correct 4 ms 10588 KB Output is correct
7 Correct 9 ms 10688 KB Output is correct
8 Correct 6 ms 10588 KB Output is correct
9 Correct 4 ms 10588 KB Output is correct
10 Correct 7 ms 10760 KB Output is correct
11 Correct 3 ms 10692 KB Output is correct
12 Correct 9 ms 10588 KB Output is correct
13 Correct 4 ms 10764 KB Output is correct
14 Correct 10 ms 10588 KB Output is correct
15 Correct 7 ms 10588 KB Output is correct
16 Correct 4 ms 10840 KB Output is correct
17 Correct 8 ms 10588 KB Output is correct
18 Correct 3 ms 10588 KB Output is correct
19 Correct 7 ms 10588 KB Output is correct
20 Correct 3 ms 10588 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 14 ms 20224 KB Output is correct
23 Correct 13 ms 20436 KB Output is correct
24 Correct 14 ms 20276 KB Output is correct
25 Correct 14 ms 20312 KB Output is correct
26 Correct 16 ms 19920 KB Output is correct
27 Correct 13 ms 20076 KB Output is correct
28 Correct 16 ms 20080 KB Output is correct
29 Correct 13 ms 20180 KB Output is correct
30 Correct 14 ms 20180 KB Output is correct
31 Correct 14 ms 20436 KB Output is correct
32 Correct 15 ms 19924 KB Output is correct
33 Correct 14 ms 19924 KB Output is correct
34 Correct 14 ms 20176 KB Output is correct
35 Correct 15 ms 20180 KB Output is correct
36 Correct 2183 ms 20548 KB Output is correct
37 Correct 1414 ms 20492 KB Output is correct
38 Correct 254 ms 20436 KB Output is correct
39 Correct 3283 ms 20436 KB Output is correct
40 Correct 261 ms 20432 KB Output is correct
41 Correct 1621 ms 20168 KB Output is correct
42 Correct 606 ms 19928 KB Output is correct
43 Correct 1567 ms 20420 KB Output is correct
44 Correct 515 ms 20212 KB Output is correct
45 Correct 2231 ms 20532 KB Output is correct
46 Correct 1392 ms 20688 KB Output is correct
47 Correct 248 ms 20436 KB Output is correct
48 Correct 3690 ms 20172 KB Output is correct
49 Correct 534 ms 19928 KB Output is correct
50 Correct 2086 ms 20364 KB Output is correct
51 Correct 1635 ms 20368 KB Output is correct
52 Correct 242 ms 20184 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 14 ms 20224 KB Output is correct
3 Correct 13 ms 20436 KB Output is correct
4 Correct 14 ms 20276 KB Output is correct
5 Correct 14 ms 20312 KB Output is correct
6 Correct 16 ms 19920 KB Output is correct
7 Correct 13 ms 20076 KB Output is correct
8 Correct 16 ms 20080 KB Output is correct
9 Correct 13 ms 20180 KB Output is correct
10 Correct 14 ms 20180 KB Output is correct
11 Correct 14 ms 20436 KB Output is correct
12 Correct 15 ms 19924 KB Output is correct
13 Correct 14 ms 19924 KB Output is correct
14 Correct 14 ms 20176 KB Output is correct
15 Correct 15 ms 20180 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Correct 138 ms 20832 KB Output is correct
18 Correct 129 ms 20932 KB Output is correct
19 Correct 154 ms 20936 KB Output is correct
20 Correct 142 ms 20640 KB Output is correct
21 Correct 142 ms 20680 KB Output is correct
22 Correct 128 ms 20960 KB Output is correct
23 Correct 146 ms 20840 KB Output is correct
24 Correct 142 ms 20708 KB Output is correct
25 Correct 138 ms 20800 KB Output is correct
26 Correct 142 ms 20676 KB Output is correct
27 Correct 125 ms 20480 KB Output is correct
28 Correct 124 ms 20420 KB Output is correct
29 Correct 126 ms 20656 KB Output is correct
30 Correct 143 ms 20424 KB Output is correct
31 Correct 133 ms 20424 KB Output is correct
32 Correct 155 ms 20672 KB Output is correct
33 Correct 129 ms 20672 KB Output is correct
34 Correct 150 ms 20680 KB Output is correct
35 Correct 134 ms 20680 KB Output is correct
36 Correct 131 ms 20896 KB Output is correct
37 Correct 120 ms 20168 KB Output is correct
38 Correct 114 ms 20168 KB Output is correct
39 Correct 125 ms 20680 KB Output is correct
40 Correct 114 ms 21188 KB Output is correct

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 14 ms 20224 KB Output is correct
3 Correct 13 ms 20436 KB Output is correct
4 Correct 14 ms 20276 KB Output is correct
5 Correct 14 ms 20312 KB Output is correct
6 Correct 16 ms 19920 KB Output is correct
7 Correct 13 ms 20076 KB Output is correct
8 Correct 16 ms 20080 KB Output is correct
9 Correct 13 ms 20180 KB Output is correct
10 Correct 14 ms 20180 KB Output is correct
11 Correct 14 ms 20436 KB Output is correct
12 Correct 15 ms 19924 KB Output is correct
13 Correct 14 ms 19924 KB Output is correct
14 Correct 14 ms 20176 KB Output is correct
15 Correct 15 ms 20180 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Execution timed out 4078 ms 20308 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 9 ms 10588 KB Output is correct
6 Correct 4 ms 10588 KB Output is correct
7 Correct 9 ms 10688 KB Output is correct
8 Correct 6 ms 10588 KB Output is correct
9 Correct 4 ms 10588 KB Output is correct
10 Correct 7 ms 10760 KB Output is correct
11 Correct 3 ms 10692 KB Output is correct
12 Correct 9 ms 10588 KB Output is correct
13 Correct 4 ms 10764 KB Output is correct
14 Correct 10 ms 10588 KB Output is correct
15 Correct 7 ms 10588 KB Output is correct
16 Correct 4 ms 10840 KB Output is correct
17 Correct 8 ms 10588 KB Output is correct
18 Correct 3 ms 10588 KB Output is correct
19 Correct 7 ms 10588 KB Output is correct
20 Correct 3 ms 10588 KB Output is correct
21 Correct 2 ms 10588 KB Output is correct
22 Correct 14 ms 20224 KB Output is correct
23 Correct 13 ms 20436 KB Output is correct
24 Correct 14 ms 20276 KB Output is correct
25 Correct 14 ms 20312 KB Output is correct
26 Correct 16 ms 19920 KB Output is correct
27 Correct 13 ms 20076 KB Output is correct
28 Correct 16 ms 20080 KB Output is correct
29 Correct 13 ms 20180 KB Output is correct
30 Correct 14 ms 20180 KB Output is correct
31 Correct 14 ms 20436 KB Output is correct
32 Correct 15 ms 19924 KB Output is correct
33 Correct 14 ms 19924 KB Output is correct
34 Correct 14 ms 20176 KB Output is correct
35 Correct 15 ms 20180 KB Output is correct
36 Correct 2183 ms 20548 KB Output is correct
37 Correct 1414 ms 20492 KB Output is correct
38 Correct 254 ms 20436 KB Output is correct
39 Correct 3283 ms 20436 KB Output is correct
40 Correct 261 ms 20432 KB Output is correct
41 Correct 1621 ms 20168 KB Output is correct
42 Correct 606 ms 19928 KB Output is correct
43 Correct 1567 ms 20420 KB Output is correct
44 Correct 515 ms 20212 KB Output is correct
45 Correct 2231 ms 20532 KB Output is correct
46 Correct 1392 ms 20688 KB Output is correct
47 Correct 248 ms 20436 KB Output is correct
48 Correct 3690 ms 20172 KB Output is correct
49 Correct 534 ms 19928 KB Output is correct
50 Correct 2086 ms 20364 KB Output is correct
51 Correct 1635 ms 20368 KB Output is correct
52 Correct 242 ms 20184 KB Output is correct
53 Correct 2 ms 10584 KB Output is correct
54 Correct 138 ms 20832 KB Output is correct
55 Correct 129 ms 20932 KB Output is correct
56 Correct 154 ms 20936 KB Output is correct
57 Correct 142 ms 20640 KB Output is correct
58 Correct 142 ms 20680 KB Output is correct
59 Correct 128 ms 20960 KB Output is correct
60 Correct 146 ms 20840 KB Output is correct
61 Correct 142 ms 20708 KB Output is correct
62 Correct 138 ms 20800 KB Output is correct
63 Correct 142 ms 20676 KB Output is correct
64 Correct 125 ms 20480 KB Output is correct
65 Correct 124 ms 20420 KB Output is correct
66 Correct 126 ms 20656 KB Output is correct
67 Correct 143 ms 20424 KB Output is correct
68 Correct 133 ms 20424 KB Output is correct
69 Correct 155 ms 20672 KB Output is correct
70 Correct 129 ms 20672 KB Output is correct
71 Correct 150 ms 20680 KB Output is correct
72 Correct 134 ms 20680 KB Output is correct
73 Correct 131 ms 20896 KB Output is correct
74 Correct 120 ms 20168 KB Output is correct
75 Correct 114 ms 20168 KB Output is correct
76 Correct 125 ms 20680 KB Output is correct
77 Correct 114 ms 21188 KB Output is correct
78 Correct 2 ms 10584 KB Output is correct
79 Execution timed out 4078 ms 20308 KB Time limit exceeded
80 Halted 0 ms 0 KB -