oj.uz

Submission #682189

# Submission time Handle Problem Language Result Execution time Memory
682189 2023-01-16T04:14:28 Z vuavisao Progression (NOI20_progression) C++14
70 / 100
 3000 ms 158388 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]);
                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:304:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  304 |         freopen("Progression.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Progression.cpp:305:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  305 |         freopen("Progression.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 146480 KB Output is correct
2 Correct 133 ms 143884 KB Output is correct
3 Correct 126 ms 143820 KB Output is correct
4 Correct 128 ms 143832 KB Output is correct
5 Correct 127 ms 143972 KB Output is correct
6 Correct 144 ms 143836 KB Output is correct
7 Correct 127 ms 143836 KB Output is correct
8 Correct 59 ms 143568 KB Output is correct
9 Correct 58 ms 143564 KB Output is correct
10 Correct 63 ms 143548 KB Output is correct
11 Correct 165 ms 146528 KB Output is correct
12 Correct 175 ms 146460 KB Output is correct
13 Correct 162 ms 146760 KB Output is correct
14 Correct 184 ms 146764 KB Output is correct
15 Correct 165 ms 146712 KB Output is correct
16 Correct 164 ms 146428 KB Output is correct
17 Correct 177 ms 146440 KB Output is correct
18 Correct 161 ms 146464 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 143576 KB Output is correct
2 Correct 65 ms 143580 KB Output is correct
3 Correct 60 ms 143496 KB Output is correct
4 Correct 60 ms 143564 KB Output is correct
5 Correct 59 ms 143512 KB Output is correct
6 Correct 59 ms 143588 KB Output is correct
7 Correct 63 ms 143484 KB Output is correct
8 Correct 62 ms 143528 KB Output is correct
9 Correct 58 ms 143560 KB Output is correct
10 Correct 60 ms 143544 KB Output is correct
11 Correct 58 ms 143536 KB Output is correct
12 Correct 62 ms 143556 KB Output is correct
13 Correct 73 ms 143588 KB Output is correct
14 Correct 64 ms 143564 KB Output is correct
15 Correct 60 ms 143496 KB Output is correct
16 Correct 59 ms 143484 KB Output is correct
17 Correct 59 ms 143544 KB Output is correct
18 Correct 59 ms 143536 KB Output is correct
19 Correct 59 ms 143564 KB Output is correct
20 Correct 62 ms 143528 KB Output is correct
21 Correct 72 ms 143512 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 149200 KB Output is correct
2 Correct 127 ms 144128 KB Output is correct
3 Correct 139 ms 144076 KB Output is correct
4 Correct 123 ms 144088 KB Output is correct
5 Correct 131 ms 144244 KB Output is correct
6 Correct 134 ms 144152 KB Output is correct
7 Correct 129 ms 144164 KB Output is correct
8 Correct 62 ms 143532 KB Output is correct
9 Correct 61 ms 143476 KB Output is correct
10 Correct 59 ms 143480 KB Output is correct
11 Correct 283 ms 149160 KB Output is correct
12 Correct 247 ms 149300 KB Output is correct
13 Correct 279 ms 148960 KB Output is correct
14 Correct 295 ms 148960 KB Output is correct
15 Correct 246 ms 149212 KB Output is correct
16 Correct 282 ms 149540 KB Output is correct
17 Correct 290 ms 149624 KB Output is correct
18 Correct 270 ms 149720 KB Output is correct
19 Correct 239 ms 148888 KB Output is correct
20 Correct 245 ms 148916 KB Output is correct
21 Correct 243 ms 148984 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 489 ms 148644 KB Output is correct
2 Correct 169 ms 146892 KB Output is correct
3 Correct 203 ms 146924 KB Output is correct
4 Correct 161 ms 146888 KB Output is correct
5 Correct 172 ms 146884 KB Output is correct
6 Correct 175 ms 146888 KB Output is correct
7 Correct 167 ms 146988 KB Output is correct
8 Correct 62 ms 143468 KB Output is correct
9 Correct 64 ms 143540 KB Output is correct
10 Correct 64 ms 143564 KB Output is correct
11 Correct 453 ms 154744 KB Output is correct
12 Correct 498 ms 158092 KB Output is correct
13 Correct 483 ms 155052 KB Output is correct
14 Correct 470 ms 154824 KB Output is correct
15 Correct 469 ms 158036 KB Output is correct
16 Correct 529 ms 158160 KB Output is correct
17 Correct 539 ms 158196 KB Output is correct
18 Correct 491 ms 158388 KB Output is correct
19 Correct 471 ms 158060 KB Output is correct
20 Correct 504 ms 158052 KB Output is correct
21 Correct 531 ms 158008 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 149200 KB Output is correct
2 Correct 127 ms 144128 KB Output is correct
3 Correct 139 ms 144076 KB Output is correct
4 Correct 123 ms 144088 KB Output is correct
5 Correct 131 ms 144244 KB Output is correct
6 Correct 134 ms 144152 KB Output is correct
7 Correct 129 ms 144164 KB Output is correct
8 Correct 62 ms 143532 KB Output is correct
9 Correct 61 ms 143476 KB Output is correct
10 Correct 59 ms 143480 KB Output is correct
11 Correct 283 ms 149160 KB Output is correct
12 Correct 247 ms 149300 KB Output is correct
13 Correct 279 ms 148960 KB Output is correct
14 Correct 295 ms 148960 KB Output is correct
15 Correct 246 ms 149212 KB Output is correct
16 Correct 282 ms 149540 KB Output is correct
17 Correct 290 ms 149624 KB Output is correct
18 Correct 270 ms 149720 KB Output is correct
19 Correct 239 ms 148888 KB Output is correct
20 Correct 245 ms 148916 KB Output is correct
21 Correct 243 ms 148984 KB Output is correct
22 Execution timed out 3092 ms 146300 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 146480 KB Output is correct
2 Correct 133 ms 143884 KB Output is correct
3 Correct 126 ms 143820 KB Output is correct
4 Correct 128 ms 143832 KB Output is correct
5 Correct 127 ms 143972 KB Output is correct
6 Correct 144 ms 143836 KB Output is correct
7 Correct 127 ms 143836 KB Output is correct
8 Correct 59 ms 143568 KB Output is correct
9 Correct 58 ms 143564 KB Output is correct
10 Correct 63 ms 143548 KB Output is correct
11 Correct 165 ms 146528 KB Output is correct
12 Correct 175 ms 146460 KB Output is correct
13 Correct 162 ms 146760 KB Output is correct
14 Correct 184 ms 146764 KB Output is correct
15 Correct 165 ms 146712 KB Output is correct
16 Correct 164 ms 146428 KB Output is correct
17 Correct 177 ms 146440 KB Output is correct
18 Correct 161 ms 146464 KB Output is correct
19 Correct 68 ms 143576 KB Output is correct
20 Correct 65 ms 143580 KB Output is correct
21 Correct 60 ms 143496 KB Output is correct
22 Correct 60 ms 143564 KB Output is correct
23 Correct 59 ms 143512 KB Output is correct
24 Correct 59 ms 143588 KB Output is correct
25 Correct 63 ms 143484 KB Output is correct
26 Correct 62 ms 143528 KB Output is correct
27 Correct 58 ms 143560 KB Output is correct
28 Correct 60 ms 143544 KB Output is correct
29 Correct 58 ms 143536 KB Output is correct
30 Correct 62 ms 143556 KB Output is correct
31 Correct 73 ms 143588 KB Output is correct
32 Correct 64 ms 143564 KB Output is correct
33 Correct 60 ms 143496 KB Output is correct
34 Correct 59 ms 143484 KB Output is correct
35 Correct 59 ms 143544 KB Output is correct
36 Correct 59 ms 143536 KB Output is correct
37 Correct 59 ms 143564 KB Output is correct
38 Correct 62 ms 143528 KB Output is correct
39 Correct 72 ms 143512 KB Output is correct
40 Correct 241 ms 149200 KB Output is correct
41 Correct 127 ms 144128 KB Output is correct
42 Correct 139 ms 144076 KB Output is correct
43 Correct 123 ms 144088 KB Output is correct
44 Correct 131 ms 144244 KB Output is correct
45 Correct 134 ms 144152 KB Output is correct
46 Correct 129 ms 144164 KB Output is correct
47 Correct 62 ms 143532 KB Output is correct
48 Correct 61 ms 143476 KB Output is correct
49 Correct 59 ms 143480 KB Output is correct
50 Correct 283 ms 149160 KB Output is correct
51 Correct 247 ms 149300 KB Output is correct
52 Correct 279 ms 148960 KB Output is correct
53 Correct 295 ms 148960 KB Output is correct
54 Correct 246 ms 149212 KB Output is correct
55 Correct 282 ms 149540 KB Output is correct
56 Correct 290 ms 149624 KB Output is correct
57 Correct 270 ms 149720 KB Output is correct
58 Correct 239 ms 148888 KB Output is correct
59 Correct 245 ms 148916 KB Output is correct
60 Correct 243 ms 148984 KB Output is correct
61 Correct 489 ms 148644 KB Output is correct
62 Correct 169 ms 146892 KB Output is correct
63 Correct 203 ms 146924 KB Output is correct
64 Correct 161 ms 146888 KB Output is correct
65 Correct 172 ms 146884 KB Output is correct
66 Correct 175 ms 146888 KB Output is correct
67 Correct 167 ms 146988 KB Output is correct
68 Correct 62 ms 143468 KB Output is correct
69 Correct 64 ms 143540 KB Output is correct
70 Correct 64 ms 143564 KB Output is correct
71 Correct 453 ms 154744 KB Output is correct
72 Correct 498 ms 158092 KB Output is correct
73 Correct 483 ms 155052 KB Output is correct
74 Correct 470 ms 154824 KB Output is correct
75 Correct 469 ms 158036 KB Output is correct
76 Correct 529 ms 158160 KB Output is correct
77 Correct 539 ms 158196 KB Output is correct
78 Correct 491 ms 158388 KB Output is correct
79 Correct 471 ms 158060 KB Output is correct
80 Correct 504 ms 158052 KB Output is correct
81 Correct 531 ms 158008 KB Output is correct
82 Execution timed out 3092 ms 146300 KB Time limit exceeded
83 Halted 0 ms 0 KB -