oj.uz

Submission #420467

# Submission time Handle Problem Language Result Execution time Memory
420467 2021-06-08T11:35:15 Z egorlifar Financial Report (JOI21_financial) C++17
100 / 100
 650 ms 27320 KB 
/*
KAMUI!
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓ 
▓▓▓▓▓▓▓▓▓▓▓▓▓██████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓ 
▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓█████▓▓▓▓▓▓▓▓▓
▓▓▓▓▓▓▓███▓▒▒░▒▒▒▒▒░░░▒▒▒▓▓███▓▓▓▓▓▓▓ 
▓▓▓▓▓▓█▓▒▒▒▓▓████████▓▒▒░▒▒▒▓██▓▓▓▓▓▓
▓▓▓▓██▒▓████████████████▓░▒▒▒▒▓██▓▓▓▓ 
▓▓▓██▓███████▓▒░░░░░░░▒███▒░░▒▒▒██▓▓▓ 
▓▓█████████▓░░░░░░░░░░░░░██▓▓██████▓▓ 
▓▓█▒▓███████████▓▓▒▒▒▓▓██████████▓█▓▓ 
▓██▒▒▒███████████████████████████▓▓█▓ 
▓█▓▒▒░░████████▒░░░░▓███████████▓░▒█▓ 
▓█▒▒▒░██░▒████░░░░░░█████░░████▓░░▒█▓ 
▓█▒▒▒▒██░░░██▓░░░░░░░███▒░░████▒▒▒▒█▓ 
▓█▓▒▒▒██▒░░░▓█▓░░░░░▓█▓░░░▓███▓▒▒░▓█▓ 
▓█▓▒▒▒███░░░░████████▓░░░░░████▒▒▒▓█▓ 
▓▓█▒▒░▓███░░░▒███████▒░░░▒███▓▒▒▒▒█▓▓ 
▓▓██▒▒░████▒░░███████░░░▓███▓░▒▒▒██▓▓ 
▓▓▓██▒▒▒█████▓░░██████▒▓███▓▒░▒▒██▓▓▓ 
▓▓▓▓██▓▒░▓██████████████▓▒░▒▒▒▓██▓▓▓▓ 
▓▓▓▓▓▓██▓░▒▓█████████▒░░▒▒▒▒▓██▓▓▓▓▓▓ 
▓▓▓▓▓▓▓███▓▒▒▓██████▓░▒▒▒▓▓███▓▓▓▓▓▓▓ 
▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓███▓▓▓████▓▓▓▓▓▓▓▓▓ 
▓▓▓▓▓▓▓▓▓▓▓▓▓███████████▓▓▓▓▓▓▓▓▓▓▓▓▓ 
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
*/
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";
const int Mod = 998244353;


int sum(int a, int b) {
    return (a + b >= Mod ? a + b - Mod: a + b);
}


int mul(int a, int b) {
    return ((ll)a * b) % Mod;
}


int powm(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1) {
            res = mul(res, a);
        }
        a = mul(a, a);
        b >>= 1;
    }
    return res;
}


int inv(int a) {
    return powm(a, Mod - 2);
}



const int MAXN = 300228;


int n, D;
int a[MAXN];
int rl[MAXN];
int dp[MAXN];
vector<int> kill[MAXN];
int where[MAXN];
int td[MAXN];
int d[MAXN * 4];
int ss = 1;


void change(int i, int x) {
    d[i] = x;
    while (i >> 1 > 0) {
        i >>= 1;
        d[i] = max(d[i * 2], d[i * 2 + 1]);
    }
}


int get(int l, int r) {
    l += ss;
    r += ss;
    int ans = 0;
    while (l <= r) {
        if (l & 1) {
            chkmax(ans, d[l]);
            l++;
        }
        if (!(r & 1)) {
            chkmax(ans, d[r]);
            r--;
        }
        l >>= 1;
        r >>= 1;
    }
    return ans;
}

