oj.uz

Submission #815207

# Submission time Handle Problem Language Result Execution time Memory
815207 2023-08-08T13:12:38 Z RecursiveCo Financial Report (JOI21_financial) C++14
100 / 100
 689 ms 96448 KB 
// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

#define int long long int

vector<int> tree;
int n;

void upd(int i, int x, int l = 0, int r = n - 1, int v = 1) {
    if (l == r) {
        tree[v] = x;
    } else {
        int middle = (l + r) / 2;
        if (i <= middle) {
            upd(i, x, l, middle, 2 * v);
        } else {
            upd(i, x, middle + 1, r, 2 * v + 1);
        }
        tree[v] = max(tree[2 * v], tree[2 * v + 1]);
    }
}

int rq(int ql, int qr, int l = 0, int r = n - 1, int v = 1) {
    if (ql <= l && r <= qr) {
        return tree[v];
    } else if (qr < l || r < ql) {
        return 0;
    } else {
        int middle = (l + r) / 2;
        int left = rq(ql, qr, l, middle, 2 * v);
        int right = rq(ql, qr, middle + 1, r, 2 * v + 1);
        return max(left, right);
    }
}

int query(vector<vector<int>>& sparse, int l, int r) {
    int sz = r - l + 1;
    int lg = 0;
    int p = 1;
    while (p <= sz) {
        p *= 2;
        lg++;
    }
    p /= 2;
    lg--;
    int left = sparse[l][lg];
    int right = sparse[r - p + 1][lg];
    return max(left, right);
}

