oj.uz

답안 #682179

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
682179 2023-01-16T04:00:07 Z vuavisao Progression (NOI20_progression) C++14
24 / 100
 3000 ms 83476 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;
            int len_pref = min(this -> len - 1, this -> suf.len);
            if(Max_self(res.sub.len, len_pref)) res.sub.val = this -> suf.val;
            int 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) {
        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];
            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;
    }
    sub2::solve();
    return 0;
}

/// Code by vuavisao

Compilation message

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

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 80796 KB Output is correct
2 Correct 97 ms 78028 KB Output is correct
3 Correct 99 ms 78068 KB Output is correct
4 Correct 103 ms 78048 KB Output is correct
5 Correct 100 ms 78064 KB Output is correct
6 Correct 101 ms 78080 KB Output is correct
7 Correct 104 ms 78156 KB Output is correct
8 Correct 29 ms 77756 KB Output is correct
9 Correct 30 ms 77804 KB Output is correct
10 Correct 30 ms 77732 KB Output is correct
11 Correct 134 ms 80696 KB Output is correct
12 Correct 147 ms 80664 KB Output is correct
13 Correct 145 ms 80972 KB Output is correct
14 Correct 135 ms 80928 KB Output is correct
15 Correct 135 ms 80916 KB Output is correct
16 Correct 139 ms 80716 KB Output is correct
17 Correct 136 ms 80680 KB Output is correct
18 Correct 134 ms 80664 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 77772 KB Output is correct
2 Correct 36 ms 77772 KB Output is correct
3 Correct 33 ms 77780 KB Output is correct
4 Correct 32 ms 77808 KB Output is correct
5 Correct 30 ms 77732 KB Output is correct
6 Correct 31 ms 77700 KB Output is correct
7 Correct 31 ms 77776 KB Output is correct
8 Correct 30 ms 77824 KB Output is correct
9 Correct 30 ms 77808 KB Output is correct
10 Correct 31 ms 77768 KB Output is correct
11 Correct 32 ms 77776 KB Output is correct
12 Correct 35 ms 77780 KB Output is correct
13 Correct 33 ms 77780 KB Output is correct
14 Correct 32 ms 77756 KB Output is correct
15 Correct 31 ms 77808 KB Output is correct
16 Correct 31 ms 77824 KB Output is correct
17 Correct 32 ms 77720 KB Output is correct
18 Correct 33 ms 77720 KB Output is correct
19 Correct 32 ms 77772 KB Output is correct
20 Correct 32 ms 77784 KB Output is correct
21 Correct 31 ms 77744 KB Output is correct

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 276 ms 83476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 335 ms 80404 KB Output is correct
2 Correct 101 ms 77944 KB Output is correct
3 Correct 118 ms 77900 KB Output is correct
4 Correct 115 ms 77936 KB Output is correct
5 Correct 127 ms 77944 KB Output is correct
6 Correct 110 ms 78012 KB Output is correct
7 Correct 112 ms 77992 KB Output is correct
8 Correct 34 ms 77700 KB Output is correct
9 Correct 36 ms 77780 KB Output is correct
10 Correct 34 ms 77812 KB Output is correct
11 Execution timed out 3073 ms 80096 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 276 ms 83476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 139 ms 80796 KB Output is correct
2 Correct 97 ms 78028 KB Output is correct
3 Correct 99 ms 78068 KB Output is correct
4 Correct 103 ms 78048 KB Output is correct
5 Correct 100 ms 78064 KB Output is correct
6 Correct 101 ms 78080 KB Output is correct
7 Correct 104 ms 78156 KB Output is correct
8 Correct 29 ms 77756 KB Output is correct
9 Correct 30 ms 77804 KB Output is correct
10 Correct 30 ms 77732 KB Output is correct
11 Correct 134 ms 80696 KB Output is correct
12 Correct 147 ms 80664 KB Output is correct
13 Correct 145 ms 80972 KB Output is correct
14 Correct 135 ms 80928 KB Output is correct
15 Correct 135 ms 80916 KB Output is correct
16 Correct 139 ms 80716 KB Output is correct
17 Correct 136 ms 80680 KB Output is correct
18 Correct 134 ms 80664 KB Output is correct
19 Correct 31 ms 77772 KB Output is correct
20 Correct 36 ms 77772 KB Output is correct
21 Correct 33 ms 77780 KB Output is correct
22 Correct 32 ms 77808 KB Output is correct
23 Correct 30 ms 77732 KB Output is correct
24 Correct 31 ms 77700 KB Output is correct
25 Correct 31 ms 77776 KB Output is correct
26 Correct 30 ms 77824 KB Output is correct
27 Correct 30 ms 77808 KB Output is correct
28 Correct 31 ms 77768 KB Output is correct
29 Correct 32 ms 77776 KB Output is correct
30 Correct 35 ms 77780 KB Output is correct
31 Correct 33 ms 77780 KB Output is correct
32 Correct 32 ms 77756 KB Output is correct
33 Correct 31 ms 77808 KB Output is correct
34 Correct 31 ms 77824 KB Output is correct
35 Correct 32 ms 77720 KB Output is correct
36 Correct 33 ms 77720 KB Output is correct
37 Correct 32 ms 77772 KB Output is correct
38 Correct 32 ms 77784 KB Output is correct
39 Correct 31 ms 77744 KB Output is correct
40 Incorrect 276 ms 83476 KB Output isn't correct
41 Halted 0 ms 0 KB -