oj.uz

Submission #589421

# Submission time Handle Problem Language Result Execution time Memory
589421 2022-07-04T16:18:32 Z waynetuinfor Financial Report (JOI21_financial) C++17
100 / 100
 608 ms 26820 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int N, D;
  cin >> N >> D;
  vector<int> A(N);
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }
  vector<int> order(N);
  iota(order.begin(), order.end(), 0);
  sort(order.begin(), order.end(), [&](int i, int j) { return A[i] < A[j]; });

  vector<int> uf(N);
  iota(uf.begin(), uf.end(), 0);

  function<int(int)> Find = [&](int x) {
    if (x == uf[x]) return x;
    return uf[x] = Find(uf[x]);
  };

  auto Merge = [&](int x, int y) {
    x = Find(x);
    y = Find(y);
    if (x != y) {
      if (x > y) {
        swap(x, y);
      }
      uf[y] = x;
    }
  };

  set<int> points;
  vector<int> dp(N);

  vector<int> tree(N * 4);

  auto Query = [&](int ql, int qr) {
    auto dfs = [&](auto dfs, int l, int r, int o = 0) -> int {
      if (l >= qr || ql >= r) {
        return 0;
      }
      if (l >= ql && r <= qr) {
        return tree[o];
      }
      int m = (l + r) >> 1;
      return max(dfs(dfs, l, m, o * 2 + 1), dfs(dfs, m, r, o * 2 + 2));
    };

    return dfs(dfs, 0, N);
  };

  auto Update = [&](int p, int v) {
    auto dfs = [&](auto dfs, int l, int r, int o = 0) -> void {
      if (r - l == 1) {
        tree[o] = max(tree[o], v);
        return;
      }
      int m = (l + r) >> 1;
      if (p < m) {
        dfs(dfs, l, m, o * 2 + 1);
      } else {
        dfs(dfs, m, r, o * 2 + 2);
      }
      tree[o] = max(tree[o * 2 + 1], tree[o * 2 + 2]);
    };

    return dfs(dfs, 0, N);
  };

  for (int i = 0, j = 0; i < N; ++i) {
    while (j < N && A[order[j]] < A[order[i]]) {
      auto iter = points.lower_bound(order[j]);
      if (iter != points.end() && *iter - order[j] <= D) {
        Merge(order[j], *iter);
      }
      if (iter != points.begin() && order[j] - *prev(iter) <= D) {
        Merge(*prev(iter), order[j]);
      }
      points.insert(order[j]);
      Update(order[j], dp[j]);
      j++;
    }
    int x = order[i];
    auto iter = points.lower_bound(x);
    if (iter != points.begin() && x - *prev(iter) <= D) {
      x = *prev(iter);
    }
    x = Find(x);
    dp[i] = Query(x, order[i] + 1) + 1;
  }
  cout << *max_element(dp.begin(), dp.end()) << "\n";
  return 0;
}

Subtask #1
14.0 / 14.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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 0 ms 316 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #2
14.0 / 14.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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 0 ms 316 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 0 ms 316 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 7 ms 896 KB Output is correct
42 Correct 8 ms 932 KB Output is correct
43 Correct 5 ms 840 KB Output is correct
44 Correct 9 ms 840 KB Output is correct
45 Correct 7 ms 792 KB Output is correct
46 Correct 8 ms 920 KB Output is correct
47 Correct 7 ms 800 KB Output is correct
48 Correct 7 ms 852 KB Output is correct
49 Correct 6 ms 924 KB Output is correct
50 Correct 7 ms 852 KB Output is correct
51 Correct 6 ms 852 KB Output is correct
52 Correct 7 ms 852 KB Output is correct
53 Correct 5 ms 852 KB Output is correct
54 Correct 6 ms 844 KB Output is correct
55 Correct 8 ms 932 KB Output is correct
56 Correct 7 ms 852 KB Output is correct
57 Correct 8 ms 840 KB Output is correct
58 Correct 5 ms 852 KB Output is correct
59 Correct 5 ms 852 KB Output is correct
60 Correct 7 ms 856 KB Output is correct
61 Correct 7 ms 852 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 12624 KB Output is correct
2 Correct 321 ms 24308 KB Output is correct
3 Correct 523 ms 26504 KB Output is correct
4 Correct 513 ms 26620 KB Output is correct
5 Correct 414 ms 26600 KB Output is correct
6 Correct 477 ms 26708 KB Output is correct
7 Correct 265 ms 26440 KB Output is correct
8 Correct 259 ms 26568 KB Output is correct
9 Correct 229 ms 26668 KB Output is correct
10 Correct 217 ms 26628 KB Output is correct
11 Correct 362 ms 26820 KB Output is correct
12 Correct 383 ms 26700 KB Output is correct
13 Correct 408 ms 26632 KB Output is correct
14 Correct 449 ms 26684 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 12952 KB Output is correct
2 Correct 494 ms 26448 KB Output is correct
3 Correct 496 ms 26636 KB Output is correct
4 Correct 544 ms 26708 KB Output is correct
5 Correct 446 ms 26652 KB Output is correct
6 Correct 476 ms 26700 KB Output is correct
7 Correct 276 ms 26636 KB Output is correct
8 Correct 250 ms 26728 KB Output is correct
9 Correct 249 ms 26428 KB Output is correct
10 Correct 323 ms 26564 KB Output is correct
11 Correct 501 ms 26612 KB Output is correct
12 Correct 437 ms 26700 KB Output is correct

