oj.uz

Submission #698961

# Submission time Handle Problem Language Result Execution time Memory
698961 2023-02-15T03:09:31 Z vuavisao Progression (NOI20_progression) C++14
24 / 100
 483 ms 158076 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);
            ll len_suf = min(other.len - 1, other.pref.len);
            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);
            ll len_suf = min(other.len - 1, other.pref.len);
            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]);
                if(idx < n) {
                    ++ idx;
                    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: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.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Progression.cpp:301:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  301 |         freopen("Progression.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 154488 KB Output is correct
2 Correct 122 ms 146716 KB Output is correct
3 Correct 123 ms 146892 KB Output is correct
4 Correct 127 ms 146776 KB Output is correct
5 Correct 134 ms 146892 KB Output is correct
6 Correct 121 ms 146888 KB Output is correct
7 Correct 127 ms 146712 KB Output is correct
8 Correct 64 ms 143500 KB Output is correct
9 Correct 64 ms 143500 KB Output is correct
10 Correct 56 ms 143516 KB Output is correct
11 Correct 169 ms 154520 KB Output is correct
12 Correct 163 ms 154364 KB Output is correct
13 Correct 169 ms 154764 KB Output is correct
14 Correct 162 ms 154856 KB Output is correct
15 Correct 169 ms 154620 KB Output is correct
16 Correct 171 ms 154380 KB Output is correct
17 Correct 174 ms 154360 KB Output is correct
18 Correct 186 ms 154448 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 143564 KB Output is correct
2 Correct 57 ms 143512 KB Output is correct
3 Correct 64 ms 143564 KB Output is correct
4 Correct 67 ms 143584 KB Output is correct
5 Correct 59 ms 143564 KB Output is correct
6 Correct 56 ms 143552 KB Output is correct
7 Correct 58 ms 143556 KB Output is correct
8 Correct 58 ms 143588 KB Output is correct
9 Correct 57 ms 143588 KB Output is correct
10 Correct 60 ms 143568 KB Output is correct
11 Correct 56 ms 143528 KB Output is correct
12 Correct 58 ms 143492 KB Output is correct
13 Correct 64 ms 143608 KB Output is correct
14 Correct 57 ms 143560 KB Output is correct
15 Correct 56 ms 143556 KB Output is correct
16 Correct 60 ms 143564 KB Output is correct
17 Correct 57 ms 143536 KB Output is correct
18 Correct 58 ms 143588 KB Output is correct
19 Correct 62 ms 143556 KB Output is correct
20 Correct 59 ms 143468 KB Output is correct
21 Correct 60 ms 143576 KB Output is correct

Subtask #3
0 / 35.0

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

Subtask #4
0 / 11.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 154488 KB Output is correct
2 Correct 122 ms 146716 KB Output is correct
3 Correct 123 ms 146892 KB Output is correct
4 Correct 127 ms 146776 KB Output is correct
5 Correct 134 ms 146892 KB Output is correct
6 Correct 121 ms 146888 KB Output is correct
7 Correct 127 ms 146712 KB Output is correct
8 Correct 64 ms 143500 KB Output is correct
9 Correct 64 ms 143500 KB Output is correct
10 Correct 56 ms 143516 KB Output is correct
11 Correct 169 ms 154520 KB Output is correct
12 Correct 163 ms 154364 KB Output is correct
13 Correct 169 ms 154764 KB Output is correct
14 Correct 162 ms 154856 KB Output is correct
15 Correct 169 ms 154620 KB Output is correct
16 Correct 171 ms 154380 KB Output is correct
17 Correct 174 ms 154360 KB Output is correct
18 Correct 186 ms 154448 KB Output is correct
19 Correct 62 ms 143564 KB Output is correct
20 Correct 57 ms 143512 KB Output is correct
21 Correct 64 ms 143564 KB Output is correct
22 Correct 67 ms 143584 KB Output is correct
23 Correct 59 ms 143564 KB Output is correct
24 Correct 56 ms 143552 KB Output is correct
25 Correct 58 ms 143556 KB Output is correct
26 Correct 58 ms 143588 KB Output is correct
27 Correct 57 ms 143588 KB Output is correct
28 Correct 60 ms 143568 KB Output is correct
29 Correct 56 ms 143528 KB Output is correct
30 Correct 58 ms 143492 KB Output is correct
31 Correct 64 ms 143608 KB Output is correct
32 Correct 57 ms 143560 KB Output is correct
33 Correct 56 ms 143556 KB Output is correct
34 Correct 60 ms 143564 KB Output is correct
35 Correct 57 ms 143536 KB Output is correct
36 Correct 58 ms 143588 KB Output is correct
37 Correct 62 ms 143556 KB Output is correct
38 Correct 59 ms 143468 KB Output is correct
39 Correct 60 ms 143576 KB Output is correct
40 Incorrect 262 ms 155256 KB Output isn't correct
41 Halted 0 ms 0 KB -