void solve() {
    cin >> n >> D;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }    
    vector<pair<int, int> > st;
    for (int i = 0; i < n; i++) {
        st.pb(mp(a[i], i));
    }
    sort(all(st));
    int uk1 = 0;
    for (int i = 0; i < n; i++) {
        where[st[i].second] = i;
        while (st[uk1].first < st[i].first) {
            uk1++;
        }
        td[st[i].second] = uk1 - 1;
    }   
    int uk = n - 1;
    set<pair<int, int> > s, sb;
    for (int it = n - 1; it >= 0; it--) {
        int i = st[it].second;
        while (st[uk].first > st[it].first) {
            int j = st[uk].second;
            {
                auto it = s.lower_bound(mp(j, 0));
                vector<pair<int, int> > dels;
                vector<pair<int, int> > adds;
                int l = j;
                int r = j;
                if (it != s.end() && it->first == j + 1) {
                    r = it->second;
                    dels.pb(*it);
                }
                if (it != s.begin()) {
                    it--;
                    if (it->second == j - 1) {
                        l = it->first;
                        dels.pb(*it);
                    }
                }
                adds.pb(mp(l, r));
                for (auto x: dels) {
                    s.erase(x);
                    sb.erase(x);
                }
                for (auto x: adds) {
                    s.insert(x);
                    if (x.second - x.first + 1 > D - 1) {
                        sb.insert(x);
                    }
                }
            }
            uk--;
        }
        auto f = sb.lower_bound(mp(i + 1, 0));
        if (f != sb.begin()) {
            f--;
        }
        int last = n - 1;
        for (auto cur = f; cur != sb.end(); cur++) {
            int ls = max(cur->first, i);
            int rs = ls + D - 1;
            if (rs <= cur->second) {
                last = rs;
                break;
            }
        }
        rl[i] = last;
    }
    while (ss < n) {
        ss <<= 1;
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (auto x: kill[i]) {
            change(ss + where[x], -1);
        }
        dp[i] = 1 + get(0, td[i]);
        change(ss + where[i], dp[i]);
        kill[rl[i] + 1].pb(i);
        chkmax(ans, dp[i]);
    }
    cout << ans << '\n';
}           


