oj.uz

Submission #469648

# Submission time Handle Problem Language Result Execution time Memory
469648 2021-09-01T14:26:27 Z Jarif_Rahman Financial Report (JOI21_financial) C++17
100 / 100
 871 ms 59532 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const int inf = 1e9;


struct segtree{
    struct node{
        int mx;
        node(){
            mx = 0;
        }
        node(ll x){
            mx = x;
        }
        node operator+(node a){
            node rt;
            rt.mx = max(mx, a.mx);
            return rt;
        }
    };
    int k;
    vector<node> v;
    segtree(int n){
        k = 1;
        while(k < n) k*=2;
        k*=2;
        v.resize(k, node());
    }
    void upd(int in, ll x){
        in+=k/2;
        v[in] = node(x);
        in/=2;
        while(in > 0){
            v[in] = v[2*in]+v[2*in+1];
            in/=2;
        }
    }
    ll smx(int l, int r, int nd, int a, int b){
        if(b < l || a > r) return 0;
        if(a >= l && b <= r) return v[nd].mx;
        int c = (a+b)/2;
        return max(smx(l, r, 2*nd, a, c), smx(l, r, 2*nd+1, c+1, b));
    }
    ll smx(int l, int r){
        return smx(l, r, 1, 0, k/2-1);
    }
};

