oj.uz

Submission #976034

# Submission time Handle Problem Language Result Execution time Memory
976034 2024-05-06T05:41:10 Z gaga999 Sequence (APIO23_sequence) C++17
100 / 100
 518 ms 59724 KB 
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef pair<llt, int> pli;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 5e5 + 5;
int n, ar[N];
vector<int> pl[N];

struct TR
{
    int lx, ln, rx, rn, sum;
    TR operator+(const TR &rh) const
    {
        TR cr;
        cr.sum = sum + rh.sum;
        cr.lx = max(lx, sum + rh.lx);
        cr.ln = min(ln, sum + rh.ln);
        cr.rx = max(rh.rx, rh.sum + rx);
        cr.rn = min(rh.rn, rh.sum + rn);
        return cr;
    }
    inline void ini(int v)
    {
        lx = max(0, v), rx = max(0, v);
        ln = min(0, v), rn = min(0, v);
        sum = v;
    }
} tr[N << 2], vv;
int ql, qr, qv;

#define L l, m, ls(id)
#define R m + 1, r, rs(id)
#define pul() tr[id] = tr[ls(id)] + tr[rs(id)]
void blt(int l, int r, int id)
{
    if (l == r)
    {
        tr[id].ini(1);
        return;
    }
    int m = (l + r) >> 1;
    blt(L), blt(R), pul();
}

void qy(int l, int r, int id)
{
    if (ql <= l && r <= qr)
    {
        vv = vv + tr[id];
        return;
    }
    int m = (l + r) >> 1;
    if (ql <= m)
        qy(L);
    if (qr > m)
        qy(R);
}

void cg(int l, int r, int id)
{
    if (ql <= l && r <= qr)
    {
        tr[id].ini(qv);
        return;
    }
    int m = (l + r) >> 1;
    if (ql <= m)
        cg(L);
    if (qr > m)
        cg(R);
    pul();
}

int sequence(int _n, vector<int> aa)
{
    n = _n;
    for (int i = 1; i <= n; i++)
        pl[ar[i] = aa[i - 1]].pb(i);
    int ans = 1;
    blt(1, n, 1);
    vector<int> sum, lx, rx, ln, rn;
    for (int p = 1; p <= n; p++)
    {
        int len = size(pl[p]);
        if (len > ans)
        {
            sum.resize(len);
            lx.resize(len);
            rx.resize(len);
            ln.resize(len);
            rn.resize(len);
            for (int i = 0; i < len; i++)
            {
                vv.ini(0);
                ql = 1, qr = pl[p][i];
                qy(1, n, 1);
                sum[i] = vv.sum - i - 1;
                lx[i] = vv.rx - 1;
                vv.ini(0);
                ql = pl[p][i], qr = n;
                qy(1, n, 1);
                rx[i] = vv.lx - 1;
            }
            for (int i : pl[p])
                ql = qr = i, qv = -1, cg(1, n, 1);
            for (int i = 0; i < len; i++)
            {
                vv.ini(0);
                ql = 1, qr = pl[p][i];
                qy(1, n, 1);
                ln[i] = vv.rn + 1;
                vv.ini(0);
                ql = pl[p][i], qr = n;
                qy(1, n, 1);
                rn[i] = vv.ln + 1;
            }
            auto ck = [&](int lm) -> bool
            {
                for (int r = lm - 1, l = 0; r < len; r++, l++)
                {
                    int cv = sum[r] - sum[l];
                    if (abs(cv) <= lm)
                        return 1;
                    if (cv < 0)
                    {
                        if (cv + lm + lx[l] + rx[r] >= 0)
                            return 1;
                    }
                    else
                    {
                        if (cv - lm + ln[l] + rn[r] <= 0)
                            return 1;
                    }
                }
                return 0;
            };
            int l = ans + 1, r = len;
            while (l <= r)
            {
                int m = (l + r) >> 1;
                if (ck(m))
                    l = m + 1, tmax(ans, m); // ans = m
                else
                    r = m - 1;
            }
        }
        else
            for (int i : pl[p])
                ql = qr = i, qv = -1, cg(1, n, 1);
    }
    return ans;
}

// signed main()
// {
//     int nn;
//     rd(nn);
//     vector<int> aa(nn);
//     for (int i = 0; i < nn; i++)
//         rd(aa[i]);
//     prt(sequence(nn, aa)), putchar('\n');
// }