int main() {
    //12:15
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
   // read(FILENAME);
    int t;
    t = 1;
  //  cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 4 ms 7372 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 4 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 4 ms 7372 KB Output is correct
10 Correct 4 ms 7372 KB Output is correct
11 Correct 4 ms 7372 KB Output is correct
12 Correct 5 ms 7372 KB Output is correct
13 Correct 5 ms 7372 KB Output is correct
14 Correct 4 ms 7372 KB Output is correct
15 Correct 5 ms 7372 KB Output is correct
16 Correct 4 ms 7372 KB Output is correct
17 Correct 4 ms 7372 KB Output is correct
18 Correct 5 ms 7372 KB Output is correct
19 Correct 5 ms 7372 KB Output is correct
20 Correct 5 ms 7372 KB Output is correct
21 Correct 4 ms 7372 KB Output is correct
22 Correct 4 ms 7372 KB Output is correct
23 Correct 4 ms 7372 KB Output is correct
24 Correct 4 ms 7372 KB Output is correct
25 Correct 5 ms 7372 KB Output is correct
26 Correct 4 ms 7372 KB Output is correct
27 Correct 4 ms 7372 KB Output is correct
28 Correct 5 ms 7372 KB Output is correct
29 Correct 4 ms 7372 KB Output is correct
30 Correct 5 ms 7424 KB Output is correct
31 Correct 5 ms 7324 KB Output is correct
32 Correct 5 ms 7372 KB Output is correct
33 Correct 6 ms 7372 KB Output is correct
34 Correct 6 ms 7372 KB Output is correct
35 Correct 6 ms 7372 KB Output is correct
36 Correct 5 ms 7300 KB Output is correct
37 Correct 5 ms 7372 KB Output is correct
38 Correct 4 ms 7372 KB Output is correct
39 Correct 4 ms 7372 KB Output is correct
40 Correct 5 ms 7372 KB Output is correct
41 Correct 18 ms 7756 KB Output is correct
42 Correct 14 ms 7832 KB Output is correct
43 Correct 9 ms 7756 KB Output is correct
44 Correct 10 ms 7628 KB Output is correct
45 Correct 10 ms 7748 KB Output is correct
46 Correct 10 ms 7628 KB Output is correct
47 Correct 13 ms 7756 KB Output is correct
48 Correct 11 ms 7628 KB Output is correct
49 Correct 12 ms 7640 KB Output is correct
50 Correct 13 ms 7680 KB Output is correct
51 Correct 12 ms 7756 KB Output is correct
52 Correct 13 ms 7768 KB Output is correct
53 Correct 8 ms 7756 KB Output is correct
54 Correct 9 ms 7628 KB Output is correct
55 Correct 10 ms 7756 KB Output is correct
56 Correct 9 ms 7628 KB Output is correct
57 Correct 10 ms 7628 KB Output is correct
58 Correct 8 ms 7628 KB Output is correct
59 Correct 7 ms 7628 KB Output is correct
60 Correct 9 ms 7652 KB Output is correct
61 Correct 8 ms 7628 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 21136 KB Output is correct
2 Correct 344 ms 25688 KB Output is correct
3 Correct 476 ms 25096 KB Output is correct
4 Correct 594 ms 25072 KB Output is correct
5 Correct 459 ms 24052 KB Output is correct
6 Correct 650 ms 25028 KB Output is correct
7 Correct 180 ms 27184 KB Output is correct
8 Correct 149 ms 21188 KB Output is correct
9 Correct 193 ms 24624 KB Output is correct
10 Correct 188 ms 22040 KB Output is correct
11 Correct 447 ms 22776 KB Output is correct
12 Correct 535 ms 22780 KB Output is correct
13 Correct 346 ms 27320 KB Output is correct
14 Correct 444 ms 19352 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 21188 KB Output is correct
2 Correct 284 ms 24592 KB Output is correct
3 Correct 398 ms 24096 KB Output is correct
4 Correct 395 ms 22576 KB Output is correct
5 Correct 311 ms 22700 KB Output is correct
6 Correct 370 ms 23160 KB Output is correct
7 Correct 136 ms 21120 KB Output is correct
8 Correct 136 ms 21172 KB Output is correct
9 Correct 180 ms 21040 KB Output is correct
10 Correct 276 ms 21172 KB Output is correct
11 Correct 290 ms 21232 KB Output is correct
12 Correct 229 ms 21232 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7372 KB Output is correct
2 Correct 4 ms 7372 KB Output is correct
3 Correct 4 ms 7372 KB Output is correct
4 Correct 4 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 4 ms 7372 KB Output is correct
8 Correct 4 ms 7372 KB Output is correct
9 Correct 4 ms 7372 KB Output is correct
10 Correct 4 ms 7372 KB Output is correct
11 Correct 4 ms 7372 KB Output is correct
12 Correct 5 ms 7372 KB Output is correct
13 Correct 5 ms 7372 KB Output is correct
14 Correct 4 ms 7372 KB Output is correct
15 Correct 5 ms 7372 KB Output is correct
16 Correct 4 ms 7372 KB Output is correct
17 Correct 4 ms 7372 KB Output is correct
18 Correct 5 ms 7372 KB Output is correct
19 Correct 5 ms 7372 KB Output is correct
20 Correct 5 ms 7372 KB Output is correct
21 Correct 4 ms 7372 KB Output is correct
22 Correct 4 ms 7372 KB Output is correct
23 Correct 4 ms 7372 KB Output is correct
24 Correct 4 ms 7372 KB Output is correct
25 Correct 5 ms 7372 KB Output is correct
26 Correct 4 ms 7372 KB Output is correct
27 Correct 4 ms 7372 KB Output is correct
28 Correct 5 ms 7372 KB Output is correct
29 Correct 4 ms 7372 KB Output is correct
30 Correct 5 ms 7424 KB Output is correct
31 Correct 5 ms 7324 KB Output is correct
32 Correct 5 ms 7372 KB Output is correct
33 Correct 6 ms 7372 KB Output is correct
34 Correct 6 ms 7372 KB Output is correct
35 Correct 6 ms 7372 KB Output is correct
36 Correct 5 ms 7300 KB Output is correct
37 Correct 5 ms 7372 KB Output is correct
38 Correct 4 ms 7372 KB Output is correct
39 Correct 4 ms 7372 KB Output is correct
40 Correct 5 ms 7372 KB Output is correct
41 Correct 18 ms 7756 KB Output is correct
42 Correct 14 ms 7832 KB Output is correct
43 Correct 9 ms 7756 KB Output is correct
44 Correct 10 ms 7628 KB Output is correct
45 Correct 10 ms 7748 KB Output is correct
46 Correct 10 ms 7628 KB Output is correct
47 Correct 13 ms 7756 KB Output is correct
48 Correct 11 ms 7628 KB Output is correct
49 Correct 12 ms 7640 KB Output is correct
50 Correct 13 ms 7680 KB Output is correct
51 Correct 12 ms 7756 KB Output is correct
52 Correct 13 ms 7768 KB Output is correct
53 Correct 8 ms 7756 KB Output is correct
54 Correct 9 ms 7628 KB Output is correct
55 Correct 10 ms 7756 KB Output is correct
56 Correct 9 ms 7628 KB Output is correct
57 Correct 10 ms 7628 KB Output is correct
58 Correct 8 ms 7628 KB Output is correct
59 Correct 7 ms 7628 KB Output is correct
60 Correct 9 ms 7652 KB Output is correct
61 Correct 8 ms 7628 KB Output is correct
62 Correct 85 ms 21136 KB Output is correct
63 Correct 344 ms 25688 KB Output is correct
64 Correct 476 ms 25096 KB Output is correct
65 Correct 594 ms 25072 KB Output is correct
66 Correct 459 ms 24052 KB Output is correct
67 Correct 650 ms 25028 KB Output is correct
68 Correct 180 ms 27184 KB Output is correct
69 Correct 149 ms 21188 KB Output is correct
70 Correct 193 ms 24624 KB Output is correct
71 Correct 188 ms 22040 KB Output is correct
72 Correct 447 ms 22776 KB Output is correct
73 Correct 535 ms 22780 KB Output is correct
74 Correct 346 ms 27320 KB Output is correct
75 Correct 444 ms 19352 KB Output is correct
76 Correct 98 ms 21188 KB Output is correct
77 Correct 284 ms 24592 KB Output is correct
78 Correct 398 ms 24096 KB Output is correct
79 Correct 395 ms 22576 KB Output is correct
80 Correct 311 ms 22700 KB Output is correct
81 Correct 370 ms 23160 KB Output is correct
82 Correct 136 ms 21120 KB Output is correct
83 Correct 136 ms 21172 KB Output is correct
84 Correct 180 ms 21040 KB Output is correct
85 Correct 276 ms 21172 KB Output is correct
86 Correct 290 ms 21232 KB Output is correct
87 Correct 229 ms 21232 KB Output is correct
88 Correct 643 ms 23472 KB Output is correct
89 Correct 620 ms 22592 KB Output is correct
90 Correct 494 ms 21896 KB Output is correct
91 Correct 407 ms 23520 KB Output is correct
92 Correct 269 ms 24600 KB Output is correct
93 Correct 381 ms 24364 KB Output is correct
94 Correct 370 ms 22500 KB Output is correct
95 Correct 513 ms 22600 KB Output is correct
96 Correct 450 ms 21344 KB Output is correct
97 Correct 395 ms 21424 KB Output is correct
98 Correct 383 ms 23460 KB Output is correct
99 Correct 397 ms 23140 KB Output is correct
100 Correct 394 ms 22752 KB Output is correct
101 Correct 206 ms 22636 KB Output is correct
102 Correct 216 ms 20016 KB Output is correct
103 Correct 252 ms 19644 KB Output is correct
104 Correct 278 ms 19644 KB Output is correct
105 Correct 315 ms 19964 KB Output is correct
106 Correct 266 ms 21128 KB Output is correct
107 Correct 292 ms 21272 KB Output is correct
108 Correct 357 ms 22076 KB Output is correct
109 Correct 291 ms 27284 KB Output is correct
110 Correct 331 ms 20520 KB Output is correct
111 Correct 295 ms 20020 KB Output is correct
112 Correct 230 ms 20408 KB Output is correct
113 Correct 308 ms 21244 KB Output is correct
114 Correct 284 ms 21232 KB Output is correct
115 Correct 138 ms 21124 KB Output is correct
116 Correct 140 ms 21164 KB Output is correct
117 Correct 170 ms 21124 KB Output is correct
118 Correct 166 ms 21088 KB Output is correct
119 Correct 231 ms 21168 KB Output is correct
120 Correct 216 ms 21112 KB Output is correct