oj.uz

Submission #831265

# Submission time Handle Problem Language Result Execution time Memory
831265 2023-08-20T03:24:08 Z perchuts Financial Report (JOI21_financial) C++17
100 / 100
 791 ms 63064 KB 
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define pb push_back
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int ll

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ii = pair<int,int>;
using iii = tuple<int,int,int>;

const int inf = 2e9+1;
const int mod = 1e9+7;
const int maxn = 3e5+100;

template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }

ii seg[4*maxn];

int n, d;

vector<int> events[maxn];

int lis[4*maxn];

void update(int i, int l, int r, int x, int k) {
      if (r < x || x < l) return;
      if (l == r) {
            seg[i] = {k, l}; return;
      }
      int md = (l + r) / 2;
      update(2*i, l, md, x, k), update(2*i+1, md+1, r, x, k);
      if (seg[2*i].first >= d) seg[i] = seg[2*i];
      else seg[i] = max(seg[2*i], seg[2*i+1]);
}

ii query(int i, int l, int r, int x, int y = n) {
      if (r < x || y < l) return {0, 0};
      if (x <= l && r <= y) return seg[i];
      int md = (l + r) / 2;
      ii lx = query(2*i, l, md, x, y), rx = query(2*i+1, md+1, r, x, y);
      if (lx.first >= d) return lx;
      return max(lx, rx);
}


void upd(int i, int l, int r, int x, int k) {
      if (x < l || r < x) return;
      if (l == r) {
            lis[i] = k; return;
      }
      int md = (l + r) / 2;
      upd(2*i, l, md, x, k), upd(2*i+1, md+1, r, x, k);
      lis[i] = max(lis[2*i], lis[2*i+1]);
}

int queryLis(int i, int l, int r, int x, int y) {
      if (r < x || y < l || x > y) return 0;
      if (x <= l && r <= y) return lis[i];
      int md = (l + r) / 2;
      return max(queryLis(2*i, l, md, x, y), queryLis(2*i+1, md+1, r, x, y));
}

