oj.uz

Submission #619991

# Submission time Handle Problem Language Result Execution time Memory
619991 2022-08-02T18:20:41 Z APROHACK Financial Report (JOI21_financial) C++14
100 / 100
 880 ms 50276 KB 
#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;
ll n, a, d, maxans, curr;
vector<ll>arr, compressed;
struct financial
{
    int dd, ht, val, mid;
    bool hay;

    financial *L, *R;
    financial(){}
    financial(int l, int r){
        ////cout << l << " " << r << endl;
        dd = l, ht = r;
        mid = (dd+ht)/2;
        if(dd!=ht){
            L = new financial(l, mid);
            R = new financial(mid+1, r);
            val = max(L->val, R->val);
        }else{
            val = 0;
        }
        hay = false;
    }
    void propagate(){
        if(hay){
            L->erasing(dd, mid);
            R->erasing(mid+1, ht);
            val = max(L->val, R->val);
            hay = false;
        }
    }
    void push(int where, int value){
        if(dd==ht){
            //cout << where << " - > " << value << endl;
            val = value;
        }else{
            propagate();
            if(where<=mid){
                L->push(where , value);
            }else{
                R->push(where, value);
            }
            val = max(L->val, R->val);
        }
    }
    void erasing(int l, int r){
        if(l==dd && r == ht){
            //cout << "upd 0 " << l << " " << r << endl;
            val = 0;
            hay = true;
        }else{
            //cout<<"in " << dd << " " << ht << " " << l << " " << r << endl; 
            if(r<=mid){
                L->erasing(l, r);
            }else if(l>mid){
                R->erasing(l, r);
            }else{
                L->erasing(l, mid);
                R->erasing(mid+1, r);
            }
            val = max(L->val, R->val);
        }
    }
    int query(int l, int r){
        if(l==dd && r == ht){
            //cout << "ans "<<l << " " << r << " " << val << endl;
            return val;
        }else{
            //cout<<"asking in " << dd << " " << ht << " " << l << " " << r << endl; 
            propagate();
            if(r<=mid){
                return L->query(l, r);
            }else if(l>mid){
                return R->query(l, r);
            }else {
                ll kkkk = L->query(l, mid);
                ll pppp = R->query(mid+1, r);
                return max(kkkk, pppp);
            }
        }
    }
};

void input(){
    //freopen("input.txt", "r", stdin);
    cin>>n>>d;
    for(int i = 0 ; i < n; i ++){
        cin>>a;
        arr.pb(a);
        compressed.pb(a);
    }
    map<int, int>mp;
    sort(arr.begin(), arr.end());
    curr = 0;
    for(int i = 0 ;i < n ; i++){
        mp[arr[i]]=curr++;
    }
    for(int i = 0 ; i < n ; i ++){
        compressed[i]=mp[compressed[i]];
        //cout << compressed[i] << " ";
    }
    //cout << endl;
}
financial *st;
void calculate(){
    st = new financial(0, curr);
    ll currentAns = 1, minimum;
    multiset<int>nextD;
    for(int i = n-1 ; i>= 0; i --){
        if(nextD.size()==d){
            for(auto temp:nextD){
                minimum=temp;
                break;
            }
            if(minimum>=1)st->erasing(0, minimum-1);
            nextD.erase(nextD.find(compressed[i+d]));
        }
        currentAns = 1 + st->query(compressed[i]+1, curr);
        maxans = max(maxans, currentAns);
        nextD.insert(compressed[i]);
        st->push(compressed[i], currentAns);
    }
}
int main(){
    input();
    maxans=1;
    calculate();
    cout << maxans << endl;
}

Compilation message