Subtask #1
11.0 / 11.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 3 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14788 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14776 KB Output is correct
13 Correct 4 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 4 ms 14684 KB Output is correct
16 Correct 4 ms 14684 KB Output is correct
17 Correct 4 ms 14684 KB Output is correct
18 Correct 4 ms 14940 KB Output is correct
19 Correct 4 ms 14940 KB Output is correct
20 Correct 4 ms 14940 KB Output is correct
21 Correct 4 ms 14936 KB Output is correct
22 Correct 4 ms 14940 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 170 ms 50512 KB Output is correct
3 Correct 182 ms 50548 KB Output is correct
4 Correct 313 ms 45204 KB Output is correct
5 Correct 170 ms 49748 KB Output is correct
6 Correct 169 ms 49744 KB Output is correct
7 Correct 176 ms 43436 KB Output is correct
8 Correct 231 ms 43624 KB Output is correct
9 Correct 211 ms 46216 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 247 ms 48384 KB Output is correct
3 Correct 333 ms 47008 KB Output is correct
4 Correct 284 ms 46772 KB Output is correct
5 Correct 342 ms 49740 KB Output is correct
6 Correct 335 ms 47808 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 271 ms 56424 KB Output is correct
2 Correct 257 ms 56400 KB Output is correct
3 Correct 289 ms 55640 KB Output is correct
4 Correct 293 ms 55632 KB Output is correct
5 Correct 302 ms 52504 KB Output is correct
6 Correct 291 ms 52348 KB Output is correct
7 Correct 277 ms 51284 KB Output is correct
8 Correct 211 ms 51024 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 3 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14788 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14776 KB Output is correct
13 Correct 4 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 4 ms 14684 KB Output is correct
16 Correct 4 ms 14684 KB Output is correct
17 Correct 4 ms 14684 KB Output is correct
18 Correct 4 ms 14940 KB Output is correct
19 Correct 4 ms 14940 KB Output is correct
20 Correct 4 ms 14940 KB Output is correct
21 Correct 4 ms 14936 KB Output is correct
22 Correct 4 ms 14940 KB Output is correct
23 Correct 52 ms 23644 KB Output is correct
24 Correct 50 ms 23696 KB Output is correct
25 Correct 45 ms 23644 KB Output is correct
26 Correct 51 ms 22668 KB Output is correct
27 Correct 49 ms 22616 KB Output is correct
28 Correct 60 ms 22620 KB Output is correct
29 Correct 55 ms 22620 KB Output is correct
30 Correct 49 ms 22916 KB Output is correct
31 Correct 51 ms 24020 KB Output is correct
32 Correct 27 ms 24740 KB Output is correct
33 Correct 46 ms 23644 KB Output is correct
34 Correct 55 ms 23632 KB Output is correct
35 Correct 50 ms 23788 KB Output is correct
36 Correct 47 ms 23636 KB Output is correct
37 Correct 42 ms 23644 KB Output is correct
38 Correct 52 ms 23884 KB Output is correct

Subtask #7
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 3 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 3 ms 14684 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14788 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14776 KB Output is correct
13 Correct 4 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 4 ms 14684 KB Output is correct
16 Correct 4 ms 14684 KB Output is correct
17 Correct 4 ms 14684 KB Output is correct
18 Correct 4 ms 14940 KB Output is correct
19 Correct 4 ms 14940 KB Output is correct
20 Correct 4 ms 14940 KB Output is correct
21 Correct 4 ms 14936 KB Output is correct
22 Correct 4 ms 14940 KB Output is correct
23 Correct 170 ms 50512 KB Output is correct
24 Correct 182 ms 50548 KB Output is correct
25 Correct 313 ms 45204 KB Output is correct
26 Correct 170 ms 49748 KB Output is correct
27 Correct 169 ms 49744 KB Output is correct
28 Correct 176 ms 43436 KB Output is correct
29 Correct 231 ms 43624 KB Output is correct
30 Correct 211 ms 46216 KB Output is correct
31 Correct 247 ms 48384 KB Output is correct
32 Correct 333 ms 47008 KB Output is correct
33 Correct 284 ms 46772 KB Output is correct
34 Correct 342 ms 49740 KB Output is correct
35 Correct 335 ms 47808 KB Output is correct
36 Correct 271 ms 56424 KB Output is correct
37 Correct 257 ms 56400 KB Output is correct
38 Correct 289 ms 55640 KB Output is correct
39 Correct 293 ms 55632 KB Output is correct
40 Correct 302 ms 52504 KB Output is correct
41 Correct 291 ms 52348 KB Output is correct
42 Correct 277 ms 51284 KB Output is correct
43 Correct 211 ms 51024 KB Output is correct
44 Correct 52 ms 23644 KB Output is correct
45 Correct 50 ms 23696 KB Output is correct
46 Correct 45 ms 23644 KB Output is correct
47 Correct 51 ms 22668 KB Output is correct
48 Correct 49 ms 22616 KB Output is correct
49 Correct 60 ms 22620 KB Output is correct
50 Correct 55 ms 22620 KB Output is correct
51 Correct 49 ms 22916 KB Output is correct
52 Correct 51 ms 24020 KB Output is correct
53 Correct 27 ms 24740 KB Output is correct
54 Correct 46 ms 23644 KB Output is correct
55 Correct 55 ms 23632 KB Output is correct
56 Correct 50 ms 23788 KB Output is correct
57 Correct 47 ms 23636 KB Output is correct
58 Correct 42 ms 23644 KB Output is correct
59 Correct 52 ms 23884 KB Output is correct
60 Correct 466 ms 53996 KB Output is correct
61 Correct 384 ms 53988 KB Output is correct
62 Correct 430 ms 54008 KB Output is correct
63 Correct 466 ms 45904 KB Output is correct
64 Correct 511 ms 45868 KB Output is correct
65 Correct 518 ms 45648 KB Output is correct
66 Correct 352 ms 46428 KB Output is correct
67 Correct 267 ms 45916 KB Output is correct
68 Correct 317 ms 56084 KB Output is correct
69 Correct 178 ms 59724 KB Output is correct
70 Correct 395 ms 53976 KB Output is correct
71 Correct 441 ms 54224 KB Output is correct
72 Correct 392 ms 53964 KB Output is correct
73 Correct 391 ms 54160 KB Output is correct
74 Correct 360 ms 53984 KB Output is correct
75 Correct 394 ms 54096 KB Output is correct