struct segtree2{
    struct node{
        int mn;
        node(){
            mn = 0;
        }
        node(ll x){
            mn = x;
        }
        node operator+(node a){
            node rt;
            rt.mn = min(mn, a.mn);
            return rt;
        }
    };
    int k;
    vector<node> v;
    segtree2(int n){
        k = 1;
        while(k < n) k*=2;
        k*=2;
        v.resize(k, node());
    }
    void upd(int in, ll x){
        in+=k/2;
        v[in] = node(x);
        in/=2;
        while(in > 0){
            v[in] = v[2*in]+v[2*in+1];
            in/=2;
        }
    }
    ll smn(int l, int r, int nd, int a, int b){
        if(b < l || a > r) return inf;
        if(a >= l && b <= r) return v[nd].mn;
        int c = (a+b)/2;
        return min(smn(l, r, 2*nd, a, c), smn(l, r, 2*nd+1, c+1, b));
    }
    ll smn(int l, int r){
        return smn(l, r, 1, 0, k/2-1);
    }
};

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, d; cin >> n >> d;
    vector<int> v(n);
    for(int &x: v) cin >> x;

    vector<int> cmpr;
    map<int, int> mp;
    cmpr = v;
    sort(cmpr.begin(), cmpr.end());
    for(int i = 0; i < n; i++) mp[cmpr[i]] = i;
    for(int &x: v) x = mp[x];

    segtree seg(n);
    vector<vector<int>> sth(n);
    for(int i = n-1; i >= 0; i--) sth[v[i]].pb(i);

    segtree2 seg2(n);
    for(int i = 0; i < n; i++) seg2.upd(i, v[i]);
    vector<int> lim(n, 0);
    set<pair<int, int>> ss;
    for(int i = n-1; i >= 0; i--){
        if(i+d < n) ss.insert({-v[i+d], i+d});
        int x = seg2.smn(i, min(n-1, i+d-1));
        while(1){
            auto it = ss.lower_bound(make_pair(-x, 0));
            if(it == ss.end()) break;
            lim[it->sc] = i;
            ss.erase(it);
        }
    }

    for(int i = 0; i < n; i++){
        for(int j = 0; j < sth[i].size(); j++){
            int x = seg.smx(lim[sth[i][j]], sth[i][j]-1)+1;
            seg.upd(sth[i][j], seg.smx(lim[sth[i][j]], sth[i][j]-1)+1);
        }
    }

    cout << seg.smx(0, n-1) << "\n";

}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:131:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |         for(int j = 0; j < sth[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~~~
Main.cpp:132:17: warning: unused variable 'x' [-Wunused-variable]
  132 |             int x = seg.smx(lim[sth[i][j]], sth[i][j]-1)+1;
      |                 ^

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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 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 0 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 1 ms 204 KB Output is correct
17 Correct 1 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 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 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 0 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 1 ms 204 KB Output is correct
17 Correct 1 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 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 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 332 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 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 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 0 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 1 ms 204 KB Output is correct
17 Correct 1 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 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 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 332 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 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 7 ms 844 KB Output is correct
42 Correct 8 ms 1244 KB Output is correct
43 Correct 5 ms 716 KB Output is correct
44 Correct 7 ms 972 KB Output is correct
45 Correct 8 ms 1100 KB Output is correct
46 Correct 7 ms 1228 KB Output is correct
47 Correct 8 ms 1356 KB Output is correct
48 Correct 8 ms 1356 KB Output is correct
49 Correct 9 ms 1356 KB Output is correct
50 Correct 9 ms 1484 KB Output is correct
51 Correct 7 ms 1228 KB Output is correct
52 Correct 8 ms 1228 KB Output is correct
53 Correct 7 ms 1540 KB Output is correct
54 Correct 8 ms 1484 KB Output is correct
55 Correct 9 ms 1484 KB Output is correct
56 Correct 9 ms 1484 KB Output is correct
57 Correct 9 ms 1492 KB Output is correct
58 Correct 6 ms 1228 KB Output is correct
59 Correct 6 ms 1228 KB Output is correct
60 Correct 7 ms 1484 KB Output is correct
61 Correct 7 ms 1484 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 20512 KB Output is correct
2 Correct 267 ms 20400 KB Output is correct
3 Correct 243 ms 21184 KB Output is correct
4 Correct 600 ms 39128 KB Output is correct
5 Correct 526 ms 42728 KB Output is correct
6 Correct 565 ms 42580 KB Output is correct
7 Correct 390 ms 56272 KB Output is correct
8 Correct 298 ms 45380 KB Output is correct
9 Correct 392 ms 54860 KB Output is correct
10 Correct 309 ms 45468 KB Output is correct
11 Correct 413 ms 45636 KB Output is correct
12 Correct 448 ms 45380 KB Output is correct
13 Correct 547 ms 45492 KB Output is correct
14 Correct 534 ms 45380 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 20336 KB Output is correct
2 Correct 241 ms 21108 KB Output is correct
3 Correct 303 ms 21768 KB Output is correct
4 Correct 640 ms 42964 KB Output is correct
5 Correct 555 ms 42964 KB Output is correct
6 Correct 649 ms 42964 KB Output is correct
7 Correct 337 ms 42920 KB Output is correct
8 Correct 330 ms 42968 KB Output is correct
9 Correct 316 ms 42732 KB Output is correct
10 Correct 411 ms 42936 KB Output is correct
11 Correct 612 ms 42904 KB Output is correct
12 Correct 502 ms 42964 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 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 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 0 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 1 ms 204 KB Output is correct
17 Correct 1 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 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 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 332 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 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 7 ms 844 KB Output is correct
42 Correct 8 ms 1244 KB Output is correct
43 Correct 5 ms 716 KB Output is correct
44 Correct 7 ms 972 KB Output is correct
45 Correct 8 ms 1100 KB Output is correct
46 Correct 7 ms 1228 KB Output is correct
47 Correct 8 ms 1356 KB Output is correct
48 Correct 8 ms 1356 KB Output is correct
49 Correct 9 ms 1356 KB Output is correct
50 Correct 9 ms 1484 KB Output is correct
51 Correct 7 ms 1228 KB Output is correct
52 Correct 8 ms 1228 KB Output is correct
53 Correct 7 ms 1540 KB Output is correct
54 Correct 8 ms 1484 KB Output is correct
55 Correct 9 ms 1484 KB Output is correct
56 Correct 9 ms 1484 KB Output is correct
57 Correct 9 ms 1492 KB Output is correct
58 Correct 6 ms 1228 KB Output is correct
59 Correct 6 ms 1228 KB Output is correct
60 Correct 7 ms 1484 KB Output is correct
61 Correct 7 ms 1484 KB Output is correct
62 Correct 182 ms 20512 KB Output is correct
63 Correct 267 ms 20400 KB Output is correct
64 Correct 243 ms 21184 KB Output is correct
65 Correct 600 ms 39128 KB Output is correct
66 Correct 526 ms 42728 KB Output is correct
67 Correct 565 ms 42580 KB Output is correct
68 Correct 390 ms 56272 KB Output is correct
69 Correct 298 ms 45380 KB Output is correct
70 Correct 392 ms 54860 KB Output is correct
71 Correct 309 ms 45468 KB Output is correct
72 Correct 413 ms 45636 KB Output is correct
73 Correct 448 ms 45380 KB Output is correct
74 Correct 547 ms 45492 KB Output is correct
75 Correct 534 ms 45380 KB Output is correct
76 Correct 228 ms 20336 KB Output is correct
77 Correct 241 ms 21108 KB Output is correct
78 Correct 303 ms 21768 KB Output is correct
79 Correct 640 ms 42964 KB Output is correct
80 Correct 555 ms 42964 KB Output is correct
81 Correct 649 ms 42964 KB Output is correct
82 Correct 337 ms 42920 KB Output is correct
83 Correct 330 ms 42968 KB Output is correct
84 Correct 316 ms 42732 KB Output is correct
85 Correct 411 ms 42936 KB Output is correct
86 Correct 612 ms 42904 KB Output is correct
87 Correct 502 ms 42964 KB Output is correct
88 Correct 353 ms 23816 KB Output is correct
89 Correct 672 ms 44816 KB Output is correct
90 Correct 491 ms 30340 KB Output is correct
91 Correct 773 ms 58076 KB Output is correct
92 Correct 415 ms 37448 KB Output is correct
93 Correct 631 ms 37332 KB Output is correct
94 Correct 543 ms 42564 KB Output is correct
95 Correct 563 ms 45720 KB Output is correct
96 Correct 651 ms 52648 KB Output is correct
97 Correct 703 ms 52920 KB Output is correct
98 Correct 822 ms 57904 KB Output is correct
99 Correct 871 ms 59356 KB Output is correct
100 Correct 794 ms 59352 KB Output is correct
101 Correct 373 ms 56068 KB Output is correct
102 Correct 392 ms 59184 KB Output is correct
103 Correct 436 ms 59532 KB Output is correct
104 Correct 491 ms 59452 KB Output is correct
105 Correct 691 ms 58580 KB Output is correct
106 Correct 453 ms 45592 KB Output is correct
107 Correct 641 ms 46780 KB Output is correct
108 Correct 835 ms 56516 KB Output is correct
109 Correct 506 ms 46020 KB Output is correct
110 Correct 723 ms 54580 KB Output is correct
111 Correct 725 ms 57552 KB Output is correct
112 Correct 586 ms 57012 KB Output is correct
113 Correct 764 ms 59220 KB Output is correct
114 Correct 867 ms 59192 KB Output is correct
115 Correct 338 ms 45380 KB Output is correct
116 Correct 314 ms 45380 KB Output is correct
117 Correct 411 ms 52420 KB Output is correct
118 Correct 422 ms 52400 KB Output is correct
119 Correct 577 ms 59444 KB Output is correct
120 Correct 486 ms 59460 KB Output is correct