oj.uz

Submission #679783

# Submission time Handle Problem Language Result Execution time Memory
679783 2023-01-09T08:02:16 Z bashkort Financial Report (JOI21_financial) C++17
100 / 100
 335 ms 12920 KB 
//#define _GLIBCXX_DEBUG

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

using namespace std;


#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

#define ll long long
#define trace(x) cout << #x << " = " << (x) << endl;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define uniq(x) x.resize(unique(all(x)) -  begin(x))
#define ld long double
#define sz(s) (int) size(s)
#define pii pair<int, int>
#define mp(x, y) make_pair(x, y)
#define mt make_tuple
#define int128 __int128

template<typename T>
bool ckmn(T &x, T y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template<typename T>
bool ckmx(T &x, T y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

int bit(int x, int b) {
    return (x >> b) & 1;
}


int rand(int l, int r) { return (int) ((ll) rnd() % (r - l + 1)) + l; }

const ll infL = 3e18;
const int infI = 1e9 + 7;
const int N = 300000;
const ll mod = 998244353;
const ld eps = 1e-9;

vector<int> t;
int sz = 1;

void init(int n) {
    while (sz < n) sz <<= 1;
    t.resize(sz << 1);
    fill(all(t), -infI);
}

void Set(int i, int v) {
    int x = i + sz;
    while (x) {
        ckmx(t[x], v);
        x >>= 1;
    }
}

int get(int l, int r, int x = 1, int lx = 0, int rx = sz) {
    if (l >= rx || lx >= r) return -infI;
    if (l <= lx && rx <= r) return t[x];
    int m = (lx + rx) >> 1;
    return max(get(l, r, x << 1, lx, m), get(l, r, x << 1 | 1, m, rx));
}


int n, d;

set <pair<int, int>> st; //l, r
int get(int x) {
    auto it = st.upper_bound(mp(x, infI));
    if (it == st.begin()) return 0;
    it = prev(it);
    auto[L, R] = *it;
    if (R < x) {
        return R - d + 1;
    }
    if (x - L >= d) return x - d;
    else {
        if (it == st.begin()) return 0;
        else {
            it = prev(it);
            auto [l, r] = *it;
            int y = r - d + 1;
            assert(l <= y && y <= r);
            assert(0 <= y);
            return y;
        }
    }
}

void del(int x) {
    auto it = st.upper_bound(mp(x, infI));
    if (it == st.begin()) return;
    assert(it != st.begin());
    it = prev(it);
    auto[L, R] = *it;
    if (R < x) return;
    st.erase(it);
    int RR = x - 1, LL = x + 1;
    if (RR - L + 1 >= d) st.insert(mp(L, RR));
    if (R - LL + 1 >= d) st.insert(mp(LL, R));
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> d;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    vector<int> yy = a;
    sort(all(yy));
    uniq(yy);
    for (int i = 0; i < n; ++i) a[i] = lower_bound(all(yy), a[i]) - begin(yy);
    vector<int> ord(n);
    iota(all(ord), 0);
    sort(all(ord), [&a](int i, int j) { return a[i] < a[j]; });
    if (d == 1) {
        vector<int> ans(n);
        vector<int> st;
        for (int i = n - 1; i > -1; --i) {
            while (!st.empty() && a[st.back()] <= a[i]) st.pop_back();
            if (st.empty()) ans[i] = 1;
            else ans[i] = ans[st.back()] + 1;
            st.push_back(i);
        }
        cout << *max_element(all(ans));
    } else if (d == n) {
        init(n);
        for (int i = 0; i < n; ++i) {
            int mx = max(0, get(0, a[i])) + 1;
            Set(a[i], mx);
        }
        cout << t[1];
        return 0;
    } else {
        init(n);
        st.insert(mp(0, n - 1));
        //r, l
        for (int idx = 0; idx < n;) {
            vector<int> now;
            int J = idx;
            while (J < n && a[ord[J]] == a[ord[idx]]) {
//                trace(a[ord[J]])

                now.push_back(ord[J]);
                ++J;
            }
            idx = J;
            vector<int> ans;
            for (int i : now) {
                int l = get(i);
                ans.push_back(max(0, get(l, i)) + 1);
            }
            for (int j = 0; j < sz(now); ++j) {
                int i = now[j];
                Set(i, ans[j]);
                del(i);
            }
        }
        cout << t[1];
    }
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 7876 KB Output is correct
2 Correct 53 ms 7496 KB Output is correct
3 Correct 74 ms 7864 KB Output is correct
4 Correct 135 ms 7928 KB Output is correct
5 Correct 104 ms 7896 KB Output is correct
6 Correct 122 ms 7868 KB Output is correct
7 Correct 59 ms 10044 KB Output is correct
8 Correct 53 ms 8012 KB Output is correct
9 Correct 61 ms 9048 KB Output is correct
10 Correct 64 ms 7888 KB Output is correct
11 Correct 101 ms 7880 KB Output is correct
12 Correct 107 ms 7900 KB Output is correct
13 Correct 96 ms 7900 KB Output is correct
14 Correct 117 ms 7876 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 11084 KB Output is correct
2 Correct 113 ms 10696 KB Output is correct
3 Correct 151 ms 10848 KB Output is correct
4 Correct 187 ms 10832 KB Output is correct
5 Correct 163 ms 10832 KB Output is correct
6 Correct 182 ms 10856 KB Output is correct
7 Correct 99 ms 10832 KB Output is correct
8 Correct 103 ms 10828 KB Output is correct
9 Correct 113 ms 10820 KB Output is correct
10 Correct 153 ms 10700 KB Output is correct
11 Correct 174 ms 10952 KB Output is correct
12 Correct 147 ms 10824 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 320 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 324 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 6 ms 468 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 4 ms 468 KB Output is correct
45 Correct 4 ms 468 KB Output is correct
46 Correct 4 ms 468 KB Output is correct
47 Correct 5 ms 468 KB Output is correct
48 Correct 5 ms 460 KB Output is correct
49 Correct 5 ms 468 KB Output is correct
50 Correct 4 ms 468 KB Output is correct
51 Correct 2 ms 472 KB Output is correct
52 Correct 6 ms 548 KB Output is correct
53 Correct 3 ms 468 KB Output is correct
54 Correct 4 ms 464 KB Output is correct
55 Correct 4 ms 468 KB Output is correct
56 Correct 4 ms 420 KB Output is correct
57 Correct 4 ms 484 KB Output is correct
58 Correct 3 ms 468 KB Output is correct
59 Correct 3 ms 468 KB Output is correct
60 Correct 4 ms 464 KB Output is correct
61 Correct 3 ms 468 KB Output is correct
62 Correct 40 ms 7876 KB Output is correct
63 Correct 53 ms 7496 KB Output is correct
64 Correct 74 ms 7864 KB Output is correct
65 Correct 135 ms 7928 KB Output is correct
66 Correct 104 ms 7896 KB Output is correct
67 Correct 122 ms 7868 KB Output is correct
68 Correct 59 ms 10044 KB Output is correct
69 Correct 53 ms 8012 KB Output is correct
70 Correct 61 ms 9048 KB Output is correct
71 Correct 64 ms 7888 KB Output is correct
72 Correct 101 ms 7880 KB Output is correct
73 Correct 107 ms 7900 KB Output is correct
74 Correct 96 ms 7900 KB Output is correct
75 Correct 117 ms 7876 KB Output is correct
76 Correct 62 ms 11084 KB Output is correct
77 Correct 113 ms 10696 KB Output is correct
78 Correct 151 ms 10848 KB Output is correct
79 Correct 187 ms 10832 KB Output is correct
80 Correct 163 ms 10832 KB Output is correct
81 Correct 182 ms 10856 KB Output is correct
82 Correct 99 ms 10832 KB Output is correct
83 Correct 103 ms 10828 KB Output is correct
84 Correct 113 ms 10820 KB Output is correct
85 Correct 153 ms 10700 KB Output is correct
86 Correct 174 ms 10952 KB Output is correct
87 Correct 147 ms 10824 KB Output is correct
88 Correct 315 ms 12920 KB Output is correct
89 Correct 335 ms 12392 KB Output is correct
90 Correct 257 ms 11416 KB Output is correct
91 Correct 210 ms 10824 KB Output is correct
92 Correct 124 ms 10988 KB Output is correct
93 Correct 161 ms 10884 KB Output is correct
94 Correct 204 ms 10864 KB Output is correct
95 Correct 306 ms 12496 KB Output is correct
96 Correct 262 ms 11348 KB Output is correct
97 Correct 246 ms 11088 KB Output is correct
98 Correct 213 ms 10828 KB Output is correct
99 Correct 215 ms 10820 KB Output is correct
100 Correct 208 ms 10828 KB Output is correct
101 Correct 147 ms 10824 KB Output is correct
102 Correct 139 ms 10848 KB Output is correct
103 Correct 155 ms 10852 KB Output is correct
104 Correct 169 ms 10956 KB Output is correct
105 Correct 187 ms 10840 KB Output is correct
106 Correct 193 ms 10860 KB Output is correct
107 Correct 222 ms 10956 KB Output is correct
108 Correct 229 ms 10864 KB Output is correct
109 Correct 242 ms 10948 KB Output is correct
110 Correct 241 ms 11200 KB Output is correct
111 Correct 217 ms 10948 KB Output is correct
112 Correct 174 ms 10852 KB Output is correct
113 Correct 206 ms 10828 KB Output is correct
114 Correct 197 ms 10828 KB Output is correct
115 Correct 124 ms 10948 KB Output is correct
116 Correct 127 ms 10852 KB Output is correct
117 Correct 182 ms 10832 KB Output is correct
118 Correct 184 ms 10844 KB Output is correct
119 Correct 183 ms 10876 KB Output is correct
120 Correct 181 ms 10856 KB Output is correct