oj.uz

Submission #854138

# Submission time Handle Problem Language Result Execution time Memory
854138 2023-09-26T08:27:48 Z NeroZein Financial Report (JOI21_financial) C++17
53 / 100
 4000 ms 9808 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);
    ret = min(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 0 ms 344 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 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 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 0 ms 344 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 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 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 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 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 348 KB Output is correct
38 Correct 1 ms 344 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 0 ms 344 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 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 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 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 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 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 136 ms 640 KB Output is correct
42 Correct 88 ms 640 KB Output is correct
43 Correct 19 ms 640 KB Output is correct
44 Correct 9 ms 600 KB Output is correct
45 Correct 3 ms 600 KB Output is correct
46 Correct 4 ms 600 KB Output is correct
47 Correct 79 ms 604 KB Output is correct
48 Correct 31 ms 600 KB Output is correct
49 Correct 9 ms 664 KB Output is correct
50 Correct 44 ms 652 KB Output is correct
51 Correct 144 ms 600 KB Output is correct
52 Correct 118 ms 636 KB Output is correct
53 Correct 133 ms 640 KB Output is correct
54 Correct 126 ms 636 KB Output is correct
55 Correct 6 ms 600 KB Output is correct
56 Correct 3 ms 600 KB Output is correct
57 Correct 5 ms 600 KB Output is correct
58 Correct 2 ms 600 KB Output is correct
59 Correct 2 ms 600 KB Output is correct
60 Correct 3 ms 604 KB Output is correct
61 Correct 3 ms 856 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 8464 KB Output is correct
2 Execution timed out 4034 ms 8784 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 9808 KB Output is correct
2 Correct 125 ms 8676 KB Output is correct
3 Correct 136 ms 8464 KB Output is correct
4 Correct 138 ms 8500 KB Output is correct
5 Correct 125 ms 8672 KB Output is correct
6 Correct 137 ms 8528 KB Output is correct
7 Correct 91 ms 9808 KB Output is correct
8 Correct 90 ms 8532 KB Output is correct
9 Correct 96 ms 8812 KB Output is correct
10 Correct 124 ms 8640 KB Output is correct
11 Correct 131 ms 8528 KB Output is correct
12 Correct 123 ms 8664 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 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 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 600 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 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 348 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 136 ms 640 KB Output is correct
42 Correct 88 ms 640 KB Output is correct
43 Correct 19 ms 640 KB Output is correct
44 Correct 9 ms 600 KB Output is correct
45 Correct 3 ms 600 KB Output is correct
46 Correct 4 ms 600 KB Output is correct
47 Correct 79 ms 604 KB Output is correct
48 Correct 31 ms 600 KB Output is correct
49 Correct 9 ms 664 KB Output is correct
50 Correct 44 ms 652 KB Output is correct
51 Correct 144 ms 600 KB Output is correct
52 Correct 118 ms 636 KB Output is correct
53 Correct 133 ms 640 KB Output is correct
54 Correct 126 ms 636 KB Output is correct
55 Correct 6 ms 600 KB Output is correct
56 Correct 3 ms 600 KB Output is correct
57 Correct 5 ms 600 KB Output is correct
58 Correct 2 ms 600 KB Output is correct
59 Correct 2 ms 600 KB Output is correct
60 Correct 3 ms 604 KB Output is correct
61 Correct 3 ms 856 KB Output is correct
62 Correct 90 ms 8464 KB Output is correct
63 Execution timed out 4034 ms 8784 KB Time limit exceeded
64 Halted 0 ms 0 KB -