oj.uz

Submission #682188

# Submission time Handle Problem Language Result Execution time Memory
682188 2023-01-16T04:12:56 Z vuavisao Progression (NOI20_progression) C++14
59 / 100
 3000 ms 149836 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
using namespace std;

template<typename Lhs, typename Rhs> inline bool Max_self(Lhs &a, Rhs b) { if(b > a) { a = b; return true; } return false; }
template<typename Lhs, typename Rhs> inline bool Min_self(Lhs &a, Rhs b) { if(b < a) { a = b; return true; } return false; }

const ll N = 3e5 + 10;
const ll INF = 1e18;

struct que {
    ll type = 0;
    ll l = 0, r = 0;
    ll s = 0, c = 0;
    que() {};
    friend istream& operator >> (istream& is, que& other) {
        is >> other.type >> other.l >> other.r;
        if(other.type <= 2) is >> other.s >> other.c;
        return is;
    }
};

ll n, q;
ll a[N];
que qq[N];

namespace sub1 {
    bool check() {
        for(ll i = 1; i <= q; ++ i) {
            if(qq[i].l != 1 || qq[i].r != n) return false;
        }
        return true;
    }

    ll res = 1;
    void solve() {
        for(ll i = 1, j; i < n; i = j - 1) {
            j = i + 1;
            ll s = a[j] - a[i];
            while(j <= n && a[j] - a[j - 1] == s) ++ j;
            res = max(res, j - i);
        }
        for(ll i = 1; i <= q; ++ i) {
            const auto& psy = qq[i];
            if(psy.type == 3) cout << res << '\n';
            else if(psy.type == 2) {
                res = n;
            }
        }
    }
}

namespace sub2 {
    void solve() {
        auto get_far = [&] (ll l, ll r) -> ll {
            ll res = 1;
            for(ll i = l, j; i < r; i = j - 1) {
                j = i + 1;
                ll s = a[j] - a[i];
                while(j <= r && a[j] - a[j - 1] == s) ++ j;
                res = max(res, j - i);
            }
            return res;
        };
        for(ll i = 1; i <= q; ++ i) {
            const auto& psy = qq[i];
            ll type = psy.type;
            if(type == 1) {
                ll add[2] = {psy.s, psy.c};
                for(ll i = psy.l; i <= psy.r; ++ i) {
                    a[i] += add[0];
                    add[0] += add[1];
                }
            }
            else if(type == 2) {
                ll add[2] = {psy.s, psy.c};
                for(ll i = psy.l; i <= psy.r; ++ i) {
                    a[i] = add[0];
                    add[0] += add[1];
                }
            }
            else {
//                cout << psy.l << ' ' << psy.r << '\n';
                cout << get_far(psy.l, psy.r) << '\n';
            }
        }
    }
}

namespace sub3 {
    bool check() {
        for(ll i = 1; i <= q; ++ i) {
            if(qq[i].type < 3) return false;
        }
        return true;
    }

    struct Node {
        struct state {
            ll val = 0, len = 0;
            state() {};
            state(ll _val, ll _len) { val = _val; len = _len; };
        };
        state pref = state(), suf = state();
        state sub = state();
        ll len = 0;
        Node() {};
        Node(ll _val, ll _len) {
            pref = state(_val, _len);
            suf = state(_val, _len);
            sub = state(0, 0);
            len = _len;
        }
        Node operator + (const Node& other) const {
            Node res;
            res.pref = this -> pref;
            if(this -> len == this -> pref.len && this -> pref.val == other.pref.val) {
                res.pref.len += other.pref.len;
            }
            res.suf = other.suf;
            if(other.len == other.suf.len && this -> suf.val == other.suf.val) {
                res.suf.len += this -> suf.len;
            }
            if(Max_self(res.sub.len, this -> sub.len)) res.sub = this -> sub;
            if(Max_self(res.sub.len, other.sub.len)) res.sub = other.sub;
            ll len_pref = min(this -> len - 1, this -> suf.len);
            if(Max_self(res.sub.len, len_pref)) res.sub.val = this -> suf.val;
            ll len_suf = min(other.len - 1, other.pref.len);
            if(Max_self(res.sub.len, len_suf)) res.sub.val = other.pref.val;
            if(this -> suf.val == other.pref.val && Max_self(res.sub.len, len_pref + len_suf)) {
                res.sub.val = this -> suf.val;
            }
            res.len = this -> len + other.len;
            return res;
        }
    };

    Node tree[N << 2];
    ll diff[N];

    void make_first(ll node, ll l, ll r, ll* value) {
        if(l == r) {
            tree[node] = Node(value[l], 1);
            return;
        }
        ll mid = (l + r) >> 1;
        make_first(node << 1, l, mid, value);
        make_first(node << 1 | 1, mid + 1, r, value);
        tree[node] = tree[node << 1] + tree[node << 1 | 1];
    }

