oj.uz

Submission #421139

# Submission time Handle Problem Language Result Execution time Memory
421139 2021-06-08T18:51:49 Z Mamedov Financial Report (JOI21_financial) C++17
100 / 100
 393 ms 12684 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define piii pair<int, pii>
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define ui unsigned int
#define ull unsigned long long
#define f first
#define s second
#define oo 1000000000

using namespace std;


const int up = 3e5 + 5;
int tree[up << 2];

void update(int node, int l, int r, int pos, int val) {
    if(l == r) {
        tree[node] = val;
    }else {
        int mid = (l + r) >> 1;
        if(pos <= mid) {
            update(node << 1, l, mid, pos, val);
        }else {
            update((node << 1) | 1, mid + 1, r, pos, val);
        }
        tree[node] = max(tree[node << 1], tree[(node << 1) | 1]);
    }
}

int Max(int node, int l, int r, int ql, int qr) {
    if(ql > qr || l > qr || ql > r) return 0;
    if(ql <= l && r <= qr) {
        return tree[node];
    }else {
        int mid = (l + r) >> 1;
        return max(Max(node << 1, l, mid, ql, qr), Max((node << 1) | 1, mid + 1, r, ql, qr));
    }
}

bool cmp(pii p1, pii p2) {
    if(p1.f == p2.f) return p1.s > p2.s;
    else return p1.f < p2.f;
}
void solve() {
    int n, d;
    cin >> n >> d;
    vector<pii>a(n);
    vector<int>dp(n, 1);
    for(int i = 0; i < n; ++i) {
        cin >> a[i].f;
        a[i].s = i;
    }
    sort(a.begin(), a.end());
    set<pii>ranges;
    vector<int>to_left(n);
    for(int i = 0; i < n; ++i) {
        int idx = a[i].s;
        pii cur = {idx, idx + d};
        auto itr = ranges.upper_bound(cur);
        if(itr != ranges.end() && itr->f <= cur.s) {
            cur.s = max(cur.s, itr->s);
            ranges.erase(itr);
        }
        itr = ranges.upper_bound(cur);
        if(itr != ranges.begin()) {
            --itr;
            if(itr->s >= cur.f) {
                cur.f = itr->f;
                cur.s = max(itr->s, cur.s);
                ranges.erase(itr);
            }
        }
        to_left[idx] = cur.f;
        ranges.insert(cur);
    }
    sort(a.begin(), a.end(), cmp);
    int res = 0;
    for(int i = 0; i < n; ++i) {
        int idx = a[i].s;
        dp[idx] = Max(1, 0, n - 1, to_left[idx], idx - 1) + 1;
        update(1, 0, n - 1, idx, dp[idx]);
        //cout << "for " << idx << " " << dp[idx] << '\n';
        res = max(res, dp[idx]);
    }
    cout << res << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    solve();
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 9040 KB Output is correct
2 Correct 282 ms 12684 KB Output is correct
3 Correct 333 ms 12528 KB Output is correct
4 Correct 388 ms 12536 KB Output is correct
5 Correct 324 ms 11852 KB Output is correct
6 Correct 393 ms 12632 KB Output is correct
7 Correct 177 ms 9304 KB Output is correct
8 Correct 116 ms 9084 KB Output is correct
9 Correct 166 ms 9100 KB Output is correct
10 Correct 149 ms 9092 KB Output is correct
11 Correct 299 ms 9336 KB Output is correct
12 Correct 324 ms 9436 KB Output is correct
13 Correct 310 ms 9136 KB Output is correct
14 Correct 273 ms 9340 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 9092 KB Output is correct
2 Correct 329 ms 9116 KB Output is correct
3 Correct 267 ms 9092 KB Output is correct
4 Correct 311 ms 9156 KB Output is correct
5 Correct 304 ms 9108 KB Output is correct
6 Correct 266 ms 9028 KB Output is correct
7 Correct 176 ms 9084 KB Output is correct
8 Correct 117 ms 9028 KB Output is correct
9 Correct 181 ms 9000 KB Output is correct
10 Correct 223 ms 9092 KB Output is correct
11 Correct 252 ms 9116 KB Output is correct
12 Correct 269 ms 9116 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 7 ms 460 KB Output is correct
42 Correct 6 ms 460 KB Output is correct
43 Correct 5 ms 460 KB Output is correct
44 Correct 5 ms 460 KB Output is correct
45 Correct 4 ms 460 KB Output is correct
46 Correct 6 ms 492 KB Output is correct
47 Correct 5 ms 460 KB Output is correct
48 Correct 6 ms 460 KB Output is correct
49 Correct 5 ms 460 KB Output is correct
50 Correct 5 ms 460 KB Output is correct
51 Correct 6 ms 460 KB Output is correct
52 Correct 6 ms 460 KB Output is correct
53 Correct 4 ms 460 KB Output is correct
54 Correct 4 ms 460 KB Output is correct
55 Correct 6 ms 460 KB Output is correct
56 Correct 4 ms 460 KB Output is correct
57 Correct 5 ms 492 KB Output is correct
58 Correct 4 ms 460 KB Output is correct
59 Correct 4 ms 460 KB Output is correct
60 Correct 4 ms 460 KB Output is correct
61 Correct 4 ms 492 KB Output is correct
62 Correct 176 ms 9040 KB Output is correct
63 Correct 282 ms 12684 KB Output is correct
64 Correct 333 ms 12528 KB Output is correct
65 Correct 388 ms 12536 KB Output is correct
66 Correct 324 ms 11852 KB Output is correct
67 Correct 393 ms 12632 KB Output is correct
68 Correct 177 ms 9304 KB Output is correct
69 Correct 116 ms 9084 KB Output is correct
70 Correct 166 ms 9100 KB Output is correct
71 Correct 149 ms 9092 KB Output is correct
72 Correct 299 ms 9336 KB Output is correct
73 Correct 324 ms 9436 KB Output is correct
74 Correct 310 ms 9136 KB Output is correct
75 Correct 273 ms 9340 KB Output is correct
76 Correct 210 ms 9092 KB Output is correct
77 Correct 329 ms 9116 KB Output is correct
78 Correct 267 ms 9092 KB Output is correct
79 Correct 311 ms 9156 KB Output is correct
80 Correct 304 ms 9108 KB Output is correct
81 Correct 266 ms 9028 KB Output is correct
82 Correct 176 ms 9084 KB Output is correct
83 Correct 117 ms 9028 KB Output is correct
84 Correct 181 ms 9000 KB Output is correct
85 Correct 223 ms 9092 KB Output is correct
86 Correct 252 ms 9116 KB Output is correct
87 Correct 269 ms 9116 KB Output is correct
88 Correct 373 ms 11260 KB Output is correct
89 Correct 358 ms 10564 KB Output is correct
90 Correct 342 ms 9652 KB Output is correct
91 Correct 303 ms 9156 KB Output is correct
92 Correct 253 ms 9092 KB Output is correct
93 Correct 309 ms 9284 KB Output is correct
94 Correct 316 ms 9224 KB Output is correct
95 Correct 338 ms 10780 KB Output is correct
96 Correct 311 ms 9608 KB Output is correct
97 Correct 330 ms 9232 KB Output is correct
98 Correct 289 ms 9080 KB Output is correct
99 Correct 332 ms 9028 KB Output is correct
100 Correct 270 ms 9284 KB Output is correct
101 Correct 169 ms 9096 KB Output is correct
102 Correct 184 ms 9100 KB Output is correct
103 Correct 199 ms 9100 KB Output is correct
104 Correct 208 ms 8992 KB Output is correct
105 Correct 226 ms 9028 KB Output is correct
106 Correct 242 ms 9156 KB Output is correct
107 Correct 268 ms 9020 KB Output is correct
108 Correct 285 ms 9084 KB Output is correct
109 Correct 282 ms 9156 KB Output is correct
110 Correct 271 ms 9224 KB Output is correct
111 Correct 300 ms 9160 KB Output is correct
112 Correct 217 ms 9016 KB Output is correct
113 Correct 243 ms 9028 KB Output is correct
114 Correct 306 ms 9212 KB Output is correct
115 Correct 173 ms 9028 KB Output is correct
116 Correct 172 ms 9096 KB Output is correct
117 Correct 194 ms 9028 KB Output is correct
118 Correct 197 ms 9236 KB Output is correct
119 Correct 214 ms 9092 KB Output is correct
120 Correct 217 ms 9100 KB Output is correct