oj.uz

Submission #422065

# Submission time Handle Problem Language Result Execution time Memory
422065 2021-06-09T16:56:26 Z 2fat2code Financial Report (JOI21_financial) C++17
100 / 100
 634 ms 29860 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
#define fr first
#define sc second
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int nmax = 300005;

int n, a[nmax], d, tree[4*nmax], tree2[4*nmax], lazy[4*nmax];
vector<int>vecc;

void build(int l, int r, int nod){
    if(l == r){
        tree[nod] = a[l];
    }
    else{
        int mid = l + (r - l) / 2;
        build(l, mid, 2*nod);
        build(mid + 1, r, 2*nod+1);
        tree[nod] = min(tree[2*nod], tree[2*nod+1]);
    }
}

int query1(int l, int r, int le, int ri, int nod){
    if(l > ri || r < le) return 1e18;
    else if(l >= le && r <= ri) return tree[nod];
    else{
        int mid = l + (r - l) / 2;
        return min(query1(l, mid, le, ri, 2*nod), query1(mid + 1, r, le, ri, 2*nod + 1));
    }
}

void push(int l, int r, int nod){
    if(lazy[nod] == 1){
        tree2[nod] = 0;
        if(l != r){
            lazy[2*nod] = 1;
            lazy[2*nod+1] = 1;
        }
        lazy[nod] = 0;
    }
}

void update2(int l, int r, int le, int ri, int nod){
    push(l, r, nod);
    if(r < le || l > ri) return;
    else if(l >= le && r <= ri){
        lazy[nod] = 1;
        push(l, r, nod);
    }
    else{
        int mid = l + (r - l) / 2;
        update2(l, mid, le, ri, 2*nod);
        update2(mid+1, r, le, ri, 2*nod + 1);
        tree2[nod] = max(tree2[2*nod], tree2[2*nod + 1]);
    }
}

int query2(int l, int r, int le, int ri, int nod){
    push(l, r, nod);
    if(l > ri || r < le){
        return 0;
    }
    else if(l >= le && r <= ri){
        return tree2[nod];
    }
    else{
        int mid = l + (r - l) / 2;
        return max(query2(l, mid, le, ri, 2*nod), query2(mid+1, r, le, ri, 2*nod +1));
    }
}

void update3(int l, int r, int pos, int val, int nod){
    push(l, r, nod);
    if(l == r){
        tree2[nod] = max(tree2[nod], val);
    }
    else{
        int mid = l + (r - l) / 2;
        tree2[nod] = max(tree2[nod], val);
        if(pos <= mid){
            update3(l, mid, pos, val, 2*nod);
        }
        else{
            update3(mid + 1, r, pos, val, 2*nod + 1);
        }
    }
}

int32_t main(){
    //ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
   // freopen("input.in", "r", stdin);
    cin >> n >> d;
    for(int i=1;i<=n;i++){
        cin >> a[i];
        vecc.push_back(a[i]);
    }
    sort(all(vecc));
    vecc.resize(unique(all(vecc)) - vecc.begin());
    for(int i=1;i<=n;i++) a[i] = lower_bound(all(vecc), a[i]) - vecc.begin() + 1LL;
    build(1, n, 1);
    int nn = (int)vecc.size();
    for(int i=1;i<=n;i++){
        if(i >= 2){
            int curr = query1(1, n, max(1LL, i - d), i - 1, 1);
            if(curr >= 2LL) update2(1, nn, 1, curr - 1LL, 1);
        }
        int val = 1LL;
        if(a[i] >= 2LL){
            val += query2(1, nn, 1, a[i] - 1LL, 1);
        }
        update3(1, nn, a[i], val, 1);
    }
    cout << tree2[1];
}

