oj.uz

Submission #892579

# Submission time Handle Problem Language Result Execution time Memory
892579 2023-12-25T14:19:24 Z quochuy147 Financial Report (JOI21_financial) C++14
100 / 100
 711 ms 49988 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define all(x) (x).begin() , (x).end()
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define file "name"
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}

const int inf = 1e9 + 5;
const ll linf = 1e17;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int LOG = 20;

int n, d, res;
int a[N], f[N], lim[N];
int rmq[N][LOG + 5], lg[N];
pii b[N];
set <int> s;
map <int, int> x;
vector <int> pos[N];

void inp()
{
    cin >> n >> d;
    for(int i = 1; i <= n; ++i) cin >> a[i];
}

namespace sub4 {
    void prepare() {
        for(int i = 2; i <= n; ++i) lg[i] = lg[i / 2] + 1;

        for(int i = 1; i <= n; ++i) rmq[i][0] = a[i];
        for(int j = 1; j <= LOG; ++j)
            for(int i = 1; i + MASK(j) - 1 <= n; ++i) rmq[i][j] = max(rmq[i][j - 1], rmq[i + MASK(j - 1)][j - 1]);
    }

    int get(int l, int r) {
        int k = lg[r - l + 1];
        return max(rmq[l][k], rmq[r - MASK(k) + 1][k]);
    }

    void solve() {
        prepare();
        for(int i = n; i >= 1; --i) {
            int l = i + 1, r = n, id = n + 1;
            while(l <= r) {
                int m = (l + r) >> 1;
                if(get(i, m) > a[i]) {
                    id = m;
                    r = m - 1;
                }
                else l = m + 1;
            }
            f[i] = f[id] + 1;
            maximize(res, f[i]);
        }
        cout << res;
    }
}

namespace sub5 {
    int x[N];
    void solve() {
        for(int i = 1; i <= n; ++i) x[i] = inf;
        x[0] = -inf;
        for(int i = 1; i <= n; ++i) {
            int l = 1, r = n, id = 0;
            while(l <= r) {
                int m = (l + r) >> 1;
                if(x[m] >= a[i]) {
                    id = m;
                    r = m - 1;
                }
                else l = m + 1;
            }
            x[id] = a[i];
            maximize(res, id);
        }
        cout << res;
    }
}

namespace sub3 {
    void solve() {
        a[0] = -1;
        for(int i = 1; i <= n; ++i) f[i] = 1;
        for(int i = 1; i <= n; ++i) {
            int id = i + d;
            maximize(res, f[i]);
            for(int j = i + 1; j <= n; ++j) {
                if(a[j] <= a[i]) {
                    id = j + d;
                    continue;
                }
                maximize(f[j], f[i] + 1);
                if(j >= id) break;
            }
        }
        cout << res;
    }
}

struct segtree {
    int st[4 * N];

    segtree() {}

    void update(int id, int l, int r, int i, int v) {
        if(i < l || r < i) return ;
        if(l == r) return void(st[id] = v);
        int m = (l + r) >> 1;
        update(id << 1, l, m, i, v);
        update(id << 1 | 1, m + 1, r, i, v);
        st[id] = max(st[id << 1], st[id << 1 | 1]);
    }

    int walk_left(int id, int l, int r, int v) {
        if(r < v || st[id] == 0) return n + 1;
        if(l == r) return l;
        int m = (l + r) >> 1;
        int res = walk_left(id << 1, l, m, v);
        if(res == n + 1) res = walk_left(id << 1 | 1, m + 1, r, v);
        return res;
    }

    int walk_right(int id, int l, int r, int v) {
        if(v < l || st[id] == 0) return 0;
        if(l == r) return l;
        int m = (l + r) >> 1;
        int res = walk_right(id << 1 | 1, m + 1, r, v);
        if(!res) res = walk_right(id << 1, l, m, v);
        return res;
    }

    int get(int id, int l, int r, int u, int v) {
        if(v < l || r < u) return 0;
        if(l >= u && r <= v) return st[id];
        int m = (l + r) >> 1;
        return max(get(id << 1, l, m, u, v), get(id << 1 | 1, m + 1, r, u, v));
    }

} st[2];

bool cmp(const pii &a, const pii &b) {
    if(a.fi == b.fi) return a.se > b.se;
    return a.fi < b.fi;
}