Main.cpp: In function 'void calculate()':
Main.cpp:115:24: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  115 |         if(nextD.size()==d){
      |            ~~~~~~~~~~~~^~~
Main.cpp:120:49: warning: 'minimum' may be used uninitialized in this function [-Wmaybe-uninitialized]
  120 |             if(minimum>=1)st->erasing(0, minimum-1);
      |                                          ~~~~~~~^~

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 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 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 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 296 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 300 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 292 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 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 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 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 296 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 300 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 292 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 8 ms 1076 KB Output is correct
42 Correct 8 ms 1108 KB Output is correct
43 Correct 8 ms 1236 KB Output is correct
44 Correct 8 ms 916 KB Output is correct
45 Correct 8 ms 1108 KB Output is correct
46 Correct 9 ms 1472 KB Output is correct
47 Correct 8 ms 1080 KB Output is correct
48 Correct 10 ms 1088 KB Output is correct
49 Correct 9 ms 1076 KB Output is correct
50 Correct 8 ms 1108 KB Output is correct
51 Correct 7 ms 1108 KB Output is correct
52 Correct 8 ms 1044 KB Output is correct
53 Correct 8 ms 1108 KB Output is correct
54 Correct 7 ms 1108 KB Output is correct
55 Correct 8 ms 1072 KB Output is correct
56 Correct 9 ms 1076 KB Output is correct
57 Correct 8 ms 1076 KB Output is correct
58 Correct 7 ms 1464 KB Output is correct
59 Correct 7 ms 1364 KB Output is correct
60 Correct 7 ms 1108 KB Output is correct
61 Correct 8 ms 1080 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 222 ms 33796 KB Output is correct
2 Correct 268 ms 33680 KB Output is correct
3 Correct 338 ms 33732 KB Output is correct
4 Correct 622 ms 36072 KB Output is correct
5 Correct 490 ms 36256 KB Output is correct
6 Correct 616 ms 36072 KB Output is correct
7 Correct 324 ms 35836 KB Output is correct
8 Correct 322 ms 35988 KB Output is correct
9 Correct 327 ms 36072 KB Output is correct
10 Correct 374 ms 36072 KB Output is correct
11 Correct 425 ms 36076 KB Output is correct
12 Correct 465 ms 36080 KB Output is correct
13 Correct 561 ms 36124 KB Output is correct
14 Correct 632 ms 36080 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 48032 KB Output is correct
2 Correct 407 ms 48144 KB Output is correct
3 Correct 683 ms 47696 KB Output is correct
4 Correct 880 ms 47700 KB Output is correct
5 Correct 665 ms 47628 KB Output is correct
6 Correct 837 ms 47676 KB Output is correct
7 Correct 372 ms 47644 KB Output is correct
8 Correct 342 ms 50200 KB Output is correct
9 Correct 334 ms 49840 KB Output is correct
10 Correct 451 ms 50080 KB Output is correct
11 Correct 813 ms 50108 KB Output is correct
12 Correct 692 ms 50152 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 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 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 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 296 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 300 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 292 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 8 ms 1076 KB Output is correct
42 Correct 8 ms 1108 KB Output is correct
43 Correct 8 ms 1236 KB Output is correct
44 Correct 8 ms 916 KB Output is correct
45 Correct 8 ms 1108 KB Output is correct
46 Correct 9 ms 1472 KB Output is correct
47 Correct 8 ms 1080 KB Output is correct
48 Correct 10 ms 1088 KB Output is correct
49 Correct 9 ms 1076 KB Output is correct
50 Correct 8 ms 1108 KB Output is correct
51 Correct 7 ms 1108 KB Output is correct
52 Correct 8 ms 1044 KB Output is correct
53 Correct 8 ms 1108 KB Output is correct
54 Correct 7 ms 1108 KB Output is correct
55 Correct 8 ms 1072 KB Output is correct
56 Correct 9 ms 1076 KB Output is correct
57 Correct 8 ms 1076 KB Output is correct
58 Correct 7 ms 1464 KB Output is correct
59 Correct 7 ms 1364 KB Output is correct
60 Correct 7 ms 1108 KB Output is correct
61 Correct 8 ms 1080 KB Output is correct
62 Correct 222 ms 33796 KB Output is correct
63 Correct 268 ms 33680 KB Output is correct
64 Correct 338 ms 33732 KB Output is correct
65 Correct 622 ms 36072 KB Output is correct
66 Correct 490 ms 36256 KB Output is correct
67 Correct 616 ms 36072 KB Output is correct
68 Correct 324 ms 35836 KB Output is correct
69 Correct 322 ms 35988 KB Output is correct
70 Correct 327 ms 36072 KB Output is correct
71 Correct 374 ms 36072 KB Output is correct
72 Correct 425 ms 36076 KB Output is correct
73 Correct 465 ms 36080 KB Output is correct
74 Correct 561 ms 36124 KB Output is correct
75 Correct 632 ms 36080 KB Output is correct
76 Correct 253 ms 48032 KB Output is correct
77 Correct 407 ms 48144 KB Output is correct
78 Correct 683 ms 47696 KB Output is correct
79 Correct 880 ms 47700 KB Output is correct
80 Correct 665 ms 47628 KB Output is correct
81 Correct 837 ms 47676 KB Output is correct
82 Correct 372 ms 47644 KB Output is correct
83 Correct 342 ms 50200 KB Output is correct
84 Correct 334 ms 49840 KB Output is correct
85 Correct 451 ms 50080 KB Output is correct
86 Correct 813 ms 50108 KB Output is correct
87 Correct 692 ms 50152 KB Output is correct
88 Correct 374 ms 35972 KB Output is correct
89 Correct 633 ms 36084 KB Output is correct
90 Correct 510 ms 36036 KB Output is correct
91 Correct 649 ms 36256 KB Output is correct
92 Correct 318 ms 36108 KB Output is correct
93 Correct 537 ms 36716 KB Output is correct
94 Correct 846 ms 46132 KB Output is correct
95 Correct 540 ms 36096 KB Output is correct
96 Correct 584 ms 36116 KB Output is correct
97 Correct 640 ms 36076 KB Output is correct
98 Correct 641 ms 36084 KB Output is correct
99 Correct 668 ms 36088 KB Output is correct
100 Correct 668 ms 36212 KB Output is correct
101 Correct 343 ms 36180 KB Output is correct
102 Correct 358 ms 36128 KB Output is correct
103 Correct 387 ms 36088 KB Output is correct
104 Correct 429 ms 36132 KB Output is correct
105 Correct 540 ms 37012 KB Output is correct
106 Correct 403 ms 36228 KB Output is correct
107 Correct 449 ms 36184 KB Output is correct
108 Correct 638 ms 36536 KB Output is correct
109 Correct 540 ms 36100 KB Output is correct
110 Correct 594 ms 36084 KB Output is correct
111 Correct 602 ms 36080 KB Output is correct
112 Correct 530 ms 36216 KB Output is correct
113 Correct 679 ms 36328 KB Output is correct
114 Correct 669 ms 36248 KB Output is correct
115 Correct 346 ms 50064 KB Output is correct
116 Correct 340 ms 50276 KB Output is correct
117 Correct 394 ms 43024 KB Output is correct
118 Correct 398 ms 43040 KB Output is correct
119 Correct 454 ms 36084 KB Output is correct
120 Correct 479 ms 36260 KB Output is correct