oj.uz

Submission #940341

# Submission time Handle Problem Language Result Execution time Memory
940341 2024-03-07T08:16:22 Z haxorman Financial Report (JOI21_financial) C++14
100 / 100
 763 ms 63680 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int mxN = 3e5 + 7;
const int SZ = exp2(ceil(log2(mxN)));
const int INF = 1e9 + 7;

int n, d, arr[mxN], seg[4*mxN], dp[mxN], dsu[mxN], lb[mxN];
bool done[mxN];
set<int> inds;
vector<int> pos[mxN];

int find(int x) {
    return dsu[x] < 0 ? x : dsu[x] = find(dsu[x]);
}

void unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return;

    if (dsu[x] > dsu[y]) {
        swap(x, y);
    }
    dsu[x] += dsu[y];
    dsu[y] = x;
    
    inds.erase(lb[x]);
    inds.erase(lb[y]);
    lb[x] = min(lb[x], lb[y]);

    if (-dsu[x] >= d) {
        inds.insert(lb[x]);
    }
}

void update(int ind, int val) {
    seg[ind+=SZ] = val;
    while (ind /= 2) {
        seg[ind] = max(seg[2*ind], seg[2*ind+1]);
    }
}

int query(int lo, int hi, int ind = 1, int l = 0, int r = SZ - 1) {
    if (lo > r || l > hi) {
        return -INF;
    }

    if (lo <= l && r <= hi) {
        return seg[ind];
    }

    int mid = (l+r)/2;
    return max(query(lo,hi,2*ind,l,mid), query(lo,hi,2*ind+1,mid+1,r));
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> d;
    
    vector<int> vec;
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
        vec.push_back(arr[i]);
    }
    sort(vec.begin(), vec.end());
    
    int val = 1;
    map<int,int> conv;
    for (int i = 0; i < n; ++i) {
        if (conv.find(vec[i]) == conv.end()) {
            conv[vec[i]] = val++;
        }
    }
    
    vec.clear();
    for (int i = 0; i < n; ++i) {
        arr[i] = conv[arr[i]];

        if (pos[arr[i]].empty()) {
            vec.push_back(arr[i]);
        }
        pos[arr[i]].push_back(i);
        lb[i] = i;

        if (i < n-1) {
            update(i, -INF);
        }
    }
    sort(vec.begin(), vec.end());
    
    inds.insert(n);
    memset(dsu, -1, sizeof(dsu));
    for (int i = vec.size()-1; i >= 0; --i) {
        for (auto x : pos[vec[i]]) {
            int to = *inds.upper_bound(x);
            dp[x] = query(x, min(n-1, to+d-1)) + 1;
        }

        for (auto x : pos[vec[i]]) {
            update(x, dp[x]);

            done[x] = true;
            if (d == 1) {
                inds.insert(x);
            }

            if (done[x+1]) {
                unite(x,x+1);
            }
            if (x && done[x-1]) {
                unite(x,x-1);
            }
        }
    }
    
    /*
    for (int i = 0; i < n; ++i) {
        cout << query(i,i) << ' ';
    }
    cout << "\n";
    */

    cout << query(0, n-1) << "\n";
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 21084 KB Output is correct
5 Correct 3 ms 21084 KB Output is correct
6 Correct 4 ms 21084 KB Output is correct
7 Correct 3 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 5 ms 21084 KB Output is correct
10 Correct 3 ms 21084 KB Output is correct
11 Correct 3 ms 21084 KB Output is correct
12 Correct 4 ms 21084 KB Output is correct
13 Correct 3 ms 21080 KB Output is correct
14 Correct 3 ms 21336 KB Output is correct
15 Correct 3 ms 21084 KB Output is correct
16 Correct 3 ms 21336 KB Output is correct
17 Correct 4 ms 21084 KB Output is correct
18 Correct 3 ms 21084 KB Output is correct
19 Correct 3 ms 21084 KB Output is correct
20 Correct 3 ms 21084 KB Output is correct
21 Correct 4 ms 21152 KB Output is correct
22 Correct 4 ms 21084 KB Output is correct
23 Correct 4 ms 21084 KB Output is correct
24 Correct 3 ms 21084 KB Output is correct
25 Correct 4 ms 21084 KB Output is correct
26 Correct 3 ms 21084 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 21084 KB Output is correct
5 Correct 3 ms 21084 KB Output is correct
6 Correct 4 ms 21084 KB Output is correct
7 Correct 3 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 5 ms 21084 KB Output is correct
10 Correct 3 ms 21084 KB Output is correct
11 Correct 3 ms 21084 KB Output is correct
12 Correct 4 ms 21084 KB Output is correct
13 Correct 3 ms 21080 KB Output is correct
14 Correct 3 ms 21336 KB Output is correct
15 Correct 3 ms 21084 KB Output is correct
16 Correct 3 ms 21336 KB Output is correct
17 Correct 4 ms 21084 KB Output is correct
18 Correct 3 ms 21084 KB Output is correct
19 Correct 3 ms 21084 KB Output is correct
20 Correct 3 ms 21084 KB Output is correct
21 Correct 4 ms 21152 KB Output is correct
22 Correct 4 ms 21084 KB Output is correct
23 Correct 4 ms 21084 KB Output is correct
24 Correct 3 ms 21084 KB Output is correct
25 Correct 4 ms 21084 KB Output is correct
26 Correct 3 ms 21084 KB Output is correct
27 Correct 4 ms 21164 KB Output is correct
28 Correct 4 ms 21124 KB Output is correct
29 Correct 3 ms 21084 KB Output is correct
30 Correct 4 ms 21084 KB Output is correct
31 Correct 4 ms 21128 KB Output is correct
32 Correct 4 ms 21084 KB Output is correct
33 Correct 4 ms 21084 KB Output is correct
34 Correct 4 ms 21084 KB Output is correct
35 Correct 4 ms 21124 KB Output is correct
36 Correct 4 ms 21080 KB Output is correct
37 Correct 4 ms 21340 KB Output is correct
38 Correct 4 ms 21084 KB Output is correct
39 Correct 4 ms 21084 KB Output is correct
40 Correct 4 ms 21080 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 21084 KB Output is correct
5 Correct 3 ms 21084 KB Output is correct
6 Correct 4 ms 21084 KB Output is correct
7 Correct 3 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 5 ms 21084 KB Output is correct
10 Correct 3 ms 21084 KB Output is correct
11 Correct 3 ms 21084 KB Output is correct
12 Correct 4 ms 21084 KB Output is correct
13 Correct 3 ms 21080 KB Output is correct
14 Correct 3 ms 21336 KB Output is correct
15 Correct 3 ms 21084 KB Output is correct
16 Correct 3 ms 21336 KB Output is correct
17 Correct 4 ms 21084 KB Output is correct
18 Correct 3 ms 21084 KB Output is correct
19 Correct 3 ms 21084 KB Output is correct
20 Correct 3 ms 21084 KB Output is correct
21 Correct 4 ms 21152 KB Output is correct
22 Correct 4 ms 21084 KB Output is correct
23 Correct 4 ms 21084 KB Output is correct
24 Correct 3 ms 21084 KB Output is correct
25 Correct 4 ms 21084 KB Output is correct
26 Correct 3 ms 21084 KB Output is correct
27 Correct 4 ms 21164 KB Output is correct
28 Correct 4 ms 21124 KB Output is correct
29 Correct 3 ms 21084 KB Output is correct
30 Correct 4 ms 21084 KB Output is correct
31 Correct 4 ms 21128 KB Output is correct
32 Correct 4 ms 21084 KB Output is correct
33 Correct 4 ms 21084 KB Output is correct
34 Correct 4 ms 21084 KB Output is correct
35 Correct 4 ms 21124 KB Output is correct
36 Correct 4 ms 21080 KB Output is correct
37 Correct 4 ms 21340 KB Output is correct
38 Correct 4 ms 21084 KB Output is correct
39 Correct 4 ms 21084 KB Output is correct
40 Correct 4 ms 21080 KB Output is correct
41 Correct 11 ms 21340 KB Output is correct
42 Correct 11 ms 21852 KB Output is correct
43 Correct 8 ms 21596 KB Output is correct
44 Correct 8 ms 21340 KB Output is correct
45 Correct 8 ms 21400 KB Output is correct
46 Correct 10 ms 21852 KB Output is correct
47 Correct 9 ms 21696 KB Output is correct
48 Correct 10 ms 21852 KB Output is correct
49 Correct 9 ms 21916 KB Output is correct
50 Correct 10 ms 21852 KB Output is correct
51 Correct 10 ms 21848 KB Output is correct
52 Correct 10 ms 21852 KB Output is correct
53 Correct 8 ms 21908 KB Output is correct
54 Correct 9 ms 21848 KB Output is correct
55 Correct 11 ms 21940 KB Output is correct
56 Correct 9 ms 21932 KB Output is correct
57 Correct 10 ms 21932 KB Output is correct
58 Correct 8 ms 21852 KB Output is correct
59 Correct 8 ms 21852 KB Output is correct
60 Correct 9 ms 21852 KB Output is correct
61 Correct 8 ms 21852 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 32760 KB Output is correct
2 Correct 205 ms 35684 KB Output is correct
3 Correct 283 ms 37048 KB Output is correct
4 Correct 731 ms 58812 KB Output is correct
5 Correct 549 ms 61640 KB Output is correct
6 Correct 763 ms 63680 KB Output is correct
7 Correct 243 ms 59328 KB Output is correct
8 Correct 263 ms 58808 KB Output is correct
9 Correct 290 ms 59328 KB Output is correct
10 Correct 303 ms 59184 KB Output is correct
11 Correct 464 ms 60248 KB Output is correct
12 Correct 498 ms 60540 KB Output is correct
13 Correct 517 ms 58940 KB Output is correct
14 Correct 637 ms 60164 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 32008 KB Output is correct
2 Correct 170 ms 32060 KB Output is correct
3 Correct 227 ms 33984 KB Output is correct
4 Correct 580 ms 58332 KB Output is correct
5 Correct 507 ms 58300 KB Output is correct
6 Correct 567 ms 58068 KB Output is correct
7 Correct 249 ms 58424 KB Output is correct
8 Correct 248 ms 58720 KB Output is correct
9 Correct 286 ms 57536 KB Output is correct
10 Correct 351 ms 57636 KB Output is correct
11 Correct 530 ms 58004 KB Output is correct
12 Correct 435 ms 58544 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 19032 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 21084 KB Output is correct
5 Correct 3 ms 21084 KB Output is correct
6 Correct 4 ms 21084 KB Output is correct
7 Correct 3 ms 21084 KB Output is correct
8 Correct 4 ms 21084 KB Output is correct
9 Correct 5 ms 21084 KB Output is correct
10 Correct 3 ms 21084 KB Output is correct
11 Correct 3 ms 21084 KB Output is correct
12 Correct 4 ms 21084 KB Output is correct
13 Correct 3 ms 21080 KB Output is correct
14 Correct 3 ms 21336 KB Output is correct
15 Correct 3 ms 21084 KB Output is correct
16 Correct 3 ms 21336 KB Output is correct
17 Correct 4 ms 21084 KB Output is correct
18 Correct 3 ms 21084 KB Output is correct
19 Correct 3 ms 21084 KB Output is correct
20 Correct 3 ms 21084 KB Output is correct
21 Correct 4 ms 21152 KB Output is correct
22 Correct 4 ms 21084 KB Output is correct
23 Correct 4 ms 21084 KB Output is correct
24 Correct 3 ms 21084 KB Output is correct
25 Correct 4 ms 21084 KB Output is correct
26 Correct 3 ms 21084 KB Output is correct
27 Correct 4 ms 21164 KB Output is correct
28 Correct 4 ms 21124 KB Output is correct
29 Correct 3 ms 21084 KB Output is correct
30 Correct 4 ms 21084 KB Output is correct
31 Correct 4 ms 21128 KB Output is correct
32 Correct 4 ms 21084 KB Output is correct
33 Correct 4 ms 21084 KB Output is correct
34 Correct 4 ms 21084 KB Output is correct
35 Correct 4 ms 21124 KB Output is correct
36 Correct 4 ms 21080 KB Output is correct
37 Correct 4 ms 21340 KB Output is correct
38 Correct 4 ms 21084 KB Output is correct
39 Correct 4 ms 21084 KB Output is correct
40 Correct 4 ms 21080 KB Output is correct
41 Correct 11 ms 21340 KB Output is correct
42 Correct 11 ms 21852 KB Output is correct
43 Correct 8 ms 21596 KB Output is correct
44 Correct 8 ms 21340 KB Output is correct
45 Correct 8 ms 21400 KB Output is correct
46 Correct 10 ms 21852 KB Output is correct
47 Correct 9 ms 21696 KB Output is correct
48 Correct 10 ms 21852 KB Output is correct
49 Correct 9 ms 21916 KB Output is correct
50 Correct 10 ms 21852 KB Output is correct
51 Correct 10 ms 21848 KB Output is correct
52 Correct 10 ms 21852 KB Output is correct
53 Correct 8 ms 21908 KB Output is correct
54 Correct 9 ms 21848 KB Output is correct
55 Correct 11 ms 21940 KB Output is correct
56 Correct 9 ms 21932 KB Output is correct
57 Correct 10 ms 21932 KB Output is correct
58 Correct 8 ms 21852 KB Output is correct
59 Correct 8 ms 21852 KB Output is correct
60 Correct 9 ms 21852 KB Output is correct
61 Correct 8 ms 21852 KB Output is correct
62 Correct 140 ms 32760 KB Output is correct
63 Correct 205 ms 35684 KB Output is correct
64 Correct 283 ms 37048 KB Output is correct
65 Correct 731 ms 58812 KB Output is correct
66 Correct 549 ms 61640 KB Output is correct
67 Correct 763 ms 63680 KB Output is correct
68 Correct 243 ms 59328 KB Output is correct
69 Correct 263 ms 58808 KB Output is correct
70 Correct 290 ms 59328 KB Output is correct
71 Correct 303 ms 59184 KB Output is correct
72 Correct 464 ms 60248 KB Output is correct
73 Correct 498 ms 60540 KB Output is correct
74 Correct 517 ms 58940 KB Output is correct
75 Correct 637 ms 60164 KB Output is correct
76 Correct 123 ms 32008 KB Output is correct
77 Correct 170 ms 32060 KB Output is correct
78 Correct 227 ms 33984 KB Output is correct
79 Correct 580 ms 58332 KB Output is correct
80 Correct 507 ms 58300 KB Output is correct
81 Correct 567 ms 58068 KB Output is correct
82 Correct 249 ms 58424 KB Output is correct
83 Correct 248 ms 58720 KB Output is correct
84 Correct 286 ms 57536 KB Output is correct
85 Correct 351 ms 57636 KB Output is correct
86 Correct 530 ms 58004 KB Output is correct
87 Correct 435 ms 58544 KB Output is correct
88 Correct 319 ms 36976 KB Output is correct
89 Correct 649 ms 61036 KB Output is correct
90 Correct 394 ms 38960 KB Output is correct
91 Correct 556 ms 58900 KB Output is correct
92 Correct 147 ms 36036 KB Output is correct
93 Correct 216 ms 34812 KB Output is correct
94 Correct 510 ms 51976 KB Output is correct
95 Correct 563 ms 60452 KB Output is correct
96 Correct 571 ms 60696 KB Output is correct
97 Correct 633 ms 59220 KB Output is correct
98 Correct 556 ms 59332 KB Output is correct
99 Correct 563 ms 59256 KB Output is correct
100 Correct 560 ms 59064 KB Output is correct
101 Correct 260 ms 59016 KB Output is correct
102 Correct 296 ms 59324 KB Output is correct
103 Correct 325 ms 59072 KB Output is correct
104 Correct 405 ms 58876 KB Output is correct
105 Correct 395 ms 60448 KB Output is correct
106 Correct 354 ms 58844 KB Output is correct
107 Correct 387 ms 59648 KB Output is correct
108 Correct 592 ms 59864 KB Output is correct
109 Correct 516 ms 60276 KB Output is correct
110 Correct 565 ms 59792 KB Output is correct
111 Correct 548 ms 60608 KB Output is correct
112 Correct 505 ms 60296 KB Output is correct
113 Correct 547 ms 60424 KB Output is correct
114 Correct 529 ms 59020 KB Output is correct
115 Correct 263 ms 60252 KB Output is correct
116 Correct 268 ms 59120 KB Output is correct
117 Correct 337 ms 59920 KB Output is correct
118 Correct 346 ms 58816 KB Output is correct
119 Correct 373 ms 60388 KB Output is correct
120 Correct 393 ms 59076 KB Output is correct