oj.uz

Submission #682170

# Submission time Handle Problem Language Result Execution time Memory
682170 2023-01-16T03:11:49 Z vuavisao Progression (NOI20_progression) C++14
24 / 100
 3000 ms 83532 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;
            if(Max_self(res.sub.len, this -> suf.len)) res.sub = this -> suf;
            if(Max_self(res.sub.len, other.pref.len)) res.sub = other.pref;
            if(this -> suf.val == other.pref.val && Max_self(res.sub.len, this -> suf.len + other.pref.len)) {
                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) {
        if(l > r || L > R || l > R || L > r) return Node(- INF, 0);
        if(L <= l && r <= R) return tree[node];
        ll mid = (l + r) >> 1;
        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];
            Node tmp = query(1, 1, n, psy.l, psy.r);
            ll res = 0;
            Max_self(res, tmp.pref.len);
            Max_self(res, tmp.sub.len + 1);
            Max_self(res, tmp.suf.len + 1);
            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;
    }
    sub2::solve();
    return 0;
}

/// Code by vuavisao

Compilation message

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

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 80756 KB Output is correct
2 Correct 110 ms 78064 KB Output is correct
3 Correct 96 ms 78068 KB Output is correct
4 Correct 96 ms 78004 KB Output is correct
5 Correct 124 ms 78072 KB Output is correct
6 Correct 101 ms 78100 KB Output is correct
7 Correct 96 ms 78076 KB Output is correct
8 Correct 30 ms 77812 KB Output is correct
9 Correct 30 ms 77808 KB Output is correct
10 Correct 31 ms 77788 KB Output is correct
11 Correct 179 ms 80724 KB Output is correct
12 Correct 136 ms 80704 KB Output is correct
13 Correct 140 ms 80956 KB Output is correct
14 Correct 169 ms 80984 KB Output is correct
15 Correct 144 ms 80924 KB Output is correct
16 Correct 137 ms 80736 KB Output is correct
17 Correct 187 ms 80624 KB Output is correct
18 Correct 141 ms 80716 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 77740 KB Output is correct
2 Correct 31 ms 77780 KB Output is correct
3 Correct 31 ms 77840 KB Output is correct
4 Correct 32 ms 77824 KB Output is correct
5 Correct 32 ms 77780 KB Output is correct
6 Correct 35 ms 77760 KB Output is correct
7 Correct 37 ms 77772 KB Output is correct
8 Correct 33 ms 77772 KB Output is correct
9 Correct 31 ms 77760 KB Output is correct
10 Correct 31 ms 77832 KB Output is correct
11 Correct 32 ms 77824 KB Output is correct
12 Correct 31 ms 77780 KB Output is correct
13 Correct 31 ms 77772 KB Output is correct
14 Correct 31 ms 77788 KB Output is correct
15 Correct 35 ms 77916 KB Output is correct
16 Correct 33 ms 77752 KB Output is correct
17 Correct 33 ms 77852 KB Output is correct
18 Correct 32 ms 77772 KB Output is correct
19 Correct 33 ms 77724 KB Output is correct
20 Correct 35 ms 77772 KB Output is correct
21 Correct 35 ms 77720 KB Output is correct

Subtask #3
0 / 35.0

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

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 80488 KB Output is correct
2 Correct 102 ms 77900 KB Output is correct
3 Correct 117 ms 78000 KB Output is correct
4 Correct 102 ms 77900 KB Output is correct
5 Correct 103 ms 77968 KB Output is correct
6 Correct 104 ms 78008 KB Output is correct
7 Correct 102 ms 78040 KB Output is correct
8 Correct 31 ms 77772 KB Output is correct
9 Correct 31 ms 77772 KB Output is correct
10 Correct 31 ms 77776 KB Output is correct
11 Execution timed out 3085 ms 80172 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

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

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 80756 KB Output is correct
2 Correct 110 ms 78064 KB Output is correct
3 Correct 96 ms 78068 KB Output is correct
4 Correct 96 ms 78004 KB Output is correct
5 Correct 124 ms 78072 KB Output is correct
6 Correct 101 ms 78100 KB Output is correct
7 Correct 96 ms 78076 KB Output is correct
8 Correct 30 ms 77812 KB Output is correct
9 Correct 30 ms 77808 KB Output is correct
10 Correct 31 ms 77788 KB Output is correct
11 Correct 179 ms 80724 KB Output is correct
12 Correct 136 ms 80704 KB Output is correct
13 Correct 140 ms 80956 KB Output is correct
14 Correct 169 ms 80984 KB Output is correct
15 Correct 144 ms 80924 KB Output is correct
16 Correct 137 ms 80736 KB Output is correct
17 Correct 187 ms 80624 KB Output is correct
18 Correct 141 ms 80716 KB Output is correct
19 Correct 34 ms 77740 KB Output is correct
20 Correct 31 ms 77780 KB Output is correct
21 Correct 31 ms 77840 KB Output is correct
22 Correct 32 ms 77824 KB Output is correct
23 Correct 32 ms 77780 KB Output is correct
24 Correct 35 ms 77760 KB Output is correct
25 Correct 37 ms 77772 KB Output is correct
26 Correct 33 ms 77772 KB Output is correct
27 Correct 31 ms 77760 KB Output is correct
28 Correct 31 ms 77832 KB Output is correct
29 Correct 32 ms 77824 KB Output is correct
30 Correct 31 ms 77780 KB Output is correct
31 Correct 31 ms 77772 KB Output is correct
32 Correct 31 ms 77788 KB Output is correct
33 Correct 35 ms 77916 KB Output is correct
34 Correct 33 ms 77752 KB Output is correct
35 Correct 33 ms 77852 KB Output is correct
36 Correct 32 ms 77772 KB Output is correct
37 Correct 33 ms 77724 KB Output is correct
38 Correct 35 ms 77772 KB Output is correct
39 Correct 35 ms 77720 KB Output is correct
40 Incorrect 290 ms 83532 KB Output isn't correct
41 Halted 0 ms 0 KB -