    Node query(ll node, ll l, ll r, ll L, ll R) {
//        assert(L <= R && l <= r);
        if(l > r || L > R) assert(false);
        if(L <= l && r <= R) return tree[node];
        ll mid = (l + r) >> 1;
        if(R <= mid) return query(node << 1, l, mid, L, R);
        if(L > mid) return query(node << 1 | 1, mid + 1, r, L, R);
        return query(node << 1, l, mid, L, R) + query(node << 1 | 1, mid + 1, r, L, R);
    }

    void solve() {
        for(ll i = 1; i <= n; ++ i) diff[i] = a[i] - a[i - 1];
        make_first(1, 1, n, diff);
        for(ll i = 1; i <= q; ++ i) {
            const auto& psy = qq[i];
            ll res = 0;
            Node tmp = query(1, 1, n, psy.l, psy.r);
            Max_self(res, tmp.pref.len);
//            cout << res << '\n';
            Max_self(res, tmp.sub.len + 1);
//            cout << res << '\n';
            Max_self(res, tmp.suf.len + 1);
//            cout << res << '\n';
            Min_self(res, psy.r - psy.l + 1);
            cout << res << '\n';
        }
    }
}

namespace sub4 {
    bool check() {
        for(ll i = 1; i <= q; ++ i) {
            if(qq[i].type <= 2 && qq[i].l != qq[i].r) return false;
        }
        return true;
    }

    struct Node {
        struct state {
            ll val = 0, len = 0;
            state() {};
            state(ll _val, ll _len) { val = _val; len = _len; };
        };
        state pref = state(), suf = state();
        state sub = state();
        ll len = 0;
        Node() {};
        Node(ll _val, ll _len) {
            pref = state(_val, _len);
            suf = state(_val, _len);
            sub = state(0, 0);
            len = _len;
        }
        Node operator + (const Node& other) const {
            Node res;
            res.pref = this -> pref;
            if(this -> len == this -> pref.len && this -> pref.val == other.pref.val) {
                res.pref.len += other.pref.len;
            }
            res.suf = other.suf;
            if(other.len == other.suf.len && this -> suf.val == other.suf.val) {
                res.suf.len += this -> suf.len;
            }
            if(Max_self(res.sub.len, this -> sub.len)) res.sub = this -> sub;
            if(Max_self(res.sub.len, other.sub.len)) res.sub = other.sub;
            ll len_pref = min(this -> len - 1, this -> suf.len);
            if(Max_self(res.sub.len, len_pref)) res.sub.val = this -> suf.val;
            ll len_suf = min(other.len - 1, other.pref.len);
            if(Max_self(res.sub.len, len_suf)) res.sub.val = other.pref.val;
            if(this -> suf.val == other.pref.val && Max_self(res.sub.len, len_pref + len_suf)) {
                res.sub.val = this -> suf.val;
            }
            res.len = this -> len + other.len;
            return res;
        }
    };

    Node tree[N << 2];
    ll diff[N];

    void make_first(ll node, ll l, ll r, ll* value) {
        if(l == r) {
            tree[node] = Node(value[l], 1);
            return;
        }
        ll mid = (l + r) >> 1;
        make_first(node << 1, l, mid, value);
        make_first(node << 1 | 1, mid + 1, r, value);
        tree[node] = tree[node << 1] + tree[node << 1 | 1];
    }

    void update(ll node, ll l, ll r, ll idx, ll val) {
        if(l == r) {
            tree[node] = Node(val, 1);
            return;
        }
        ll mid = (l + r) >> 1;
        if(idx <= mid) update(node << 1, l, mid, idx, val);
        else update(node << 1 | 1, mid + 1, r, idx, val);
        tree[node] = tree[node << 1] + tree[node << 1 | 1];
    }

    Node query(ll node, ll l, ll r, ll L, ll R) {
//        assert(L <= R && l <= r);
        if(l > r || L > R) assert(false);
        if(L <= l && r <= R) return tree[node];
        ll mid = (l + r) >> 1;
        if(R <= mid) return query(node << 1, l, mid, L, R);
        if(L > mid) return query(node << 1 | 1, mid + 1, r, L, R);
        return query(node << 1, l, mid, L, R) + query(node << 1 | 1, mid + 1, r, L, R);
    }

