oj.uz

Submission #837707

# Submission time Handle Problem Language Result Execution time Memory
837707 2023-08-25T14:23:11 Z GrindMachine Sequence (APIO23_sequence) C++17
100 / 100
 927 ms 74076 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/116491?#comment-1031309
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "sequence.h"

template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051

    /*=======================================================*/

    struct data {
        int mnpref,mxpref,mnsuff,mxsuff,sum;
        data(){
            mnpref = mxpref = mnsuff = mxsuff = sum = 0;
        }
    };

    data neutral = data();

    data merge(data &left, data &right) {
        data curr;

        curr.mnpref = min(left.mnpref,left.sum+right.mnpref);
        curr.mxpref = max(left.mxpref,left.sum+right.mxpref);
        curr.mnsuff = min(right.mnsuff,right.sum+left.mnsuff);
        curr.mxsuff = max(right.mxsuff,right.sum+left.mxsuff);
        curr.sum = left.sum+right.sum;

        return curr;
    }

    void create(int i, T v) {
        tr[i].mnpref = tr[i].mnsuff = min(v,0);
        tr[i].mxpref = tr[i].mxsuff = max(v,0);
        tr[i].sum = v;
    }

    void modify(int i, T v) {
        tr[i].mnpref = tr[i].mnsuff = min(v,0);
        tr[i].mxpref = tr[i].mxsuff = max(v,0);
        tr[i].sum = v;
    }

    /*=======================================================*/

    int n;
    vector<data> tr;

    segtree() {

    }

    segtree(int siz) {
        init(siz);
    }

    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }

    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    data query(int l, int r) {
        data resl = neutral, resr = neutral;

        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }

        return merge(resl, resr);
    }
};