namespace sub6 {
    void solve() {
        for(int i = 1; i <= n; ++i) b[i] = mp(a[i], i);
        sort(b + 1, b + n + 1);
        s.insert(1);
        for(int i = 1; i <= n; ++i) {
            int id = b[i].se;
            st[0].update(1, 1, n, id, 1);
            int l = st[0].walk_right(1, 1, n, id - 1), r = st[0].walk_left(1, 1, n, id + 1);
            if(s.find(l) != s.end()) s.erase(s.find(l));
            if(id - l > d) s.insert(l);
            if(r - id > d) s.insert(id);
            auto it = s.lower_bound(id);
            if(it == s.end()) lim[id] = n;
            else lim[id] = min(n, (*it) + d);
        }

        for(int i = 1; i <= n; ++i) {
            for(int p : pos[i]) st[1].update(1, 1, n, p, 0);
            int id = lower_bound(b + 1, b + n + 1, mp(a[i], 0)) - b;
            f[i] = st[1].get(1, 1, n, 1, id - 1) + 1;
            maximize(f[i], st[1].get(1, 1, n, id, id + x[a[i]]));
            id += x[a[i]];
            x[a[i]]++;
            st[1].update(1, 1, n, id, f[i]);
            pos[lim[i] + 1].pb(id);
            maximize(res, f[i]);
        }
        cout << res;
    }
}

