oj.uz

답안 #521715

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521715 2022-02-02T19:26:53 Z Soumya1 Financial Report (JOI21_financial) C++17
100 / 100
 828 ms 55616 KB 
#include <bits/stdc++.h>
#ifdef __LOCAL__
#include <debug_local.h>
#endif
using namespace std;
const int mxN = 3e5 + 5;
int a[mxN];
int n, d;
template<typename T>
struct SegmentTree {
  vector<T> t;
  int n;
  T identity = T();
  SegmentTree() { }
  SegmentTree(int _n) : n(_n) {
    int lg = 31 - __builtin_clz(n);
    if ((1 << lg) < n) lg++;
    lg++;
    t.assign((1 << lg) + 5, identity);
  }
  void update(int x, int lx, int rx, int p, T v) {
    if (lx == rx) {
      t[x] = v;
      return;
    }
    int mx = (lx + rx) >> 1;
    if (p <= mx) update(x << 1, lx, mx, p, v);
    else update(x << 1 | 1, mx + 1, rx, p, v);
    t[x] = max(t[x << 1], t[x << 1 | 1]);
  }
  void update(int p, T v) {
    update(1, 1, n, p, v);
  }
  T query(int x, int lx, int rx, int l, int r) {
    if (lx > r || l > rx) return identity;
    if (l <= lx && r >= rx) return t[x];
    int mx = (lx + rx) >> 1;
    return max(query(x << 1, lx, mx, l, r), query(x << 1 | 1, mx + 1, rx, l, r));
  }
  T query(int l, int r) {
    return query(1, 1, n, l, r);
  }
};
SegmentTree<int> st;
int p[mxN];
int find(int u) {
  return p[u] = (u == p[u] ? u : find(p[u]));
}
void unite(int u, int v) {
  u = find(u);
  p[v] = u;
}
void testCase() {
  cin >> n >> d;
  map<int, int> mp;
  for (int i = 1; i <= n; i++) cin >> a[i], mp[a[i]];
  int id = 1;
  for (auto &[x, y] : mp) y = id++;
  for (int i = 1; i <= n; i++) a[i] = mp[a[i]];
  st = SegmentTree<int> (n);
  vector<int> v[n + 1], ans(n + 1);
  for (int i = 1; i <= n; i++) p[i] = i;
  for (int i = 1; i <= n; i++) v[a[i]].push_back(i);
  set<int> s;
  for (int i = 1; i <= n; i++) {
    for (int j : v[i]) {
      auto it = s.lower_bound(j);
      int x = j;
      if (it != s.begin() && *prev(it) >= j - d) {
        it--;
        x = find(*it);
      }
      ans[j] = st.query(max(1, x - d + 1), j) + 1;
    }
    for (int j : v[i]) {
      auto it = s.lower_bound(j);
      if (it != s.end() && *it <= j + d) {
        unite(j, *it);
      }
      if (it != s.begin() && *prev(it) >= j - d) {
        it--;
        unite(*it, j);
      }
      s.insert(j);
    }
    for (int j : v[i]) {
      st.update(j, ans[j]);
    }
  }
  // for (int i= 1; i <= n; i++) cout << ans[i] << " "; cout << endl;
  cout << *max_element(ans.begin(), ans.end()) << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 304 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 460 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 328 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 304 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 460 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 328 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 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 324 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 328 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 328 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 304 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 460 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 328 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 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 324 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 328 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 328 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 7 ms 1092 KB Output is correct
42 Correct 8 ms 1484 KB Output is correct
43 Correct 5 ms 972 KB Output is correct
44 Correct 7 ms 1108 KB Output is correct
45 Correct 8 ms 1108 KB Output is correct
46 Correct 9 ms 1484 KB Output is correct
47 Correct 7 ms 1484 KB Output is correct
48 Correct 8 ms 1484 KB Output is correct
49 Correct 8 ms 1484 KB Output is correct
50 Correct 8 ms 1484 KB Output is correct
51 Correct 7 ms 1484 KB Output is correct
52 Correct 9 ms 1488 KB Output is correct
53 Correct 5 ms 1516 KB Output is correct
54 Correct 7 ms 1476 KB Output is correct
55 Correct 8 ms 1484 KB Output is correct
56 Correct 7 ms 1488 KB Output is correct
57 Correct 8 ms 1484 KB Output is correct
58 Correct 6 ms 1484 KB Output is correct
59 Correct 6 ms 1488 KB Output is correct
60 Correct 7 ms 1520 KB Output is correct
61 Correct 7 ms 1484 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 30236 KB Output is correct
2 Correct 202 ms 30296 KB Output is correct
3 Correct 341 ms 30972 KB Output is correct
4 Correct 708 ms 49088 KB Output is correct
5 Correct 529 ms 52676 KB Output is correct
6 Correct 750 ms 52548 KB Output is correct
7 Correct 306 ms 52168 KB Output is correct
8 Correct 315 ms 52356 KB Output is correct
9 Correct 239 ms 52548 KB Output is correct
10 Correct 242 ms 52428 KB Output is correct
11 Correct 432 ms 52548 KB Output is correct
12 Correct 494 ms 52676 KB Output is correct
13 Correct 536 ms 52416 KB Output is correct
14 Correct 684 ms 52440 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 30240 KB Output is correct
2 Correct 332 ms 30504 KB Output is correct
3 Correct 480 ms 31044 KB Output is correct
4 Correct 749 ms 52532 KB Output is correct
5 Correct 606 ms 52624 KB Output is correct
6 Correct 745 ms 52648 KB Output is correct
7 Correct 318 ms 52492 KB Output is correct
8 Correct 310 ms 52636 KB Output is correct
9 Correct 266 ms 52172 KB Output is correct
10 Correct 430 ms 52516 KB Output is correct
11 Correct 692 ms 52480 KB Output is correct
12 Correct 559 ms 52432 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 304 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 460 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 328 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 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 324 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 328 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 328 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 7 ms 1092 KB Output is correct
42 Correct 8 ms 1484 KB Output is correct
43 Correct 5 ms 972 KB Output is correct
44 Correct 7 ms 1108 KB Output is correct
45 Correct 8 ms 1108 KB Output is correct
46 Correct 9 ms 1484 KB Output is correct
47 Correct 7 ms 1484 KB Output is correct
48 Correct 8 ms 1484 KB Output is correct
49 Correct 8 ms 1484 KB Output is correct
50 Correct 8 ms 1484 KB Output is correct
51 Correct 7 ms 1484 KB Output is correct
52 Correct 9 ms 1488 KB Output is correct
53 Correct 5 ms 1516 KB Output is correct
54 Correct 7 ms 1476 KB Output is correct
55 Correct 8 ms 1484 KB Output is correct
56 Correct 7 ms 1488 KB Output is correct
57 Correct 8 ms 1484 KB Output is correct
58 Correct 6 ms 1484 KB Output is correct
59 Correct 6 ms 1488 KB Output is correct
60 Correct 7 ms 1520 KB Output is correct
61 Correct 7 ms 1484 KB Output is correct
62 Correct 180 ms 30236 KB Output is correct
63 Correct 202 ms 30296 KB Output is correct
64 Correct 341 ms 30972 KB Output is correct
65 Correct 708 ms 49088 KB Output is correct
66 Correct 529 ms 52676 KB Output is correct
67 Correct 750 ms 52548 KB Output is correct
68 Correct 306 ms 52168 KB Output is correct
69 Correct 315 ms 52356 KB Output is correct
70 Correct 239 ms 52548 KB Output is correct
71 Correct 242 ms 52428 KB Output is correct
72 Correct 432 ms 52548 KB Output is correct
73 Correct 494 ms 52676 KB Output is correct
74 Correct 536 ms 52416 KB Output is correct
75 Correct 684 ms 52440 KB Output is correct
76 Correct 190 ms 30240 KB Output is correct
77 Correct 332 ms 30504 KB Output is correct
78 Correct 480 ms 31044 KB Output is correct
79 Correct 749 ms 52532 KB Output is correct
80 Correct 606 ms 52624 KB Output is correct
81 Correct 745 ms 52648 KB Output is correct
82 Correct 318 ms 52492 KB Output is correct
83 Correct 310 ms 52636 KB Output is correct
84 Correct 266 ms 52172 KB Output is correct
85 Correct 430 ms 52516 KB Output is correct
86 Correct 692 ms 52480 KB Output is correct
87 Correct 559 ms 52432 KB Output is correct
88 Correct 455 ms 33624 KB Output is correct
89 Correct 788 ms 54596 KB Output is correct
90 Correct 570 ms 36848 KB Output is correct
91 Correct 778 ms 55364 KB Output is correct
92 Correct 273 ms 33572 KB Output is correct
93 Correct 490 ms 33940 KB Output is correct
94 Correct 674 ms 48488 KB Output is correct
95 Correct 619 ms 55520 KB Output is correct
96 Correct 682 ms 55448 KB Output is correct
97 Correct 791 ms 55432 KB Output is correct
98 Correct 828 ms 55384 KB Output is correct
99 Correct 768 ms 55364 KB Output is correct
100 Correct 758 ms 55516 KB Output is correct
101 Correct 252 ms 55360 KB Output is correct
102 Correct 286 ms 55576 KB Output is correct
103 Correct 328 ms 55388 KB Output is correct
104 Correct 389 ms 55444 KB Output is correct
105 Correct 500 ms 55492 KB Output is correct
106 Correct 386 ms 55416 KB Output is correct
107 Correct 486 ms 55504 KB Output is correct
108 Correct 735 ms 55528 KB Output is correct
109 Correct 470 ms 55388 KB Output is correct
110 Correct 734 ms 55440 KB Output is correct
111 Correct 777 ms 55364 KB Output is correct
112 Correct 451 ms 55404 KB Output is correct
113 Correct 726 ms 55384 KB Output is correct
114 Correct 782 ms 55404 KB Output is correct
115 Correct 331 ms 55376 KB Output is correct
116 Correct 322 ms 55372 KB Output is correct
117 Correct 396 ms 55364 KB Output is correct
118 Correct 386 ms 55616 KB Output is correct
119 Correct 337 ms 55392 KB Output is correct
120 Correct 343 ms 55288 KB Output is correct