oj.uz

Submission #448486

# Submission time Handle Problem Language Result Execution time Memory
448486 2021-07-30T09:02:45 Z nickyrio Financial Report (JOI21_financial) C++17
100 / 100
 487 ms 27208 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 3e5 + 100;

int a[N], f[N], IT[N << 2], perm[N], kount[N], rightMost[N], leftMost[N];

void Update(int k, int l, int r, int u, int v) {
    if (l == r) { IT[k] = v; return; }
    int m = l + r >> 1;
    if (u <= m) Update(k << 1, l, m, u, v);
    else Update(k << 1 | 1, m + 1, r, u, v);
    IT[k] = max(IT[k << 1], IT[k << 1 | 1]);
}

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

int root(int u) { return (kount[u] < 0 ? u : kount[u] = root(kount[u])); }
void Union(int u, int v) {
    // cerr << "Union" << u << ' ' << v << '\n';
    u = root(u), v = root(v);
    if (u == v) return;
    int t = kount[u] + kount[v];
    if (kount[u] > kount[v]) swap(u, v);
    kount[u] = t;
    kount[v] = u;
    rightMost[u] = max(rightMost[u], rightMost[v]);
}

int main() {
  	ios::sync_with_stdio(false); cin.tie(NULL);
    int n, d;
    cin >> n >> d;
    int ans = 0;
    vector<int> Rank;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        perm[i] = i;
        // Rank.push_back(a[i]);
    }
    // sort(Rank.begin(), Rank.end());
    // for (int i = 1; i <= n; ++i) cout << lower_bound(Rank.begin(), Rank.end(), a[i]) - Rank.begin() << ' ';
    sort(perm + 1, perm + n + 1, [](int x, int y) {
        return a[x] != a[y] ? a[x] < a[y] : x > y;
    });

    set<int> obtacles;
    obtacles.insert(0);
    for (int i = 1; i <= n; ++i) kount[i] = -1, rightMost[i] = i;
    for (int i = n; i > 0; --i) {
        int id = perm[i];
        leftMost[id] = *(--obtacles.lower_bound(id));
        // cerr << "ID = " << id << ' ' << leftMost[id] << '\n';
        if (id > 1  && a[id - 1] >= a[id]) Union(id - 1, id);
        if (id != n && a[id + 1] > a[id]) Union(id, id + 1);
        int r = root(id);
        if (-kount[r] >= d) {
            // cerr << "Enough D " << id << ' ' << -kount[r] << ' ' << rightMost[r] << '\n';
            obtacles.insert(rightMost[r]);
        }
    }
    for (int i = 1; i <= n; ++i) {
        int id = perm[i];
        int f = Query(1, 1, n, leftMost[id], id) + 1;
        // cerr << "At " << i << ' ' << id << ' ' << leftMost[id] << ' ' << f << '\n';
        ans = max(ans, f);
        Update(1, 1, n, id, f);
    }
    
    cout << ans << '\n';
}

Compilation message

Main.cpp: In function 'void Update(int, int, int, int, int)':
Main.cpp:11:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |     int m = l + r >> 1;
      |             ~~^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 332 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 6 ms 716 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 5 ms 588 KB Output is correct