    void solve() {
        for(ll i = 1; i <= n; ++ i) diff[i] = a[i] - a[i - 1];
        make_first(1, 1, n, diff);
        for(ll i = 1; i <= q; ++ i) {
            const auto& psy = qq[i];
            if(psy.type <= 2) {
                ll idx = psy.l;
                if(psy.type == 2) a[idx] = psy.s;
                else a[idx] += psy.s;
                diff[idx] = a[idx] - a[idx - 1];
                update(1, 1, n, idx, diff[idx]);
            }
            else {
                ll res = 0;
                Node tmp = query(1, 1, n, psy.l, psy.r);
                Max_self(res, tmp.pref.len);
    //            cout << res << '\n';
                Max_self(res, tmp.sub.len + 1);
    //            cout << res << '\n';
                Max_self(res, tmp.suf.len + 1);
    //            cout << res << '\n';
                Min_self(res, psy.r - psy.l + 1);
                cout << res << '\n';
            }
        }
    }
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen("Progression.inp", "r")) {
        freopen("Progression.inp", "r", stdin);
        freopen("Progression.out", "w", stdout);
    }
    cin >> n >> q;
    for(ll i = 1; i <= n; ++ i) cin >> a[i];
    for(ll i = 1; i <= q; ++ i) cin >> qq[i];
    if(sub1::check()) {
        sub1::solve();
        return 0;
    }
    if(sub3::check()) {
        sub3::solve();
        return 0;
    }
    if(sub4::check()) {
        sub4::solve();
        return 0;
    }
    sub2::solve();
    return 0;
}

/// Code by vuavisao

Compilation message

