oj.uz

Submission #424386

# Submission time Handle Problem Language Result Execution time Memory
424386 2021-06-11T21:16:06 Z Osama_Alkhodairy Financial Report (JOI21_financial) C++17
100 / 100
 343 ms 12100 KB 
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 300001;

int n, d, tree[2 * N];
vector <int> a;

void update(int p, int v){
    for(tree[p += n] = v ; p > 1 ; p >>= 1){
        tree[p >> 1] = max(tree[p], tree[p ^ 1]);
    }
}
int query(int l, int r){
    r++;
    int ret = 0;
    for(l += n, r += n ; l < r ; l >>= 1, r >>= 1){
        if(l & 1) ret = max(ret, tree[l++]);
        if(r & 1) ret = max(ret, tree[--r]);
    }
    return ret;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> d;
    a.resize(n);
    for(auto &i : a) cin >> i;
    vector <pair <int, int> > all;
    for(int i = 0 ; i < n ; i++){
        all.push_back(make_pair(a[i], i));
    }
    sort(all.begin(), all.end(), [&](pair <int, int> &l, pair <int, int> &r){
        return make_pair(l.first, -l.second) < make_pair(r.first, -r.second);
    });
    set <pair <int, int> > s;
    vector <int> f(n);
    for(auto &i : all){
        int idx = i.second;
        auto cur = make_pair(idx, idx);
        auto it = s.lower_bound(make_pair(idx, -1));
        vector <pair <int, int> > to_erase;
        if(it != s.end() && idx + d >= it->first){
            cur.second = it->second;
            to_erase.push_back(*it);
        }
        if(it != s.begin()){
            it--;
            if(idx - d <= it->second){
                cur.first = it->first;
                cur.second = max(cur.second, it->second);
                to_erase.push_back(*it);
            }
        }
        for(auto &j : to_erase){
            s.erase(j);
        }
        f[idx] = min(cur.second + d, n - 1);
        s.insert(cur);
    }
    vector <int> dp(n);
    sort(all.begin(), all.end(), [&](pair <int, int> &l, pair <int, int> &r){
        return make_pair(-l.first, l.second) < make_pair(-r.first, r.second);
    });
    for(auto &i : all){
        int idx = i.second;
        dp[idx] = query(idx, f[idx]) + 1;
        update(idx, dp[idx]);
    }
    int ans = 0;
    for(auto &i : dp) ans = max(ans, i);
    cout << ans << endl;
}

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 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 0 ms 204 KB Output is correct
6 Correct 1 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 1 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 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 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 1 ms 204 KB Output is correct
26 Correct 0 ms 204 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 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 0 ms 204 KB Output is correct
6 Correct 1 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 1 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 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 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 1 ms 204 KB Output is correct
26 Correct 0 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 0 ms 204 KB Output is correct
2 Correct 0 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 0 ms 204 KB Output is correct
6 Correct 1 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 1 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 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 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 1 ms 204 KB Output is correct
26 Correct 0 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 6 ms 588 KB Output is correct
42 Correct 5 ms 460 KB Output is correct
43 Correct 4 ms 460 KB Output is correct
44 Correct 4 ms 460 KB Output is correct
45 Correct 3 ms 460 KB Output is correct
46 Correct 3 ms 460 KB Output is correct
47 Correct 4 ms 460 KB Output is correct
48 Correct 4 ms 460 KB Output is correct
49 Correct 4 ms 460 KB Output is correct
50 Correct 5 ms 476 KB Output is correct
51 Correct 5 ms 460 KB Output is correct
52 Correct 5 ms 460 KB Output is correct
53 Correct 3 ms 460 KB Output is correct
54 Correct 3 ms 460 KB Output is correct
55 Correct 4 ms 460 KB Output is correct
56 Correct 3 ms 464 KB Output is correct
57 Correct 4 ms 460 KB Output is correct
58 Correct 3 ms 460 KB Output is correct
59 Correct 3 ms 460 KB Output is correct
60 Correct 3 ms 460 KB Output is correct
61 Correct 3 ms 460 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 8484 KB Output is correct
2 Correct 206 ms 10820 KB Output is correct
3 Correct 249 ms 12100 KB Output is correct
4 Correct 343 ms 11972 KB Output is correct
5 Correct 263 ms 10636 KB Output is correct
6 Correct 319 ms 10936 KB Output is correct
7 Correct 84 ms 8376 KB Output is correct
8 Correct 100 ms 8484 KB Output is correct
9 Correct 95 ms 8504 KB Output is correct
10 Correct 110 ms 8512 KB Output is correct
11 Correct 274 ms 8640 KB Output is correct
12 Correct 256 ms 8916 KB Output is correct
13 Correct 182 ms 8448 KB Output is correct
14 Correct 273 ms 8660 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 8504 KB Output is correct
2 Correct 147 ms 8472 KB Output is correct
3 Correct 161 ms 8500 KB Output is correct
4 Correct 168 ms 8584 KB Output is correct
5 Correct 160 ms 8508 KB Output is correct
6 Correct 167 ms 8452 KB Output is correct
7 Correct 114 ms 8500 KB Output is correct
8 Correct 106 ms 8612 KB Output is correct
9 Correct 112 ms 8420 KB Output is correct
10 Correct 165 ms 8500 KB Output is correct
11 Correct 159 ms 8528 KB Output is correct
12 Correct 141 ms 8532 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 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 0 ms 204 KB Output is correct
6 Correct 1 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 1 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 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 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 1 ms 204 KB Output is correct
26 Correct 0 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 6 ms 588 KB Output is correct
42 Correct 5 ms 460 KB Output is correct
43 Correct 4 ms 460 KB Output is correct
44 Correct 4 ms 460 KB Output is correct
45 Correct 3 ms 460 KB Output is correct
46 Correct 3 ms 460 KB Output is correct
47 Correct 4 ms 460 KB Output is correct
48 Correct 4 ms 460 KB Output is correct
49 Correct 4 ms 460 KB Output is correct
50 Correct 5 ms 476 KB Output is correct
51 Correct 5 ms 460 KB Output is correct
52 Correct 5 ms 460 KB Output is correct
53 Correct 3 ms 460 KB Output is correct
54 Correct 3 ms 460 KB Output is correct
55 Correct 4 ms 460 KB Output is correct
56 Correct 3 ms 464 KB Output is correct
57 Correct 4 ms 460 KB Output is correct
58 Correct 3 ms 460 KB Output is correct
59 Correct 3 ms 460 KB Output is correct
60 Correct 3 ms 460 KB Output is correct
61 Correct 3 ms 460 KB Output is correct
62 Correct 106 ms 8484 KB Output is correct
63 Correct 206 ms 10820 KB Output is correct
64 Correct 249 ms 12100 KB Output is correct
65 Correct 343 ms 11972 KB Output is correct
66 Correct 263 ms 10636 KB Output is correct
67 Correct 319 ms 10936 KB Output is correct
68 Correct 84 ms 8376 KB Output is correct
69 Correct 100 ms 8484 KB Output is correct
70 Correct 95 ms 8504 KB Output is correct
71 Correct 110 ms 8512 KB Output is correct
72 Correct 274 ms 8640 KB Output is correct
73 Correct 256 ms 8916 KB Output is correct
74 Correct 182 ms 8448 KB Output is correct
75 Correct 273 ms 8660 KB Output is correct
76 Correct 112 ms 8504 KB Output is correct
77 Correct 147 ms 8472 KB Output is correct
78 Correct 161 ms 8500 KB Output is correct
79 Correct 168 ms 8584 KB Output is correct
80 Correct 160 ms 8508 KB Output is correct
81 Correct 167 ms 8452 KB Output is correct
82 Correct 114 ms 8500 KB Output is correct
83 Correct 106 ms 8612 KB Output is correct
84 Correct 112 ms 8420 KB Output is correct
85 Correct 165 ms 8500 KB Output is correct
86 Correct 159 ms 8528 KB Output is correct
87 Correct 141 ms 8532 KB Output is correct
88 Correct 280 ms 10436 KB Output is correct
89 Correct 276 ms 9616 KB Output is correct
90 Correct 240 ms 9016 KB Output is correct
91 Correct 175 ms 8528 KB Output is correct
92 Correct 144 ms 8432 KB Output is correct
93 Correct 173 ms 8524 KB Output is correct
94 Correct 162 ms 8496 KB Output is correct
95 Correct 245 ms 10140 KB Output is correct
96 Correct 241 ms 9212 KB Output is correct
97 Correct 189 ms 8600 KB Output is correct
98 Correct 173 ms 8604 KB Output is correct
99 Correct 164 ms 8516 KB Output is correct
100 Correct 182 ms 8612 KB Output is correct
101 Correct 100 ms 8520 KB Output is correct
102 Correct 112 ms 8424 KB Output is correct
103 Correct 135 ms 8524 KB Output is correct
104 Correct 135 ms 8516 KB Output is correct
105 Correct 149 ms 8584 KB Output is correct
106 Correct 139 ms 8524 KB Output is correct
107 Correct 161 ms 8484 KB Output is correct
108 Correct 157 ms 8452 KB Output is correct
109 Correct 162 ms 8632 KB Output is correct
110 Correct 188 ms 8764 KB Output is correct
111 Correct 179 ms 8524 KB Output is correct
112 Correct 144 ms 8472 KB Output is correct
113 Correct 172 ms 8756 KB Output is correct
114 Correct 156 ms 8476 KB Output is correct
115 Correct 101 ms 8480 KB Output is correct
116 Correct 104 ms 8500 KB Output is correct
117 Correct 137 ms 8516 KB Output is correct
118 Correct 133 ms 8500 KB Output is correct
119 Correct 137 ms 8516 KB Output is correct
120 Correct 139 ms 8648 KB Output is correct