44 Correct 4 ms 588 KB Output is correct
45 Correct 5 ms 588 KB Output is correct
46 Correct 4 ms 540 KB Output is correct
47 Correct 5 ms 588 KB Output is correct
48 Correct 5 ms 588 KB Output is correct
49 Correct 5 ms 588 KB Output is correct
50 Correct 4 ms 628 KB Output is correct
51 Correct 5 ms 716 KB Output is correct
52 Correct 5 ms 716 KB Output is correct
53 Correct 4 ms 588 KB Output is correct
54 Correct 4 ms 588 KB Output is correct
55 Correct 4 ms 588 KB Output is correct
56 Correct 4 ms 584 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 3 ms 588 KB Output is correct
59 Correct 4 ms 588 KB Output is correct
60 Correct 4 ms 588 KB Output is correct
61 Correct 4 ms 588 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 24584 KB Output is correct
2 Correct 279 ms 18436 KB Output is correct
3 Correct 387 ms 17716 KB Output is correct
4 Correct 430 ms 20416 KB Output is correct
5 Correct 331 ms 18172 KB Output is correct
6 Correct 429 ms 20204 KB Output is correct
7 Correct 164 ms 13124 KB Output is correct
8 Correct 272 ms 27208 KB Output is correct
9 Correct 205 ms 16980 KB Output is correct
10 Correct 249 ms 22052 KB Output is correct
11 Correct 324 ms 20164 KB Output is correct
12 Correct 337 ms 20164 KB Output is correct
13 Correct 281 ms 13124 KB Output is correct
14 Correct 487 ms 27032 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 10436 KB Output is correct
2 Correct 235 ms 10472 KB Output is correct
3 Correct 248 ms 10328 KB Output is correct
4 Correct 238 ms 10352 KB Output is correct
5 Correct 222 ms 10540 KB Output is correct
6 Correct 254 ms 10476 KB Output is correct
7 Correct 159 ms 10436 KB Output is correct
8 Correct 164 ms 10384 KB Output is correct
9 Correct 171 ms 10312 KB Output is correct
10 Correct 232 ms 10404 KB Output is correct
11 Correct 225 ms 10456 KB Output is correct
12 Correct 203 ms 10440 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 312 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 6 ms 716 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 5 ms 588 KB Output is correct
44 Correct 4 ms 588 KB Output is correct
45 Correct 5 ms 588 KB Output is correct
46 Correct 4 ms 540 KB Output is correct
47 Correct 5 ms 588 KB Output is correct
48 Correct 5 ms 588 KB Output is correct
49 Correct 5 ms 588 KB Output is correct
50 Correct 4 ms 628 KB Output is correct
51 Correct 5 ms 716 KB Output is correct
52 Correct 5 ms 716 KB Output is correct
53 Correct 4 ms 588 KB Output is correct
54 Correct 4 ms 588 KB Output is correct
55 Correct 4 ms 588 KB Output is correct
56 Correct 4 ms 584 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 3 ms 588 KB Output is correct
59 Correct 4 ms 588 KB Output is correct
60 Correct 4 ms 588 KB Output is correct
61 Correct 4 ms 588 KB Output is correct
62 Correct 273 ms 24584 KB Output is correct
63 Correct 279 ms 18436 KB Output is correct
64 Correct 387 ms 17716 KB Output is correct
65 Correct 430 ms 20416 KB Output is correct
66 Correct 331 ms 18172 KB Output is correct
67 Correct 429 ms 20204 KB Output is correct
68 Correct 164 ms 13124 KB Output is correct
69 Correct 272 ms 27208 KB Output is correct
70 Correct 205 ms 16980 KB Output is correct
71 Correct 249 ms 22052 KB Output is correct
72 Correct 324 ms 20164 KB Output is correct
73 Correct 337 ms 20164 KB Output is correct
74 Correct 281 ms 13124 KB Output is correct
75 Correct 487 ms 27032 KB Output is correct
76 Correct 159 ms 10436 KB Output is correct
77 Correct 235 ms 10472 KB Output is correct
78 Correct 248 ms 10328 KB Output is correct
79 Correct 238 ms 10352 KB Output is correct
80 Correct 222 ms 10540 KB Output is correct
81 Correct 254 ms 10476 KB Output is correct
82 Correct 159 ms 10436 KB Output is correct
83 Correct 164 ms 10384 KB Output is correct
84 Correct 171 ms 10312 KB Output is correct
85 Correct 232 ms 10404 KB Output is correct
86 Correct 225 ms 10456 KB Output is correct
87 Correct 203 ms 10440 KB Output is correct
88 Correct 405 ms 17844 KB Output is correct
89 Correct 367 ms 16708 KB Output is correct
90 Correct 329 ms 14588 KB Output is correct
91 Correct 248 ms 13428 KB Output is correct
92 Correct 208 ms 13620 KB Output is correct
93 Correct 252 ms 13180 KB Output is correct
94 Correct 258 ms 13124 KB Output is correct
95 Correct 337 ms 16808 KB Output is correct
96 Correct 302 ms 14660 KB Output is correct
97 Correct 280 ms 13640 KB Output is correct
98 Correct 276 ms 13376 KB Output is correct
99 Correct 271 ms 13208 KB Output is correct
100 Correct 265 ms 13304 KB Output is correct
101 Correct 201 ms 15812 KB Output is correct
102 Correct 182 ms 13392 KB Output is correct
103 Correct 189 ms 13120 KB Output is correct
104 Correct 198 ms 13148 KB Output is correct
105 Correct 221 ms 13100 KB Output is correct
106 Correct 242 ms 13480 KB Output is correct
107 Correct 262 ms 13252 KB Output is correct
108 Correct 250 ms 13184 KB Output is correct
109 Correct 253 ms 13124 KB Output is correct
110 Correct 259 ms 13376 KB Output is correct
111 Correct 249 ms 13380 KB Output is correct
112 Correct 202 ms 13124 KB Output is correct
113 Correct 246 ms 13312 KB Output is correct
114 Correct 229 ms 13268 KB Output is correct
115 Correct 157 ms 13252 KB Output is correct
116 Correct 157 ms 13224 KB Output is correct
117 Correct 186 ms 13084 KB Output is correct
118 Correct 183 ms 13124 KB Output is correct
119 Correct 204 ms 13140 KB Output is correct
120 Correct 209 ms 13188 KB Output is correct