Progression.cpp: In function 'int32_t main()':
Progression.cpp:299:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  299 |         freopen("Progression.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Progression.cpp:300:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  300 |         freopen("Progression.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 146480 KB Output is correct
2 Correct 127 ms 143820 KB Output is correct
3 Correct 128 ms 143824 KB Output is correct
4 Correct 133 ms 143832 KB Output is correct
5 Correct 129 ms 143844 KB Output is correct
6 Correct 130 ms 143920 KB Output is correct
7 Correct 138 ms 143832 KB Output is correct
8 Correct 72 ms 143456 KB Output is correct
9 Correct 61 ms 143508 KB Output is correct
10 Correct 60 ms 143504 KB Output is correct
11 Correct 179 ms 146560 KB Output is correct
12 Correct 168 ms 146380 KB Output is correct
13 Correct 168 ms 146720 KB Output is correct
14 Correct 206 ms 146888 KB Output is correct
15 Correct 174 ms 146756 KB Output is correct
16 Correct 172 ms 146408 KB Output is correct
17 Correct 210 ms 146432 KB Output is correct
18 Correct 179 ms 146440 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 143492 KB Output is correct
2 Correct 75 ms 143460 KB Output is correct
3 Correct 68 ms 143476 KB Output is correct
4 Correct 67 ms 143564 KB Output is correct
5 Correct 73 ms 143568 KB Output is correct
6 Correct 62 ms 143564 KB Output is correct
7 Correct 61 ms 143512 KB Output is correct
8 Correct 58 ms 143500 KB Output is correct
9 Correct 60 ms 143524 KB Output is correct
10 Correct 64 ms 143508 KB Output is correct
11 Correct 72 ms 143552 KB Output is correct
12 Correct 81 ms 143568 KB Output is correct
13 Correct 73 ms 143584 KB Output is correct
14 Correct 73 ms 143532 KB Output is correct
15 Correct 80 ms 143500 KB Output is correct
16 Correct 88 ms 143564 KB Output is correct
17 Correct 78 ms 143456 KB Output is correct
18 Correct 79 ms 143576 KB Output is correct
19 Correct 72 ms 143512 KB Output is correct
20 Correct 73 ms 143528 KB Output is correct
21 Correct 69 ms 143576 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 149224 KB Output is correct
2 Correct 131 ms 144140 KB Output is correct
3 Correct 151 ms 144196 KB Output is correct
4 Correct 135 ms 144084 KB Output is correct
5 Correct 138 ms 144216 KB Output is correct
6 Correct 149 ms 144192 KB Output is correct
7 Correct 140 ms 144184 KB Output is correct
8 Correct 59 ms 143496 KB Output is correct
9 Correct 62 ms 143472 KB Output is correct
10 Correct 75 ms 143568 KB Output is correct
11 Correct 272 ms 149044 KB Output is correct
12 Correct 239 ms 149288 KB Output is correct
13 Correct 272 ms 149068 KB Output is correct
14 Correct 264 ms 148940 KB Output is correct
15 Correct 249 ms 149240 KB Output is correct
16 Correct 293 ms 149532 KB Output is correct
17 Correct 273 ms 149836 KB Output is correct
18 Correct 284 ms 149680 KB Output is correct
19 Correct 244 ms 148964 KB Output is correct
20 Correct 247 ms 148948 KB Output is correct
21 Correct 254 ms 148940 KB Output is correct

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 397 ms 148544 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 149224 KB Output is correct
2 Correct 131 ms 144140 KB Output is correct
3 Correct 151 ms 144196 KB Output is correct
4 Correct 135 ms 144084 KB Output is correct
5 Correct 138 ms 144216 KB Output is correct
6 Correct 149 ms 144192 KB Output is correct
7 Correct 140 ms 144184 KB Output is correct
8 Correct 59 ms 143496 KB Output is correct
9 Correct 62 ms 143472 KB Output is correct
10 Correct 75 ms 143568 KB Output is correct
11 Correct 272 ms 149044 KB Output is correct
12 Correct 239 ms 149288 KB Output is correct
13 Correct 272 ms 149068 KB Output is correct
14 Correct 264 ms 148940 KB Output is correct
15 Correct 249 ms 149240 KB Output is correct
16 Correct 293 ms 149532 KB Output is correct
17 Correct 273 ms 149836 KB Output is correct
18 Correct 284 ms 149680 KB Output is correct
19 Correct 244 ms 148964 KB Output is correct
20 Correct 247 ms 148948 KB Output is correct
21 Correct 254 ms 148940 KB Output is correct
22 Execution timed out 3062 ms 146452 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 146480 KB Output is correct
2 Correct 127 ms 143820 KB Output is correct
3 Correct 128 ms 143824 KB Output is correct
4 Correct 133 ms 143832 KB Output is correct
5 Correct 129 ms 143844 KB Output is correct
6 Correct 130 ms 143920 KB Output is correct
7 Correct 138 ms 143832 KB Output is correct
8 Correct 72 ms 143456 KB Output is correct
9 Correct 61 ms 143508 KB Output is correct
10 Correct 60 ms 143504 KB Output is correct
11 Correct 179 ms 146560 KB Output is correct
12 Correct 168 ms 146380 KB Output is correct
13 Correct 168 ms 146720 KB Output is correct
14 Correct 206 ms 146888 KB Output is correct
15 Correct 174 ms 146756 KB Output is correct
16 Correct 172 ms 146408 KB Output is correct
17 Correct 210 ms 146432 KB Output is correct
18 Correct 179 ms 146440 KB Output is correct
19 Correct 65 ms 143492 KB Output is correct
20 Correct 75 ms 143460 KB Output is correct
21 Correct 68 ms 143476 KB Output is correct
22 Correct 67 ms 143564 KB Output is correct
23 Correct 73 ms 143568 KB Output is correct
24 Correct 62 ms 143564 KB Output is correct
25 Correct 61 ms 143512 KB Output is correct
26 Correct 58 ms 143500 KB Output is correct
27 Correct 60 ms 143524 KB Output is correct
28 Correct 64 ms 143508 KB Output is correct
29 Correct 72 ms 143552 KB Output is correct
30 Correct 81 ms 143568 KB Output is correct
31 Correct 73 ms 143584 KB Output is correct
32 Correct 73 ms 143532 KB Output is correct
33 Correct 80 ms 143500 KB Output is correct
34 Correct 88 ms 143564 KB Output is correct
35 Correct 78 ms 143456 KB Output is correct
36 Correct 79 ms 143576 KB Output is correct
37 Correct 72 ms 143512 KB Output is correct
38 Correct 73 ms 143528 KB Output is correct
39 Correct 69 ms 143576 KB Output is correct
40 Correct 288 ms 149224 KB Output is correct
41 Correct 131 ms 144140 KB Output is correct
42 Correct 151 ms 144196 KB Output is correct
43 Correct 135 ms 144084 KB Output is correct
44 Correct 138 ms 144216 KB Output is correct
45 Correct 149 ms 144192 KB Output is correct
46 Correct 140 ms 144184 KB Output is correct
47 Correct 59 ms 143496 KB Output is correct
48 Correct 62 ms 143472 KB Output is correct
49 Correct 75 ms 143568 KB Output is correct
50 Correct 272 ms 149044 KB Output is correct
51 Correct 239 ms 149288 KB Output is correct
52 Correct 272 ms 149068 KB Output is correct
53 Correct 264 ms 148940 KB Output is correct
54 Correct 249 ms 149240 KB Output is correct
55 Correct 293 ms 149532 KB Output is correct
56 Correct 273 ms 149836 KB Output is correct
57 Correct 284 ms 149680 KB Output is correct
58 Correct 244 ms 148964 KB Output is correct
59 Correct 247 ms 148948 KB Output is correct
60 Correct 254 ms 148940 KB Output is correct
61 Incorrect 397 ms 148544 KB Output isn't correct
62 Halted 0 ms 0 KB -