Subtask #6
35.0 / 35.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 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 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 0 ms 316 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 7 ms 896 KB Output is correct
42 Correct 8 ms 932 KB Output is correct
43 Correct 5 ms 840 KB Output is correct
44 Correct 9 ms 840 KB Output is correct
45 Correct 7 ms 792 KB Output is correct
46 Correct 8 ms 920 KB Output is correct
47 Correct 7 ms 800 KB Output is correct
48 Correct 7 ms 852 KB Output is correct
49 Correct 6 ms 924 KB Output is correct
50 Correct 7 ms 852 KB Output is correct
51 Correct 6 ms 852 KB Output is correct
52 Correct 7 ms 852 KB Output is correct
53 Correct 5 ms 852 KB Output is correct
54 Correct 6 ms 844 KB Output is correct
55 Correct 8 ms 932 KB Output is correct
56 Correct 7 ms 852 KB Output is correct
57 Correct 8 ms 840 KB Output is correct
58 Correct 5 ms 852 KB Output is correct
59 Correct 5 ms 852 KB Output is correct
60 Correct 7 ms 856 KB Output is correct
61 Correct 7 ms 852 KB Output is correct
62 Correct 90 ms 12624 KB Output is correct
63 Correct 321 ms 24308 KB Output is correct
64 Correct 523 ms 26504 KB Output is correct
65 Correct 513 ms 26620 KB Output is correct
66 Correct 414 ms 26600 KB Output is correct
67 Correct 477 ms 26708 KB Output is correct
68 Correct 265 ms 26440 KB Output is correct
69 Correct 259 ms 26568 KB Output is correct
70 Correct 229 ms 26668 KB Output is correct
71 Correct 217 ms 26628 KB Output is correct
72 Correct 362 ms 26820 KB Output is correct
73 Correct 383 ms 26700 KB Output is correct
74 Correct 408 ms 26632 KB Output is correct
75 Correct 449 ms 26684 KB Output is correct
76 Correct 100 ms 12952 KB Output is correct
77 Correct 494 ms 26448 KB Output is correct
78 Correct 496 ms 26636 KB Output is correct
79 Correct 544 ms 26708 KB Output is correct
80 Correct 446 ms 26652 KB Output is correct
81 Correct 476 ms 26700 KB Output is correct
82 Correct 276 ms 26636 KB Output is correct
83 Correct 250 ms 26728 KB Output is correct
84 Correct 249 ms 26428 KB Output is correct
85 Correct 323 ms 26564 KB Output is correct
86 Correct 501 ms 26612 KB Output is correct
87 Correct 437 ms 26700 KB Output is correct
88 Correct 561 ms 26572 KB Output is correct
89 Correct 555 ms 26588 KB Output is correct
90 Correct 554 ms 26616 KB Output is correct
91 Correct 525 ms 26652 KB Output is correct
92 Correct 519 ms 26180 KB Output is correct
93 Correct 597 ms 26644 KB Output is correct
94 Correct 494 ms 26664 KB Output is correct
95 Correct 481 ms 26624 KB Output is correct
96 Correct 500 ms 26688 KB Output is correct
97 Correct 545 ms 26664 KB Output is correct
98 Correct 608 ms 26696 KB Output is correct
99 Correct 600 ms 26692 KB Output is correct
100 Correct 537 ms 26672 KB Output is correct
101 Correct 231 ms 26688 KB Output is correct
102 Correct 249 ms 26684 KB Output is correct
103 Correct 280 ms 26664 KB Output is correct
104 Correct 297 ms 26692 KB Output is correct
105 Correct 368 ms 26700 KB Output is correct
106 Correct 344 ms 26692 KB Output is correct
107 Correct 380 ms 26616 KB Output is correct
108 Correct 519 ms 26600 KB Output is correct
109 Correct 361 ms 26692 KB Output is correct
110 Correct 480 ms 26688 KB Output is correct
111 Correct 556 ms 26608 KB Output is correct
112 Correct 416 ms 26660 KB Output is correct
113 Correct 489 ms 26628 KB Output is correct
114 Correct 571 ms 26700 KB Output is correct
115 Correct 281 ms 26700 KB Output is correct
116 Correct 309 ms 26680 KB Output is correct
117 Correct 371 ms 26692 KB Output is correct
118 Correct 389 ms 26700 KB Output is correct
119 Correct 290 ms 26612 KB Output is correct
120 Correct 294 ms 26572 KB Output is correct