oj.uz

답안 #680995

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680995 2023-01-12T08:19:17 Z jhwest2 Financial Report (JOI21_financial) C++17
100 / 100
 362 ms 15324 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 303030;
int n, d, a[N], p[N], rr[N];

struct seg {
    int tree[N * 4];

    void update(int a, int v, int l, int r, int x) {
        if (l == r) {
            tree[x] = v;
            return;
        }
        int m = (l + r) / 2;
        if (a <= m)
            update(a, v, l, m, 2 * x);
        else 
            update(a, v, m + 1, r, 2 * x + 1);
        tree[x] = max(tree[2 * x], tree[2 * x + 1]);
    }
    int query(int a, int b, int l, int r, int x) {
        if (b < l || a > r)
            return 0;
        if (a <= l && r <= b)
            return tree[x];
        int m = (l + r) / 2;
        return max(query(a, b, l, m, 2 * x), query(a, b, m + 1, r, 2 * x + 1));
    }
} t1;

int par[N], sz[N], dp[N];
bool chk[N];

void init() {
    iota(par, par + N, 0);
}
int Find(int a) {
    return par[a] = ((par[a] == a) ? a : Find(par[a]));
}
void Union(int a, int b) {
    a = Find(a); b = Find(b);
    if (a != b) {
        par[b] = a;
        sz[a] += sz[b];
    }
}