int32_t main(){_

      cin >> n >> d;

      vector<int> v(n+1); 

      for (int i = 0; i < n; ++i) cin >> v[i];

      vector<int> ord(n); iota(all(ord), 0); 

      sort(all(ord), [&] (int x, int y) {return (v[x] == v[y] ? x > y : v[x] < v[y]);});
      ord.pb(n);

      set<int> inserted;
      
      vector<int> equal;

      int cur = v[ord[0]];

      for (auto id : ord) {
            id++;
            
            if (v[id - 1] != cur) {
                  for (auto x : equal) {
                        ii q = query(1, 1, n, x);
                        if (q.first >= d) {
                              // cout << x << " vai ser removido em " << q.second + d + 1 << endl;
                              events[q.second + d + 1].pb(x);
                        }
                  }

                  cur = v[id - 1], equal = {id};

            } else equal.pb(id);

            if (id == n + 1) break;

            auto it = inserted.lower_bound(id);

            if (it != begin(inserted)) {
                  it = prev(it);
                  int y = *it;
                  update(1, 1, n, y, id - y - 1), it = next(it);
            }

            int z;

            if (it == end(inserted)) z = n - id;
            else z = *it - id - 1;

            update(1, 1, n, id, z), inserted.insert(id);
      }     

      for (int i = 0; i < n; ++i) v[ord[i]] = i + 1; 

      int ans = 0;

      for (int i = 1; i <= n; ++i) {
            for (auto x : events[i]) {
                  // cout << "- " << x << endl;
                  upd(1, 1, n, v[x-1], 0);
            }
            int best = queryLis(1, 1, n, 1, v[i-1] - 1) + 1;
            ckmax(ans, best);
            // cout << "answer for " << i << ": " << best << endl;
            upd(1, 1, n, v[i-1], best);
            // cout << "+ " << i << ' ' << v[i-1] << ' ' << best << endl;
      }
      
      cout << ans << endl;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 4 ms 7384 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 3 ms 7388 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 4 ms 7384 KB Output is correct
10 Correct 3 ms 7388 KB Output is correct
11 Correct 4 ms 7388 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 3 ms 7380 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 4 ms 7368 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct
22 Correct 3 ms 7380 KB Output is correct
23 Correct 4 ms 7380 KB Output is correct
24 Correct 4 ms 7316 KB Output is correct
25 Correct 3 ms 7380 KB Output is correct
26 Correct 3 ms 7252 KB Output is correct

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 4 ms 7384 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 3 ms 7388 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 4 ms 7384 KB Output is correct
10 Correct 3 ms 7388 KB Output is correct
11 Correct 4 ms 7388 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 3 ms 7380 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 4 ms 7368 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct
22 Correct 3 ms 7380 KB Output is correct
23 Correct 4 ms 7380 KB Output is correct
24 Correct 4 ms 7316 KB Output is correct
25 Correct 3 ms 7380 KB Output is correct
26 Correct 3 ms 7252 KB Output is correct
27 Correct 4 ms 7380 KB Output is correct
28 Correct 4 ms 7364 KB Output is correct
29 Correct 4 ms 7384 KB Output is correct
30 Correct 4 ms 7380 KB Output is correct
31 Correct 4 ms 7384 KB Output is correct
32 Correct 4 ms 7380 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 4 ms 7380 KB Output is correct
35 Correct 5 ms 7380 KB Output is correct
36 Correct 4 ms 7380 KB Output is correct
37 Correct 4 ms 7380 KB Output is correct
38 Correct 3 ms 7380 KB Output is correct
39 Correct 4 ms 7380 KB Output is correct
40 Correct 4 ms 7376 KB Output is correct
41 Correct 12 ms 8400 KB Output is correct
42 Correct 12 ms 8380 KB Output is correct
43 Correct 10 ms 8260 KB Output is correct
44 Correct 11 ms 8168 KB Output is correct
45 Correct 11 ms 8164 KB Output is correct
46 Correct 11 ms 8280 KB Output is correct
47 Correct 11 ms 8276 KB Output is correct
48 Correct 11 ms 8292 KB Output is correct
49 Correct 12 ms 8216 KB Output is correct
50 Correct 12 ms 8236 KB Output is correct
51 Correct 12 ms 8292 KB Output is correct
52 Correct 13 ms 8296 KB Output is correct
53 Correct 12 ms 8404 KB Output is correct
54 Correct 11 ms 8364 KB Output is correct
55 Correct 11 ms 8276 KB Output is correct
56 Correct 11 ms 8264 KB Output is correct
57 Correct 11 ms 8276 KB Output is correct
58 Correct 9 ms 8276 KB Output is correct
59 Correct 9 ms 8280 KB Output is correct
60 Correct 9 ms 8148 KB Output is correct
61 Correct 10 ms 8228 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 56280 KB Output is correct
2 Correct 402 ms 58516 KB Output is correct
3 Correct 568 ms 59516 KB Output is correct
4 Correct 743 ms 59464 KB Output is correct
5 Correct 551 ms 60100 KB Output is correct
6 Correct 768 ms 59532 KB Output is correct
7 Correct 378 ms 62840 KB Output is correct
8 Correct 270 ms 53660 KB Output is correct
9 Correct 362 ms 60580 KB Output is correct
10 Correct 364 ms 57276 KB Output is correct
11 Correct 524 ms 59216 KB Output is correct
12 Correct 538 ms 59256 KB Output is correct
13 Correct 600 ms 63064 KB Output is correct
14 Correct 654 ms 56756 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 322 ms 56640 KB Output is correct
2 Correct 470 ms 53644 KB Output is correct
3 Correct 617 ms 53660 KB Output is correct
4 Correct 615 ms 53640 KB Output is correct
5 Correct 529 ms 53696 KB Output is correct
6 Correct 604 ms 53696 KB Output is correct
7 Correct 318 ms 53596 KB Output is correct
8 Correct 262 ms 53684 KB Output is correct
9 Correct 373 ms 53452 KB Output is correct
10 Correct 440 ms 53600 KB Output is correct
11 Correct 575 ms 53664 KB Output is correct
12 Correct 544 ms 53676 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 4 ms 7384 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 3 ms 7388 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 4 ms 7384 KB Output is correct
10 Correct 3 ms 7388 KB Output is correct
11 Correct 4 ms 7388 KB Output is correct
12 Correct 3 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 3 ms 7380 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 4 ms 7368 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct
22 Correct 3 ms 7380 KB Output is correct
23 Correct 4 ms 7380 KB Output is correct
24 Correct 4 ms 7316 KB Output is correct
25 Correct 3 ms 7380 KB Output is correct
26 Correct 3 ms 7252 KB Output is correct
27 Correct 4 ms 7380 KB Output is correct
28 Correct 4 ms 7364 KB Output is correct
29 Correct 4 ms 7384 KB Output is correct
30 Correct 4 ms 7380 KB Output is correct
31 Correct 4 ms 7384 KB Output is correct
32 Correct 4 ms 7380 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 4 ms 7380 KB Output is correct
35 Correct 5 ms 7380 KB Output is correct
36 Correct 4 ms 7380 KB Output is correct
37 Correct 4 ms 7380 KB Output is correct
38 Correct 3 ms 7380 KB Output is correct
39 Correct 4 ms 7380 KB Output is correct
40 Correct 4 ms 7376 KB Output is correct
41 Correct 12 ms 8400 KB Output is correct
42 Correct 12 ms 8380 KB Output is correct
43 Correct 10 ms 8260 KB Output is correct
44 Correct 11 ms 8168 KB Output is correct
45 Correct 11 ms 8164 KB Output is correct
46 Correct 11 ms 8280 KB Output is correct
47 Correct 11 ms 8276 KB Output is correct
48 Correct 11 ms 8292 KB Output is correct
49 Correct 12 ms 8216 KB Output is correct
50 Correct 12 ms 8236 KB Output is correct
51 Correct 12 ms 8292 KB Output is correct
52 Correct 13 ms 8296 KB Output is correct
53 Correct 12 ms 8404 KB Output is correct
54 Correct 11 ms 8364 KB Output is correct
55 Correct 11 ms 8276 KB Output is correct
56 Correct 11 ms 8264 KB Output is correct
57 Correct 11 ms 8276 KB Output is correct
58 Correct 9 ms 8276 KB Output is correct
59 Correct 9 ms 8280 KB Output is correct
60 Correct 9 ms 8148 KB Output is correct
61 Correct 10 ms 8228 KB Output is correct
62 Correct 293 ms 56280 KB Output is correct
63 Correct 402 ms 58516 KB Output is correct
64 Correct 568 ms 59516 KB Output is correct
65 Correct 743 ms 59464 KB Output is correct
66 Correct 551 ms 60100 KB Output is correct
67 Correct 768 ms 59532 KB Output is correct
68 Correct 378 ms 62840 KB Output is correct
69 Correct 270 ms 53660 KB Output is correct
70 Correct 362 ms 60580 KB Output is correct
71 Correct 364 ms 57276 KB Output is correct
72 Correct 524 ms 59216 KB Output is correct
73 Correct 538 ms 59256 KB Output is correct
74 Correct 600 ms 63064 KB Output is correct
75 Correct 654 ms 56756 KB Output is correct
76 Correct 322 ms 56640 KB Output is correct
77 Correct 470 ms 53644 KB Output is correct
78 Correct 617 ms 53660 KB Output is correct
79 Correct 615 ms 53640 KB Output is correct
80 Correct 529 ms 53696 KB Output is correct
81 Correct 604 ms 53696 KB Output is correct
82 Correct 318 ms 53596 KB Output is correct
83 Correct 262 ms 53684 KB Output is correct
84 Correct 373 ms 53452 KB Output is correct
85 Correct 440 ms 53600 KB Output is correct
86 Correct 575 ms 53664 KB Output is correct
87 Correct 544 ms 53676 KB Output is correct
88 Correct 684 ms 58624 KB Output is correct
89 Correct 791 ms 58188 KB Output is correct
90 Correct 642 ms 56544 KB Output is correct
91 Correct 642 ms 54048 KB Output is correct
92 Correct 467 ms 53716 KB Output is correct
93 Correct 636 ms 53720 KB Output is correct
94 Correct 638 ms 53688 KB Output is correct
95 Correct 681 ms 58944 KB Output is correct
96 Correct 648 ms 57388 KB Output is correct
97 Correct 746 ms 56236 KB Output is correct
98 Correct 674 ms 54108 KB Output is correct
99 Correct 682 ms 53684 KB Output is correct
100 Correct 604 ms 53720 KB Output is correct
101 Correct 382 ms 59116 KB Output is correct
102 Correct 404 ms 57340 KB Output is correct
103 Correct 429 ms 57016 KB Output is correct
104 Correct 458 ms 56736 KB Output is correct
105 Correct 519 ms 55640 KB Output is correct
106 Correct 451 ms 53912 KB Output is correct
107 Correct 457 ms 53696 KB Output is correct
108 Correct 605 ms 53632 KB Output is correct
109 Correct 504 ms 62904 KB Output is correct
110 Correct 649 ms 55792 KB Output is correct
111 Correct 627 ms 54240 KB Output is correct
112 Correct 462 ms 55256 KB Output is correct
113 Correct 551 ms 53592 KB Output is correct
114 Correct 609 ms 53696 KB Output is correct
115 Correct 356 ms 53660 KB Output is correct
116 Correct 321 ms 53628 KB Output is correct
117 Correct 397 ms 53640 KB Output is correct
118 Correct 413 ms 53652 KB Output is correct
119 Correct 414 ms 53652 KB Output is correct
120 Correct 438 ms 53696 KB Output is correct