oj.uz

Submission #854139

# Submission time Handle Problem Language Result Execution time Memory
854139 2023-09-26T08:29:11 Z NeroZein Financial Report (JOI21_financial) C++17
100 / 100
 175 ms 11772 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define deb(...)
#endif

struct segtree {
  int n;
  vector<int> seg;
  segtree(int n_) : n(n_) {
    seg.resize(2 * n - 1); 
  }
  void upd(int nd, int l, int r, int p, int v) {
    if (l == r) {
      seg[nd] = v;
      return;
    }
    int mid = (l + r) >> 1;
    int rs = nd + ((mid - l + 1) << 1);
    if (p <= mid) {
      upd(nd + 1, l, mid, p, v);
    } else {
      upd(rs, mid + 1, r, p, v); 
    }
    seg[nd] = max(seg[nd + 1], seg[rs]);
  }
  void upd(int p, int v) {
    upd(0, 0, n - 1, p, v); 
  }
  int qry(int nd, int l, int r, int s, int e) {
    if (l >= s && r <= e) {
      return seg[nd]; 
    }
    int mid = (l + r) >> 1;
    int rs = nd + ((mid - l + 1) << 1);
    if (mid >= e) {
      return qry(nd + 1, l, mid, s, e); 
    } else {
      if (mid < s) {
        return qry(rs, mid + 1, r, s, e);
      } else {
        return max(qry(nd + 1, l, mid, s, e), qry(rs, mid + 1, r, s, e));
      }
    }
  }
  int qry(int s, int e) {
    return qry(0, 0, n - 1, s, e); 
  }
  int dive(int nd, int l, int r, int s, int e, int key) {
    if (l > e || r < s || key >= seg[nd]) {
      return n - 1;
    }
    if (l == r) {
      return l; 
    }
    int mid = (l + r) >> 1;
    int rs = nd + ((mid - l + 1) << 1);
    int ret = dive(nd + 1, l, mid, s, e, key);
    if (ret == n - 1) {
      ret = dive(rs, mid + 1, r, s, e, key);       
    }
    return ret; 
  }
  int dive(int s, int e, int key) {
    return dive(0, 0, n - 1, s, e, key); 
  }
};

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, d;
  cin >> n >> d;
  vector<pair<int,int>> a(n); 
  for (int i = 0; i < n; ++i) {
    cin >> a[i].first; 
    a[i].second = i; 
  }
  segtree m(n);
  deque<int> dq;
  for (int i = 0; i < n; ++i) {
    while (!dq.empty() && dq.back() > a[i].first) {
      dq.pop_back();
    }
    dq.push_back(a[i].first);
    if (i >= d - 1) {
      m.upd(i, dq.front()); 
      if (dq.front() == a[i - d + 1].first) {
        dq.pop_front(); 
      }
    } else {
      m.upd(i, -1); 
    }
  }
  vector<int> r(n, n - 1); 
  for (int i = 0; i < n - d; ++i) {
    r[a[i].second] = m.dive(i + d , n - 1, a[i].first); 
  }
  sort(a.begin(), a.end(), [](pair<int,int> i, pair<int,int> j) {
    return i.first != j.first ? i.first > j.first : i.second < j.second;
  });
  segtree dp(n); 
  for (int i = 0; i < n; ++i) {
    auto [v, ind] = a[i];
    int rightmost = r[ind];
    dp.upd(ind, dp.qry(ind, rightmost) + 1); 
  }
  cout << dp.seg[0] << '\n'; 
  return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 8528 KB Output is correct