int sequence(int n, std::vector<int> a) {
    a.insert(a.begin(),0);
    vector<int> pos[n+5];
    rep1(i,n) pos[a[i]].pb(i);

    // val >= x: st1[i] = 1, else -1
    // val > x: st2[i] = 1, else -1

    segtree<int> st1(n+5);
    rep1(i,n) st1.pupd(i,1);

    auto st2 = st1;

    int ans = 0;

    rep1(x,n){
        auto &p = pos[x];
        int siz = sz(p);

        trav(i,p){
            st2.pupd(i,-1);
        }

        int ptr = 0;

        rep(i,siz){
            while(ptr < siz){
                int l = p[i], r = p[ptr];

                int mx_sum = st1.query(1,l-1).mxsuff + st1.query(l,r).sum + st1.query(r+1,n).mxpref;
                int mn_sum = st2.query(1,l-1).mnsuff + st2.query(l,r).sum + st2.query(r+1,n).mnpref;

                if((ll)mx_sum*mn_sum <= 0){
                    ptr++;
                }
                else{
                    break;
                }
            }

            int cnt = ptr-i;
            amax(ans,cnt);
        }
    
        trav(i,p){
            st1.pupd(i,-1);
        }
    }

    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 548 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 405 ms 64936 KB Output is correct
3 Correct 424 ms 65016 KB Output is correct
4 Correct 453 ms 57596 KB Output is correct
5 Correct 422 ms 64036 KB Output is correct
6 Correct 398 ms 64076 KB Output is correct
7 Correct 408 ms 57508 KB Output is correct
8 Correct 449 ms 57720 KB Output is correct
9 Correct 406 ms 58156 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 477 ms 59924 KB Output is correct
3 Correct 499 ms 58472 KB Output is correct
4 Correct 481 ms 58464 KB Output is correct
5 Correct 459 ms 59808 KB Output is correct
6 Correct 490 ms 58432 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 620 ms 70704 KB Output is correct
2 Correct 563 ms 70820 KB Output is correct
3 Correct 634 ms 70180 KB Output is correct
4 Correct 592 ms 70180 KB Output is correct
5 Correct 545 ms 66844 KB Output is correct
6 Correct 562 ms 66840 KB Output is correct
7 Correct 508 ms 65636 KB Output is correct
8 Correct 476 ms 65324 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 548 KB Output is correct
23 Correct 92 ms 10664 KB Output is correct
24 Correct 88 ms 10648 KB Output is correct
25 Correct 93 ms 10648 KB Output is correct
26 Correct 99 ms 9624 KB Output is correct
27 Correct 110 ms 9752 KB Output is correct
28 Correct 105 ms 9624 KB Output is correct
29 Correct 75 ms 9368 KB Output is correct
30 Correct 85 ms 9496 KB Output is correct
31 Correct 56 ms 9500 KB Output is correct
32 Correct 57 ms 11544 KB Output is correct
33 Correct 84 ms 10392 KB Output is correct
34 Correct 84 ms 10436 KB Output is correct
35 Correct 84 ms 10392 KB Output is correct
36 Correct 90 ms 10424 KB Output is correct
37 Correct 93 ms 10448 KB Output is correct
38 Correct 100 ms 10480 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 2 ms 548 KB Output is correct
23 Correct 405 ms 64936 KB Output is correct
24 Correct 424 ms 65016 KB Output is correct
25 Correct 453 ms 57596 KB Output is correct
26 Correct 422 ms 64036 KB Output is correct
27 Correct 398 ms 64076 KB Output is correct
28 Correct 408 ms 57508 KB Output is correct
29 Correct 449 ms 57720 KB Output is correct
30 Correct 406 ms 58156 KB Output is correct
31 Correct 477 ms 59924 KB Output is correct
32 Correct 499 ms 58472 KB Output is correct
33 Correct 481 ms 58464 KB Output is correct
34 Correct 459 ms 59808 KB Output is correct
35 Correct 490 ms 58432 KB Output is correct
36 Correct 620 ms 70704 KB Output is correct
37 Correct 563 ms 70820 KB Output is correct
38 Correct 634 ms 70180 KB Output is correct
39 Correct 592 ms 70180 KB Output is correct
40 Correct 545 ms 66844 KB Output is correct
41 Correct 562 ms 66840 KB Output is correct
42 Correct 508 ms 65636 KB Output is correct
43 Correct 476 ms 65324 KB Output is correct
44 Correct 92 ms 10664 KB Output is correct
45 Correct 88 ms 10648 KB Output is correct
46 Correct 93 ms 10648 KB Output is correct
47 Correct 99 ms 9624 KB Output is correct
48 Correct 110 ms 9752 KB Output is correct
49 Correct 105 ms 9624 KB Output is correct
50 Correct 75 ms 9368 KB Output is correct
51 Correct 85 ms 9496 KB Output is correct
52 Correct 56 ms 9500 KB Output is correct
53 Correct 57 ms 11544 KB Output is correct
54 Correct 84 ms 10392 KB Output is correct
55 Correct 84 ms 10436 KB Output is correct
56 Correct 84 ms 10392 KB Output is correct
57 Correct 90 ms 10424 KB Output is correct
58 Correct 93 ms 10448 KB Output is correct
59 Correct 100 ms 10480 KB Output is correct
60 Correct 920 ms 68328 KB Output is correct
61 Correct 859 ms 68340 KB Output is correct
62 Correct 927 ms 68260 KB Output is correct
63 Correct 893 ms 60188 KB Output is correct
64 Correct 907 ms 60180 KB Output is correct
65 Correct 902 ms 60164 KB Output is correct
66 Correct 543 ms 58888 KB Output is correct
67 Correct 566 ms 59304 KB Output is correct
68 Correct 361 ms 62504 KB Output is correct
69 Correct 393 ms 74076 KB Output is correct
70 Correct 837 ms 67360 KB Output is correct
71 Correct 813 ms 67300 KB Output is correct
72 Correct 752 ms 66736 KB Output is correct
73 Correct 839 ms 67108 KB Output is correct
74 Correct 823 ms 66744 KB Output is correct
75 Correct 836 ms 67088 KB Output is correct