void solve()
{
//    if(n <= 7000) return void(sub3::solve());
    if(d == 1) return void(sub4::solve());
//    if(d == n) return void(sub5::solve());
    sub6::solve();
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
	// freopen(file".inp" , "r" , stdin);
	// freopen(file".ans" , "w" , stdout);
    inp();
    solve();
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12736 KB Output is correct
3 Correct 2 ms 12888 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12684 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12632 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 3 ms 12632 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 2 ms 12780 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12736 KB Output is correct
3 Correct 2 ms 12888 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12684 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12632 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 3 ms 12632 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 2 ms 12780 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12636 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12636 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12632 KB Output is correct
35 Correct 2 ms 12632 KB Output is correct
36 Correct 3 ms 12736 KB Output is correct
37 Correct 2 ms 12636 KB Output is correct
38 Correct 2 ms 12636 KB Output is correct
39 Correct 2 ms 12636 KB Output is correct
40 Correct 2 ms 12636 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12736 KB Output is correct
3 Correct 2 ms 12888 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12684 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12632 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 3 ms 12632 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 2 ms 12780 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12636 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12636 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12632 KB Output is correct
35 Correct 2 ms 12632 KB Output is correct
36 Correct 3 ms 12736 KB Output is correct
37 Correct 2 ms 12636 KB Output is correct
38 Correct 2 ms 12636 KB Output is correct
39 Correct 2 ms 12636 KB Output is correct
40 Correct 2 ms 12636 KB Output is correct
41 Correct 3 ms 12888 KB Output is correct
42 Correct 12 ms 13148 KB Output is correct
43 Correct 7 ms 12768 KB Output is correct
44 Correct 9 ms 12888 KB Output is correct
45 Correct 9 ms 12892 KB Output is correct
46 Correct 10 ms 13096 KB Output is correct
47 Correct 13 ms 13248 KB Output is correct
48 Correct 11 ms 13144 KB Output is correct
49 Correct 11 ms 13148 KB Output is correct
50 Correct 10 ms 13144 KB Output is correct
51 Correct 3 ms 12636 KB Output is correct
52 Correct 11 ms 13148 KB Output is correct
53 Correct 8 ms 13148 KB Output is correct
54 Correct 9 ms 13232 KB Output is correct
55 Correct 9 ms 13144 KB Output is correct
56 Correct 10 ms 13092 KB Output is correct
57 Correct 10 ms 13148 KB Output is correct
58 Correct 7 ms 13148 KB Output is correct
59 Correct 7 ms 13244 KB Output is correct
60 Correct 8 ms 13148 KB Output is correct
61 Correct 8 ms 13148 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 42836 KB Output is correct
2 Correct 72 ms 42584 KB Output is correct
3 Correct 74 ms 42700 KB Output is correct
4 Correct 74 ms 42584 KB Output is correct
5 Correct 74 ms 42700 KB Output is correct
6 Correct 72 ms 42712 KB Output is correct
7 Correct 66 ms 42580 KB Output is correct
8 Correct 69 ms 42588 KB Output is correct
9 Correct 68 ms 42588 KB Output is correct
10 Correct 74 ms 42840 KB Output is correct
11 Correct 72 ms 42460 KB Output is correct
12 Correct 72 ms 42704 KB Output is correct
13 Correct 69 ms 42588 KB Output is correct
14 Correct 71 ms 42704 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 25260 KB Output is correct
2 Correct 267 ms 25660 KB Output is correct
3 Correct 405 ms 25960 KB Output is correct
4 Correct 546 ms 38844 KB Output is correct
5 Correct 448 ms 39136 KB Output is correct
6 Correct 589 ms 39108 KB Output is correct
7 Correct 282 ms 38848 KB Output is correct
8 Correct 274 ms 38784 KB Output is correct
9 Correct 280 ms 38844 KB Output is correct
10 Correct 415 ms 38804 KB Output is correct
11 Correct 519 ms 38772 KB Output is correct
12 Correct 462 ms 38940 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12736 KB Output is correct
3 Correct 2 ms 12888 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12684 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12632 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 3 ms 12632 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 2 ms 12780 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12636 KB Output is correct
29 Correct 2 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12636 KB Output is correct
32 Correct 2 ms 12636 KB Output is correct
33 Correct 2 ms 12636 KB Output is correct
34 Correct 2 ms 12632 KB Output is correct
35 Correct 2 ms 12632 KB Output is correct
36 Correct 3 ms 12736 KB Output is correct
37 Correct 2 ms 12636 KB Output is correct
38 Correct 2 ms 12636 KB Output is correct
39 Correct 2 ms 12636 KB Output is correct
40 Correct 2 ms 12636 KB Output is correct
41 Correct 3 ms 12888 KB Output is correct
42 Correct 12 ms 13148 KB Output is correct
43 Correct 7 ms 12768 KB Output is correct
44 Correct 9 ms 12888 KB Output is correct
45 Correct 9 ms 12892 KB Output is correct
46 Correct 10 ms 13096 KB Output is correct
47 Correct 13 ms 13248 KB Output is correct
48 Correct 11 ms 13144 KB Output is correct
49 Correct 11 ms 13148 KB Output is correct
50 Correct 10 ms 13144 KB Output is correct
51 Correct 3 ms 12636 KB Output is correct
52 Correct 11 ms 13148 KB Output is correct
53 Correct 8 ms 13148 KB Output is correct
54 Correct 9 ms 13232 KB Output is correct
55 Correct 9 ms 13144 KB Output is correct
56 Correct 10 ms 13092 KB Output is correct
57 Correct 10 ms 13148 KB Output is correct
58 Correct 7 ms 13148 KB Output is correct
59 Correct 7 ms 13244 KB Output is correct
60 Correct 8 ms 13148 KB Output is correct
61 Correct 8 ms 13148 KB Output is correct
62 Correct 68 ms 42836 KB Output is correct
63 Correct 72 ms 42584 KB Output is correct
64 Correct 74 ms 42700 KB Output is correct
65 Correct 74 ms 42584 KB Output is correct
66 Correct 74 ms 42700 KB Output is correct
67 Correct 72 ms 42712 KB Output is correct
68 Correct 66 ms 42580 KB Output is correct
69 Correct 69 ms 42588 KB Output is correct
70 Correct 68 ms 42588 KB Output is correct
71 Correct 74 ms 42840 KB Output is correct
72 Correct 72 ms 42460 KB Output is correct
73 Correct 72 ms 42704 KB Output is correct
74 Correct 69 ms 42588 KB Output is correct
75 Correct 71 ms 42704 KB Output is correct
76 Correct 153 ms 25260 KB Output is correct
77 Correct 267 ms 25660 KB Output is correct
78 Correct 405 ms 25960 KB Output is correct
79 Correct 546 ms 38844 KB Output is correct
80 Correct 448 ms 39136 KB Output is correct
81 Correct 589 ms 39108 KB Output is correct
82 Correct 282 ms 38848 KB Output is correct
83 Correct 274 ms 38784 KB Output is correct
84 Correct 280 ms 38844 KB Output is correct
85 Correct 415 ms 38804 KB Output is correct
86 Correct 519 ms 38772 KB Output is correct
87 Correct 462 ms 38940 KB Output is correct
88 Correct 556 ms 27476 KB Output is correct
89 Correct 711 ms 43352 KB Output is correct
90 Correct 524 ms 30868 KB Output is correct
91 Correct 577 ms 42636 KB Output is correct
92 Correct 252 ms 28652 KB Output is correct
93 Correct 412 ms 29132 KB Output is correct
94 Correct 576 ms 37564 KB Output is correct
95 Correct 619 ms 44916 KB Output is correct
96 Correct 623 ms 43276 KB Output is correct
97 Correct 635 ms 42100 KB Output is correct
98 Correct 567 ms 42688 KB Output is correct
99 Correct 564 ms 41660 KB Output is correct
100 Correct 528 ms 41712 KB Output is correct
101 Correct 342 ms 45140 KB Output is correct
102 Correct 353 ms 42876 KB Output is correct
103 Correct 361 ms 42168 KB Output is correct
104 Correct 411 ms 42672 KB Output is correct
105 Correct 477 ms 42024 KB Output is correct
106 Correct 373 ms 43836 KB Output is correct
107 Correct 424 ms 41668 KB Output is correct
108 Correct 535 ms 41664 KB Output is correct
109 Correct 515 ms 49988 KB Output is correct
110 Correct 567 ms 43204 KB Output is correct
111 Correct 534 ms 41836 KB Output is correct
112 Correct 394 ms 42980 KB Output is correct
113 Correct 544 ms 41780 KB Output is correct
114 Correct 566 ms 41656 KB Output is correct
115 Correct 309 ms 41800 KB Output is correct
116 Correct 299 ms 41688 KB Output is correct
117 Correct 345 ms 41740 KB Output is correct
118 Correct 332 ms 41664 KB Output is correct
119 Correct 399 ms 41924 KB Output is correct
120 Correct 393 ms 41660 KB Output is correct