2 Correct 127 ms 8528 KB Output is correct
3 Correct 146 ms 11344 KB Output is correct
4 Correct 161 ms 11372 KB Output is correct
5 Correct 136 ms 11600 KB Output is correct
6 Correct 156 ms 11520 KB Output is correct
7 Correct 106 ms 11468 KB Output is correct
8 Correct 110 ms 11520 KB Output is correct
9 Correct 111 ms 11368 KB Output is correct
10 Correct 113 ms 11496 KB Output is correct
11 Correct 143 ms 11564 KB Output is correct
12 Correct 151 ms 11524 KB Output is correct
13 Correct 143 ms 11344 KB Output is correct
14 Correct 175 ms 11348 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 9720 KB Output is correct
2 Correct 127 ms 8532 KB Output is correct
3 Correct 138 ms 8528 KB Output is correct
4 Correct 134 ms 8620 KB Output is correct
5 Correct 125 ms 8528 KB Output is correct
6 Correct 134 ms 8536 KB Output is correct
7 Correct 87 ms 9808 KB Output is correct
8 Correct 89 ms 8528 KB Output is correct
9 Correct 101 ms 8784 KB Output is correct
10 Correct 123 ms 8448 KB Output is correct
11 Correct 134 ms 8524 KB Output is correct
12 Correct 125 ms 8664 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 600 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 3 ms 600 KB Output is correct
42 Correct 3 ms 600 KB Output is correct
43 Correct 3 ms 604 KB Output is correct
44 Correct 3 ms 600 KB Output is correct
45 Correct 3 ms 600 KB Output is correct
46 Correct 3 ms 600 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 3 ms 600 KB Output is correct
49 Correct 4 ms 604 KB Output is correct
50 Correct 3 ms 600 KB Output is correct
51 Correct 3 ms 600 KB Output is correct
52 Correct 3 ms 604 KB Output is correct
53 Correct 3 ms 604 KB Output is correct
54 Correct 3 ms 604 KB Output is correct
55 Correct 3 ms 600 KB Output is correct
56 Correct 4 ms 808 KB Output is correct
57 Correct 3 ms 600 KB Output is correct
58 Correct 2 ms 600 KB Output is correct
59 Correct 2 ms 604 KB Output is correct
60 Correct 2 ms 800 KB Output is correct
61 Correct 2 ms 604 KB Output is correct
62 Correct 90 ms 8528 KB Output is correct
63 Correct 127 ms 8528 KB Output is correct
64 Correct 146 ms 11344 KB Output is correct
65 Correct 161 ms 11372 KB Output is correct
66 Correct 136 ms 11600 KB Output is correct
67 Correct 156 ms 11520 KB Output is correct
68 Correct 106 ms 11468 KB Output is correct
69 Correct 110 ms 11520 KB Output is correct
70 Correct 111 ms 11368 KB Output is correct
71 Correct 113 ms 11496 KB Output is correct
72 Correct 143 ms 11564 KB Output is correct
73 Correct 151 ms 11524 KB Output is correct
74 Correct 143 ms 11344 KB Output is correct
75 Correct 175 ms 11348 KB Output is correct
76 Correct 91 ms 9720 KB Output is correct
77 Correct 127 ms 8532 KB Output is correct
78 Correct 138 ms 8528 KB Output is correct
79 Correct 134 ms 8620 KB Output is correct
80 Correct 125 ms 8528 KB Output is correct
81 Correct 134 ms 8536 KB Output is correct
82 Correct 87 ms 9808 KB Output is correct
83 Correct 89 ms 8528 KB Output is correct
84 Correct 101 ms 8784 KB Output is correct
85 Correct 123 ms 8448 KB Output is correct
86 Correct 134 ms 8524 KB Output is correct
87 Correct 125 ms 8664 KB Output is correct
88 Correct 162 ms 11524 KB Output is correct
89 Correct 172 ms 11344 KB Output is correct
90 Correct 163 ms 11344 KB Output is correct
91 Correct 147 ms 11572 KB Output is correct
92 Correct 123 ms 11344 KB Output is correct
93 Correct 140 ms 11484 KB Output is correct
94 Correct 138 ms 11484 KB Output is correct
95 Correct 153 ms 11532 KB Output is correct
96 Correct 162 ms 11380 KB Output is correct
97 Correct 171 ms 11572 KB Output is correct
98 Correct 149 ms 11432 KB Output is correct
99 Correct 141 ms 11532 KB Output is correct
100 Correct 139 ms 11344 KB Output is correct
101 Correct 114 ms 11772 KB Output is correct
102 Correct 126 ms 11524 KB Output is correct
103 Correct 132 ms 11344 KB Output is correct
104 Correct 143 ms 11576 KB Output is correct
105 Correct 157 ms 11372 KB Output is correct
106 Correct 125 ms 11576 KB Output is correct
107 Correct 130 ms 11344 KB Output is correct
108 Correct 137 ms 11584 KB Output is correct
109 Correct 143 ms 11344 KB Output is correct
110 Correct 145 ms 11372 KB Output is correct
111 Correct 139 ms 11748 KB Output is correct
112 Correct 132 ms 11372 KB Output is correct
113 Correct 139 ms 11644 KB Output is correct
114 Correct 131 ms 11344 KB Output is correct
115 Correct 88 ms 11568 KB Output is correct
116 Correct 89 ms 11348 KB Output is correct
117 Correct 112 ms 11344 KB Output is correct
118 Correct 108 ms 11344 KB Output is correct
119 Correct 124 ms 11344 KB Output is correct
120 Correct 123 ms 11524 KB Output is correct