oj.uz

Submission #533774

# Submission time Handle Problem Language Result Execution time Memory
533774 2022-03-07T08:00:44 Z someone Financial Report (JOI21_financial) C++14
100 / 100
 535 ms 15200 KB 
#include <bits/stdc++.h>
//#define int long long
using namespace std;

struct Val {
    int val, i;
};
 
const int M = 1 << 19, N = 2 * M, T = 3;

Val a[M];
deque<int> mini;
int n, d, ans = 0, maxi[N], len[M], tag_a[N], tag_b[N];

inline void updNode(int i, int a, int b) {
    tag_a[i] *= a;
    tag_b[i] = tag_b[i] * a + b;
    maxi[i] = maxi[i] * a + b;
}

int update(int i, int deb, int fin, int a, int b, int d = 0, int f = M) {
    if(deb <= d && f <= fin) {
        updNode(i, a, b);
        return maxi[i];
    }
    if(f <= deb || fin <= d)
        return 0;
        
    updNode(i*2, tag_a[i], tag_b[i]);
    updNode(i*2+1, tag_a[i], tag_b[i]);
    
    tag_a[i] = 1;
    tag_b[i] = 0;
    
    int med = (d + f) >> 1,
        ans = max(update(i*2, deb, fin, a, b, d, med), update(i*2+1, deb, fin, a, b, med, f));
        
    maxi[i] = max(maxi[i*2], maxi[i*2+1]);
    return ans;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n >> d;
    for(int i = 0; i < n; i++)
        cin >> a[i].val;
    for(int i = 0; i < n; i++)
        a[i].i = i;
    
    sort(a, a + n,
    [](Val v1, Val v2) {
        return v1.val < v2.val;
    });
    
    int pre = a[0].val;
    a[0].val = 0;
    for(int i = 1; i < n; i++)
        if(a[i].val == pre) {
            a[i].val = a[i-1].val;
        } else {
            pre = a[i].val;
            a[i].val = a[i-1].val+1;
        }
    
    sort(a, a + n,
    [](Val v1, Val v2) {
        return v1.i < v2.i;
    });
    
    for(int i = 0, j = -d; i < n; i++, j++) {
        len[i] = max(update(1, 0, a[i].val, 1, 0)+1, update(1, a[i].val, a[i].val+1, 1, 0));
        ans = max(ans, len[i]);
        while(!mini.empty() && mini.back() > a[i].val)
            mini.pop_back();
        mini.push_back(a[i].val);
        if(j >= 0) {
            if(a[j].val == mini[0])
                mini.pop_front();
            update(1, 0, mini[0], 0, 0);
        }
        update(1, a[i].val, a[i].val+1, 0, len[i]);
    }
    cout << ans;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 266 ms 4212 KB Output is correct
2 Correct 454 ms 6512 KB Output is correct
3 Correct 478 ms 6768 KB Output is correct
4 Correct 517 ms 12840 KB Output is correct
5 Correct 485 ms 13920 KB Output is correct
6 Correct 528 ms 13856 KB Output is correct
7 Correct 416 ms 13680 KB Output is correct
8 Correct 420 ms 13940 KB Output is correct
9 Correct 420 ms 13796 KB Output is correct
10 Correct 440 ms 13836 KB Output is correct
11 Correct 478 ms 14020 KB Output is correct
12 Correct 470 ms 13764 KB Output is correct
13 Correct 487 ms 13872 KB Output is correct
14 Correct 517 ms 13776 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 5520 KB Output is correct
2 Correct 380 ms 6864 KB Output is correct
3 Correct 381 ms 6852 KB Output is correct
4 Correct 432 ms 13740 KB Output is correct
5 Correct 402 ms 13876 KB Output is correct
6 Correct 405 ms 13764 KB Output is correct
7 Correct 336 ms 15200 KB Output is correct
8 Correct 319 ms 13780 KB Output is correct
9 Correct 346 ms 13956 KB Output is correct
10 Correct 364 ms 13740 KB Output is correct
11 Correct 409 ms 13844 KB Output is correct
12 Correct 389 ms 13804 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 1 ms 456 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 460 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 1 ms 460 KB Output is correct
38 Correct 1 ms 460 KB Output is correct
39 Correct 1 ms 460 KB Output is correct
40 Correct 1 ms 460 KB Output is correct
41 Correct 11 ms 588 KB Output is correct
42 Correct 12 ms 716 KB Output is correct
43 Correct 9 ms 608 KB Output is correct
44 Correct 10 ms 588 KB Output is correct
45 Correct 11 ms 668 KB Output is correct
46 Correct 9 ms 764 KB Output is correct
47 Correct 11 ms 748 KB Output is correct
48 Correct 11 ms 716 KB Output is correct
49 Correct 13 ms 760 KB Output is correct
50 Correct 12 ms 784 KB Output is correct
51 Correct 12 ms 728 KB Output is correct
52 Correct 12 ms 744 KB Output is correct
53 Correct 10 ms 716 KB Output is correct
54 Correct 13 ms 716 KB Output is correct
55 Correct 11 ms 716 KB Output is correct
56 Correct 11 ms 716 KB Output is correct
57 Correct 11 ms 712 KB Output is correct
58 Correct 8 ms 716 KB Output is correct
59 Correct 8 ms 716 KB Output is correct
60 Correct 11 ms 716 KB Output is correct
61 Correct 11 ms 716 KB Output is correct
62 Correct 266 ms 4212 KB Output is correct
63 Correct 454 ms 6512 KB Output is correct
64 Correct 478 ms 6768 KB Output is correct
65 Correct 517 ms 12840 KB Output is correct
66 Correct 485 ms 13920 KB Output is correct
67 Correct 528 ms 13856 KB Output is correct
68 Correct 416 ms 13680 KB Output is correct
69 Correct 420 ms 13940 KB Output is correct
70 Correct 420 ms 13796 KB Output is correct
71 Correct 440 ms 13836 KB Output is correct
72 Correct 478 ms 14020 KB Output is correct
73 Correct 470 ms 13764 KB Output is correct
74 Correct 487 ms 13872 KB Output is correct
75 Correct 517 ms 13776 KB Output is correct
76 Correct 263 ms 5520 KB Output is correct
77 Correct 380 ms 6864 KB Output is correct
78 Correct 381 ms 6852 KB Output is correct
79 Correct 432 ms 13740 KB Output is correct
80 Correct 402 ms 13876 KB Output is correct
81 Correct 405 ms 13764 KB Output is correct
82 Correct 336 ms 15200 KB Output is correct
83 Correct 319 ms 13780 KB Output is correct
84 Correct 346 ms 13956 KB Output is correct
85 Correct 364 ms 13740 KB Output is correct
86 Correct 409 ms 13844 KB Output is correct
87 Correct 389 ms 13804 KB Output is correct
88 Correct 489 ms 6844 KB Output is correct
89 Correct 534 ms 13508 KB Output is correct
90 Correct 479 ms 7944 KB Output is correct
91 Correct 514 ms 13820 KB Output is correct
92 Correct 381 ms 6816 KB Output is correct
93 Correct 377 ms 6996 KB Output is correct
94 Correct 440 ms 11804 KB Output is correct
95 Correct 502 ms 13900 KB Output is correct
96 Correct 502 ms 13764 KB Output is correct
97 Correct 527 ms 14080 KB Output is correct
98 Correct 535 ms 13940 KB Output is correct
99 Correct 517 ms 13808 KB Output is correct
100 Correct 524 ms 13924 KB Output is correct
101 Correct 436 ms 13764 KB Output is correct
102 Correct 435 ms 13748 KB Output is correct
103 Correct 463 ms 13816 KB Output is correct
104 Correct 454 ms 13768 KB Output is correct
105 Correct 459 ms 13764 KB Output is correct
106 Correct 454 ms 13840 KB Output is correct
107 Correct 479 ms 13836 KB Output is correct
108 Correct 525 ms 13924 KB Output is correct
109 Correct 478 ms 13788 KB Output is correct
110 Correct 516 ms 13764 KB Output is correct
111 Correct 520 ms 13764 KB Output is correct
112 Correct 481 ms 13772 KB Output is correct
113 Correct 523 ms 13960 KB Output is correct
114 Correct 516 ms 13780 KB Output is correct
115 Correct 325 ms 13768 KB Output is correct
116 Correct 324 ms 13916 KB Output is correct
117 Correct 403 ms 13820 KB Output is correct
118 Correct 420 ms 13896 KB Output is correct
119 Correct 474 ms 13832 KB Output is correct
120 Correct 474 ms 13800 KB Output is correct