int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);
    cin >> n >> d;
    vector<int> v;
    for (int i = 1; i <= n; i++) 
        cin >> a[i];
    
    for (int i = 1; i <= n; i++)
        p[i] = i;
    sort(p + 1, p + 1 + n, [&](auto i, auto j) {
        return a[i] > a[j];
    });

    init();
    set<int> st; // stores first positions for length >= d segments
    for (int i = 1, j = 1; i <= n; i = j) {
        while (j <= n && a[p[i]] == a[p[j]])
            ++j;

        // cout << i << ' ' << j << '\n';
        // for (int x : st)
        //     cout << x << ' ';
        // cout << "!\n";

        for (int k = i; k < j; k++) {
            auto it = st.lower_bound(p[k]);
            if (it == st.end())
                rr[p[k]] = n;
            else 
                rr[p[k]] = min(n, *it + d - 1);
        }

        for (int k = i; k < j; k++) {
            int x = p[k];
            chk[x] = 1;
            sz[x] = 1;
            if (d == 1)
                st.insert(x);

            if (x > 1 && chk[x - 1]) {
                int a = Find(x - 1);
                int b = Find(x);

                if (a != b) {
                    if (sz[b] >= d)
                        st.erase(b);

                    bool f = false;
                    if (sz[a] < d)
                        f = true;

                    Union(a, b);
                    if (f && sz[a] >= d)
                        st.insert(a);
                }
            }
            if (x < n && chk[x + 1]) {
                int a = Find(x);
                int b = Find(x + 1);

                if (a != b) {
                    if (sz[b] >= d) 
                        st.erase(b);
                    
                    bool f = false;
                    if (sz[a] < d)
                        f = true;

                    Union(a, b);
                    if (f && sz[a] >= d)
                        st.insert(a);
                }
            }
        }
    }
        
    for (int i = 1, j = 1; i <= n; i = j) {
        while (j <= n && a[p[i]] == a[p[j]])
            ++j;

        for (int k = i; k < j; k++) 
            dp[p[k]] = t1.query(p[k] + 1, rr[p[k]], 1, n, 1) + 1;
        for (int k = i; k < j; k++) 
            t1.update(p[k], dp[p[k]], 1, n, 1);
    }
    cout << *max_element(dp + 1, dp + 1 + n);
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1524 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 1492 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1492 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 1492 KB Output is correct
22 Correct 1 ms 1492 KB Output is correct
23 Correct 1 ms 1492 KB Output is correct
24 Correct 1 ms 1492 KB Output is correct
25 Correct 1 ms 1492 KB Output is correct
26 Correct 1 ms 1492 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1524 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 1492 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1492 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 1492 KB Output is correct
22 Correct 1 ms 1492 KB Output is correct
23 Correct 1 ms 1492 KB Output is correct
24 Correct 1 ms 1492 KB Output is correct
25 Correct 1 ms 1492 KB Output is correct
26 Correct 1 ms 1492 KB Output is correct
27 Correct 1 ms 1492 KB Output is correct
28 Correct 1 ms 1492 KB Output is correct
29 Correct 1 ms 1492 KB Output is correct
30 Correct 1 ms 1492 KB Output is correct
31 Correct 1 ms 1492 KB Output is correct
32 Correct 1 ms 1492 KB Output is correct
33 Correct 1 ms 1492 KB Output is correct
34 Correct 1 ms 1492 KB Output is correct
35 Correct 1 ms 1492 KB Output is correct
36 Correct 1 ms 1492 KB Output is correct
37 Correct 1 ms 1492 KB Output is correct
38 Correct 1 ms 1492 KB Output is correct
39 Correct 1 ms 1492 KB Output is correct
40 Correct 1 ms 1492 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1524 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 1492 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1492 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 1492 KB Output is correct
22 Correct 1 ms 1492 KB Output is correct
23 Correct 1 ms 1492 KB Output is correct
24 Correct 1 ms 1492 KB Output is correct
25 Correct 1 ms 1492 KB Output is correct
26 Correct 1 ms 1492 KB Output is correct
27 Correct 1 ms 1492 KB Output is correct
28 Correct 1 ms 1492 KB Output is correct
29 Correct 1 ms 1492 KB Output is correct
30 Correct 1 ms 1492 KB Output is correct
31 Correct 1 ms 1492 KB Output is correct
32 Correct 1 ms 1492 KB Output is correct
33 Correct 1 ms 1492 KB Output is correct
34 Correct 1 ms 1492 KB Output is correct
35 Correct 1 ms 1492 KB Output is correct
36 Correct 1 ms 1492 KB Output is correct
37 Correct 1 ms 1492 KB Output is correct
38 Correct 1 ms 1492 KB Output is correct
39 Correct 1 ms 1492 KB Output is correct
40 Correct 1 ms 1492 KB Output is correct
41 Correct 6 ms 1748 KB Output is correct
42 Correct 7 ms 1748 KB Output is correct
43 Correct 4 ms 1748 KB Output is correct
44 Correct 4 ms 1620 KB Output is correct
45 Correct 4 ms 1620 KB Output is correct
46 Correct 4 ms 1748 KB Output is correct
47 Correct 4 ms 1748 KB Output is correct
48 Correct 4 ms 1748 KB Output is correct
49 Correct 4 ms 1760 KB Output is correct
50 Correct 4 ms 1748 KB Output is correct
51 Correct 5 ms 1748 KB Output is correct
52 Correct 5 ms 1748 KB Output is correct
53 Correct 3 ms 1748 KB Output is correct
54 Correct 4 ms 1636 KB Output is correct
55 Correct 5 ms 1876 KB Output is correct
56 Correct 4 ms 1760 KB Output is correct
57 Correct 4 ms 1748 KB Output is correct
58 Correct 3 ms 1748 KB Output is correct
59 Correct 3 ms 1748 KB Output is correct
60 Correct 3 ms 1748 KB Output is correct
61 Correct 5 ms 1748 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 11760 KB Output is correct
2 Correct 219 ms 15240 KB Output is correct
3 Correct 330 ms 15228 KB Output is correct
4 Correct 362 ms 15324 KB Output is correct
5 Correct 277 ms 14280 KB Output is correct
6 Correct 349 ms 15264 KB Output is correct
7 Correct 117 ms 11664 KB Output is correct
8 Correct 135 ms 11664 KB Output is correct
9 Correct 125 ms 11720 KB Output is correct
10 Correct 132 ms 11760 KB Output is correct
11 Correct 254 ms 11944 KB Output is correct
12 Correct 261 ms 12092 KB Output is correct
13 Correct 215 ms 11876 KB Output is correct
14 Correct 259 ms 11964 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 11852 KB Output is correct
2 Correct 193 ms 11788 KB Output is correct
3 Correct 170 ms 11912 KB Output is correct
4 Correct 231 ms 11724 KB Output is correct
5 Correct 186 ms 11788 KB Output is correct
6 Correct 213 ms 11880 KB Output is correct
7 Correct 98 ms 11780 KB Output is correct
8 Correct 108 ms 11724 KB Output is correct
9 Correct 136 ms 11728 KB Output is correct
10 Correct 147 ms 11720 KB Output is correct
11 Correct 234 ms 11724 KB Output is correct
12 Correct 149 ms 11776 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1524 KB Output is correct
4 Correct 1 ms 1492 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Correct 2 ms 1492 KB Output is correct
9 Correct 2 ms 1492 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 2 ms 1492 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 1492 KB Output is correct
14 Correct 1 ms 1492 KB Output is correct
15 Correct 1 ms 1492 KB Output is correct
16 Correct 1 ms 1492 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 1492 KB Output is correct
22 Correct 1 ms 1492 KB Output is correct
23 Correct 1 ms 1492 KB Output is correct
24 Correct 1 ms 1492 KB Output is correct
25 Correct 1 ms 1492 KB Output is correct
26 Correct 1 ms 1492 KB Output is correct
27 Correct 1 ms 1492 KB Output is correct
28 Correct 1 ms 1492 KB Output is correct
29 Correct 1 ms 1492 KB Output is correct
30 Correct 1 ms 1492 KB Output is correct
31 Correct 1 ms 1492 KB Output is correct
32 Correct 1 ms 1492 KB Output is correct
33 Correct 1 ms 1492 KB Output is correct
34 Correct 1 ms 1492 KB Output is correct
35 Correct 1 ms 1492 KB Output is correct
36 Correct 1 ms 1492 KB Output is correct
37 Correct 1 ms 1492 KB Output is correct
38 Correct 1 ms 1492 KB Output is correct
39 Correct 1 ms 1492 KB Output is correct
40 Correct 1 ms 1492 KB Output is correct
41 Correct 6 ms 1748 KB Output is correct
42 Correct 7 ms 1748 KB Output is correct
43 Correct 4 ms 1748 KB Output is correct
44 Correct 4 ms 1620 KB Output is correct
45 Correct 4 ms 1620 KB Output is correct
46 Correct 4 ms 1748 KB Output is correct
47 Correct 4 ms 1748 KB Output is correct
48 Correct 4 ms 1748 KB Output is correct
49 Correct 4 ms 1760 KB Output is correct
50 Correct 4 ms 1748 KB Output is correct
51 Correct 5 ms 1748 KB Output is correct
52 Correct 5 ms 1748 KB Output is correct
53 Correct 3 ms 1748 KB Output is correct
54 Correct 4 ms 1636 KB Output is correct
55 Correct 5 ms 1876 KB Output is correct
56 Correct 4 ms 1760 KB Output is correct
57 Correct 4 ms 1748 KB Output is correct
58 Correct 3 ms 1748 KB Output is correct
59 Correct 3 ms 1748 KB Output is correct
60 Correct 3 ms 1748 KB Output is correct
61 Correct 5 ms 1748 KB Output is correct
62 Correct 109 ms 11760 KB Output is correct
63 Correct 219 ms 15240 KB Output is correct
64 Correct 330 ms 15228 KB Output is correct
65 Correct 362 ms 15324 KB Output is correct
66 Correct 277 ms 14280 KB Output is correct
67 Correct 349 ms 15264 KB Output is correct
68 Correct 117 ms 11664 KB Output is correct
69 Correct 135 ms 11664 KB Output is correct
70 Correct 125 ms 11720 KB Output is correct
71 Correct 132 ms 11760 KB Output is correct
72 Correct 254 ms 11944 KB Output is correct
73 Correct 261 ms 12092 KB Output is correct
74 Correct 215 ms 11876 KB Output is correct
75 Correct 259 ms 11964 KB Output is correct
76 Correct 103 ms 11852 KB Output is correct
77 Correct 193 ms 11788 KB Output is correct
78 Correct 170 ms 11912 KB Output is correct
79 Correct 231 ms 11724 KB Output is correct
80 Correct 186 ms 11788 KB Output is correct
81 Correct 213 ms 11880 KB Output is correct
82 Correct 98 ms 11780 KB Output is correct
83 Correct 108 ms 11724 KB Output is correct
84 Correct 136 ms 11728 KB Output is correct
85 Correct 147 ms 11720 KB Output is correct
86 Correct 234 ms 11724 KB Output is correct
87 Correct 149 ms 11776 KB Output is correct
88 Correct 265 ms 13836 KB Output is correct
89 Correct 271 ms 13160 KB Output is correct
90 Correct 223 ms 12332 KB Output is correct
91 Correct 194 ms 11752 KB Output is correct
92 Correct 161 ms 11792 KB Output is correct
93 Correct 179 ms 11784 KB Output is correct
94 Correct 230 ms 11780 KB Output is correct
95 Correct 256 ms 13580 KB Output is correct
96 Correct 212 ms 12388 KB Output is correct
97 Correct 281 ms 11880 KB Output is correct
98 Correct 231 ms 11860 KB Output is correct
99 Correct 231 ms 11756 KB Output is correct
100 Correct 234 ms 11796 KB Output is correct
101 Correct 122 ms 11676 KB Output is correct
102 Correct 134 ms 11668 KB Output is correct
103 Correct 164 ms 11700 KB Output is correct
104 Correct 165 ms 11724 KB Output is correct
105 Correct 200 ms 11696 KB Output is correct
106 Correct 143 ms 11724 KB Output is correct
107 Correct 162 ms 11688 KB Output is correct
108 Correct 199 ms 11868 KB Output is correct
109 Correct 200 ms 11812 KB Output is correct
110 Correct 223 ms 12016 KB Output is correct
111 Correct 226 ms 11860 KB Output is correct
112 Correct 143 ms 11752 KB Output is correct
113 Correct 205 ms 11784 KB Output is correct
114 Correct 232 ms 11784 KB Output is correct
115 Correct 112 ms 11720 KB Output is correct
116 Correct 101 ms 11708 KB Output is correct
117 Correct 126 ms 11748 KB Output is correct
118 Correct 134 ms 11792 KB Output is correct
119 Correct 158 ms 11800 KB Output is correct
120 Correct 151 ms 11772 KB Output is correct