// 1. Solve the problem
// 2. ???
// 3. Profit

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 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 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 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 8 ms 588 KB Output is correct
42 Correct 9 ms 888 KB Output is correct
43 Correct 5 ms 588 KB Output is correct
44 Correct 8 ms 736 KB Output is correct
45 Correct 8 ms 612 KB Output is correct
46 Correct 9 ms 884 KB Output is correct
47 Correct 8 ms 844 KB Output is correct
48 Correct 9 ms 844 KB Output is correct
49 Correct 9 ms 844 KB Output is correct
50 Correct 9 ms 872 KB Output is correct
51 Correct 9 ms 844 KB Output is correct
52 Correct 12 ms 844 KB Output is correct
53 Correct 11 ms 844 KB Output is correct
54 Correct 8 ms 844 KB Output is correct
55 Correct 9 ms 716 KB Output is correct
56 Correct 9 ms 788 KB Output is correct
57 Correct 9 ms 716 KB Output is correct
58 Correct 7 ms 716 KB Output is correct
59 Correct 7 ms 716 KB Output is correct
60 Correct 9 ms 716 KB Output is correct
61 Correct 9 ms 716 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 13312 KB Output is correct
2 Correct 278 ms 13308 KB Output is correct
3 Correct 303 ms 13360 KB Output is correct
4 Correct 614 ms 21476 KB Output is correct
5 Correct 585 ms 29688 KB Output is correct
6 Correct 634 ms 29752 KB Output is correct
7 Correct 408 ms 29700 KB Output is correct
8 Correct 399 ms 29728 KB Output is correct
9 Correct 407 ms 29708 KB Output is correct
10 Correct 408 ms 29736 KB Output is correct
11 Correct 515 ms 29676 KB Output is correct
12 Correct 514 ms 29692 KB Output is correct
13 Correct 530 ms 29692 KB Output is correct
14 Correct 618 ms 29700 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 13224 KB Output is correct
2 Correct 249 ms 13216 KB Output is correct
3 Correct 321 ms 13420 KB Output is correct
4 Correct 501 ms 25648 KB Output is correct
5 Correct 510 ms 28660 KB Output is correct
6 Correct 474 ms 23300 KB Output is correct
7 Correct 310 ms 21508 KB Output is correct
8 Correct 412 ms 29636 KB Output is correct
9 Correct 324 ms 21544 KB Output is correct
10 Correct 383 ms 21644 KB Output is correct
11 Correct 491 ms 21736 KB Output is correct
12 Correct 436 ms 29740 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 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 8 ms 588 KB Output is correct
42 Correct 9 ms 888 KB Output is correct
43 Correct 5 ms 588 KB Output is correct
44 Correct 8 ms 736 KB Output is correct
45 Correct 8 ms 612 KB Output is correct
46 Correct 9 ms 884 KB Output is correct
47 Correct 8 ms 844 KB Output is correct
48 Correct 9 ms 844 KB Output is correct
49 Correct 9 ms 844 KB Output is correct
50 Correct 9 ms 872 KB Output is correct
51 Correct 9 ms 844 KB Output is correct
52 Correct 12 ms 844 KB Output is correct
53 Correct 11 ms 844 KB Output is correct
54 Correct 8 ms 844 KB Output is correct
55 Correct 9 ms 716 KB Output is correct
56 Correct 9 ms 788 KB Output is correct
57 Correct 9 ms 716 KB Output is correct
58 Correct 7 ms 716 KB Output is correct
59 Correct 7 ms 716 KB Output is correct
60 Correct 9 ms 716 KB Output is correct
61 Correct 9 ms 716 KB Output is correct
62 Correct 216 ms 13312 KB Output is correct
63 Correct 278 ms 13308 KB Output is correct
64 Correct 303 ms 13360 KB Output is correct
65 Correct 614 ms 21476 KB Output is correct
66 Correct 585 ms 29688 KB Output is correct
67 Correct 634 ms 29752 KB Output is correct
68 Correct 408 ms 29700 KB Output is correct
69 Correct 399 ms 29728 KB Output is correct
70 Correct 407 ms 29708 KB Output is correct
71 Correct 408 ms 29736 KB Output is correct
72 Correct 515 ms 29676 KB Output is correct
73 Correct 514 ms 29692 KB Output is correct
74 Correct 530 ms 29692 KB Output is correct
75 Correct 618 ms 29700 KB Output is correct
76 Correct 213 ms 13224 KB Output is correct
77 Correct 249 ms 13216 KB Output is correct
78 Correct 321 ms 13420 KB Output is correct
79 Correct 501 ms 25648 KB Output is correct
80 Correct 510 ms 28660 KB Output is correct
81 Correct 474 ms 23300 KB Output is correct
82 Correct 310 ms 21508 KB Output is correct
83 Correct 412 ms 29636 KB Output is correct
84 Correct 324 ms 21544 KB Output is correct
85 Correct 383 ms 21644 KB Output is correct
86 Correct 491 ms 21736 KB Output is correct
87 Correct 436 ms 29740 KB Output is correct
88 Correct 355 ms 13316 KB Output is correct
89 Correct 610 ms 29640 KB Output is correct
90 Correct 462 ms 15112 KB Output is correct
91 Correct 614 ms 28736 KB Output is correct
92 Correct 269 ms 13248 KB Output is correct
93 Correct 363 ms 13516 KB Output is correct
94 Correct 494 ms 18864 KB Output is correct
95 Correct 568 ms 29704 KB Output is correct
96 Correct 550 ms 29480 KB Output is correct
97 Correct 563 ms 29616 KB Output is correct
98 Correct 580 ms 26916 KB Output is correct
99 Correct 568 ms 28936 KB Output is correct
100 Correct 558 ms 22180 KB Output is correct
101 Correct 444 ms 29796 KB Output is correct
102 Correct 421 ms 29860 KB Output is correct
103 Correct 451 ms 28332 KB Output is correct
104 Correct 477 ms 24860 KB Output is correct
105 Correct 534 ms 22656 KB Output is correct
106 Correct 460 ms 29736 KB Output is correct
107 Correct 498 ms 29352 KB Output is correct
108 Correct 562 ms 29516 KB Output is correct
109 Correct 523 ms 29608 KB Output is correct
110 Correct 539 ms 24488 KB Output is correct
111 Correct 556 ms 29352 KB Output is correct
112 Correct 542 ms 23064 KB Output is correct
113 Correct 549 ms 21632 KB Output is correct
114 Correct 568 ms 29708 KB Output is correct
115 Correct 312 ms 21512 KB Output is correct
116 Correct 313 ms 21588 KB Output is correct
117 Correct 418 ms 21672 KB Output is correct
118 Correct 423 ms 21680 KB Output is correct
119 Correct 497 ms 21584 KB Output is correct
120 Correct 483 ms 21608 KB Output is correct