signed main() {
    improvePerformance;

    cin >> n;
    get(d);
    getList(n, nums);
    vector<int> minimums(n, 1e18);
    multiset<int> window;
    forto(d, i) window.insert(nums[n - i - 1]);
    for (int i = n - 1; i >= d - 1; i--) {
        minimums[i] = *window.begin();
        window.erase(window.find(nums[i]));
        if (i != d - 1) window.insert(nums[i - d]);
    }
    vector<vector<int>> sparse(n, vector<int>(19, 0));
    for (int i = n - 1; i >= 0; i--) {
        sparse[i][0] = minimums[i];
        int p = 2;
        forto(19, j) {
            if (j == 0) continue;
            if (i + p > n) break;
            sparse[i][j] = max(sparse[i][j - 1], sparse[i + p / 2][j - 1]);
            p *= 2;
        }
    }
    vector<int> dp;
    forto(n, i) dp.push_back(0);
    tree.resize(4 * n, 0);
    vector<pair<int, int>> sorted;
    forto(n, i) sorted.push_back({nums[i], i});
    sortl(sorted);
    for (int j = n - 1; j >= 0; j--) {
        int i = sorted[j].second;
        
            // what's the smallest index j such that j >= i+d and minimums[j] > a[i]?
            // then we can take any element in between.
            // (sparse table for the first part)
            // what about the second part, "taking any element in between"?
            int l = min(i + d, n);
            int r = n;
            while (r - l >= 1) {
                int middle = (l + r) / 2;
                if (query(sparse, i + d, middle) <= nums[i]) l = middle + 1;
                else r = middle;
            }
            
            int maximum = rq(i + 1, min(l, n - 1));
            dp[i] = maximum + 1;
        
        if (j != 0 && sorted[j].first != sorted[j - 1].first) {
            int m = j;
            while (m <= n - 1 && sorted[m].first == sorted[j].first) {
                int ind = sorted[m].second;
                upd(ind, dp[ind]);
                m++;
            }
        }
    }
    out(*max_element(dp.begin(), dp.end()));
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'd' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:69:5: note: in expansion of macro 'get'
   69 |     get(d);
      |     ^~~
Main.cpp:12:40: warning: unnecessary parentheses in declaration of 'nums' [-Wparentheses]
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                        ^
Main.cpp:70:5: note: in expansion of macro 'getList'
   70 |     getList(n, nums);
      |     ^~~~~~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'a' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:12:76: note: in expansion of macro 'get'
   12 | #define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
      |                                                                            ^~~
Main.cpp:70:5: note: in expansion of macro 'getList'
   70 |     getList(n, nums);
      |     ^~~~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:73:5: note: in expansion of macro 'forto'
   73 |     forto(d, i) window.insert(nums[n - i - 1]);
      |     ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:83:9: note: in expansion of macro 'forto'
   83 |         forto(19, j) {
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:91:5: note: in expansion of macro 'forto'
   91 |     forto(n, i) dp.push_back(0);
      |     ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:94:5: note: in expansion of macro 'forto'
   94 |     forto(n, i) sorted.push_back({nums[i], i});
      |     ^~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 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 0 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 0 ms 212 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 0 ms 212 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 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 0 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 0 ms 212 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 452 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 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 0 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 0 ms 212 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 452 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 5 ms 2260 KB Output is correct
42 Correct 5 ms 2260 KB Output is correct
43 Correct 5 ms 2192 KB Output is correct
44 Correct 7 ms 2004 KB Output is correct
45 Correct 5 ms 2124 KB Output is correct
46 Correct 5 ms 2516 KB Output is correct
47 Correct 5 ms 2132 KB Output is correct
48 Correct 6 ms 2132 KB Output is correct
49 Correct 6 ms 2260 KB Output is correct
50 Correct 6 ms 2300 KB Output is correct
51 Correct 5 ms 2260 KB Output is correct
52 Correct 5 ms 2248 KB Output is correct
53 Correct 4 ms 2260 KB Output is correct
54 Correct 6 ms 2260 KB Output is correct
55 Correct 6 ms 2260 KB Output is correct
56 Correct 5 ms 2260 KB Output is correct
57 Correct 5 ms 2260 KB Output is correct
58 Correct 4 ms 2516 KB Output is correct
59 Correct 4 ms 2576 KB Output is correct
60 Correct 5 ms 2260 KB Output is correct
61 Correct 5 ms 2252 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 82028 KB Output is correct
2 Correct 357 ms 81632 KB Output is correct
3 Correct 579 ms 81936 KB Output is correct
4 Correct 661 ms 81984 KB Output is correct
5 Correct 433 ms 81968 KB Output is correct
6 Correct 627 ms 81960 KB Output is correct
7 Correct 212 ms 81452 KB Output is correct
8 Correct 218 ms 81760 KB Output is correct
9 Correct 225 ms 82028 KB Output is correct
10 Correct 258 ms 82028 KB Output is correct
11 Correct 308 ms 81980 KB Output is correct
12 Correct 370 ms 82028 KB Output is correct
13 Correct 417 ms 81980 KB Output is correct
14 Correct 645 ms 81944 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 96448 KB Output is correct
2 Correct 290 ms 95984 KB Output is correct
3 Correct 321 ms 96076 KB Output is correct
4 Correct 310 ms 96116 KB Output is correct
5 Correct 279 ms 96336 KB Output is correct
6 Correct 304 ms 96132 KB Output is correct
7 Correct 212 ms 96064 KB Output is correct
8 Correct 213 ms 96064 KB Output is correct
9 Correct 205 ms 95492 KB Output is correct
10 Correct 258 ms 95780 KB Output is correct
11 Correct 305 ms 96008 KB Output is correct
12 Correct 269 ms 96064 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 316 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 316 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 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 0 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 0 ms 212 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 320 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 452 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 5 ms 2260 KB Output is correct
42 Correct 5 ms 2260 KB Output is correct
43 Correct 5 ms 2192 KB Output is correct
44 Correct 7 ms 2004 KB Output is correct
45 Correct 5 ms 2124 KB Output is correct
46 Correct 5 ms 2516 KB Output is correct
47 Correct 5 ms 2132 KB Output is correct
48 Correct 6 ms 2132 KB Output is correct
49 Correct 6 ms 2260 KB Output is correct
50 Correct 6 ms 2300 KB Output is correct
51 Correct 5 ms 2260 KB Output is correct
52 Correct 5 ms 2248 KB Output is correct
53 Correct 4 ms 2260 KB Output is correct
54 Correct 6 ms 2260 KB Output is correct
55 Correct 6 ms 2260 KB Output is correct
56 Correct 5 ms 2260 KB Output is correct
57 Correct 5 ms 2260 KB Output is correct
58 Correct 4 ms 2516 KB Output is correct
59 Correct 4 ms 2576 KB Output is correct
60 Correct 5 ms 2260 KB Output is correct
61 Correct 5 ms 2252 KB Output is correct
62 Correct 200 ms 82028 KB Output is correct
63 Correct 357 ms 81632 KB Output is correct
64 Correct 579 ms 81936 KB Output is correct
65 Correct 661 ms 81984 KB Output is correct
66 Correct 433 ms 81968 KB Output is correct
67 Correct 627 ms 81960 KB Output is correct
68 Correct 212 ms 81452 KB Output is correct
69 Correct 218 ms 81760 KB Output is correct
70 Correct 225 ms 82028 KB Output is correct
71 Correct 258 ms 82028 KB Output is correct
72 Correct 308 ms 81980 KB Output is correct
73 Correct 370 ms 82028 KB Output is correct
74 Correct 417 ms 81980 KB Output is correct
75 Correct 645 ms 81944 KB Output is correct
76 Correct 185 ms 96448 KB Output is correct
77 Correct 290 ms 95984 KB Output is correct
78 Correct 321 ms 96076 KB Output is correct
79 Correct 310 ms 96116 KB Output is correct
80 Correct 279 ms 96336 KB Output is correct
81 Correct 304 ms 96132 KB Output is correct
82 Correct 212 ms 96064 KB Output is correct
83 Correct 213 ms 96064 KB Output is correct
84 Correct 205 ms 95492 KB Output is correct
85 Correct 258 ms 95780 KB Output is correct
86 Correct 305 ms 96008 KB Output is correct
87 Correct 269 ms 96064 KB Output is correct
88 Correct 639 ms 81948 KB Output is correct
89 Correct 689 ms 81980 KB Output is correct
90 Correct 662 ms 81916 KB Output is correct
91 Correct 525 ms 81996 KB Output is correct
92 Correct 426 ms 82176 KB Output is correct
93 Correct 531 ms 82624 KB Output is correct
94 Correct 383 ms 91888 KB Output is correct
95 Correct 524 ms 82008 KB Output is correct
96 Correct 620 ms 82020 KB Output is correct
97 Correct 663 ms 81952 KB Output is correct
98 Correct 542 ms 82132 KB Output is correct
99 Correct 528 ms 81976 KB Output is correct
100 Correct 538 ms 82056 KB Output is correct
101 Correct 238 ms 81976 KB Output is correct
102 Correct 290 ms 82012 KB Output is correct
103 Correct 335 ms 81988 KB Output is correct
104 Correct 378 ms 82040 KB Output is correct
105 Correct 482 ms 82864 KB Output is correct
106 Correct 308 ms 82024 KB Output is correct
107 Correct 348 ms 81960 KB Output is correct
108 Correct 471 ms 82328 KB Output is correct
109 Correct 348 ms 82008 KB Output is correct
110 Correct 506 ms 82004 KB Output is correct
111 Correct 513 ms 82040 KB Output is correct
112 Correct 329 ms 82148 KB Output is correct
113 Correct 488 ms 82272 KB Output is correct
114 Correct 469 ms 82244 KB Output is correct
115 Correct 208 ms 96056 KB Output is correct
116 Correct 214 ms 96104 KB Output is correct
117 Correct 274 ms 89016 KB Output is correct
118 Correct 262 ms 89048 KB Output is correct
119 Correct 365 ms 81856 KB Output is correct
120 Correct 389 ms 81924 KB Output is correct