oj.uz

Submission #536352

# Submission time Handle Problem Language Result Execution time Memory
536352 2022-03-13T02:35:38 Z sare Financial Report (JOI21_financial) C++17
100 / 100
 594 ms 27528 KB 
//In the name of Allah :)
#include <bits/stdc++.h>
using namespace std;
string to_string(char c) { return string(1,c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return (string)s; }
string to_string(string s) { return s; }
template<class A> string to_string(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
string to_string(vector<bool> v) { 
    string res = "{"; for(int i = 0; i < (int)v.size(); i++) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> string to_string(bitset<SZ> b) {
    string res = ""; for(size_t i = 0; i < SZ; i++) res += char('0'+b[i]);
    return res; }
template<class A, class B> string to_string(pair<A,B> p);
template<class T> string to_string(T v) { // containers with begin(), end()
    bool fst = 1; string res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += to_string(x);
    }
    res += "}"; return res;
}
template<class A, class B> string to_string(pair<A,B> p) {
    return "("+to_string(p.first)+", "+to_string(p.second)+")"; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define wis(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "] : [", DBG(__VA_ARGS__)
#else
#define wis(...) 0
#endif
typedef long long ll;
typedef long double ld;
#define all(x) (x).begin(), (x).end()
const int MAXN = 3e5 + 10;
int n, d, a[MAXN], L[MAXN], dp[MAXN];
pair<int, int> p[MAXN];

struct SegTree {
    int seg[MAXN << 2];

    void set (int nd, int cl, int cr, int ind, int val) {
        if (cr - cl == 1) {
            seg[nd] = val;
            return;
        }
        int lc = nd << 1, rc = lc | 1, mid = (cl + cr) >> 1;
        if (ind < mid) {
            set(lc, cl, mid, ind, val);
        }
        else {
            set(rc, mid, cr, ind, val);
        }
        seg[nd] = max(seg[lc], seg[rc]);
    }
    inline void set (int ind, int val) {
        set(1, 0, n, ind, val);
    }

    int get (int nd, int cl, int cr, int l, int r) {
        if (cl == l && cr == r) {
            return seg[nd];
        }
        int lc = nd << 1, rc = lc | 1, mid = (cl + cr) >> 1, res = 0;
        if (l < mid) {
            res = max(res, get(lc, cl, mid, l, min(mid, r)));
        }
        if (r > mid) {
            res = max(res, get(rc, mid, cr, max(mid, l), r));
        }
        return res;
    }
    inline int get (int l, int r) {
        return get(1, 0, n, l, r);
    }
} seg;

inline int get (int v) {
    return L[v] == v ? v : L[v] = get(L[v]);
}

int main() {
    ios::sync_with_stdio(0);cin.tie(0);
    cin >> n >> d;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        p[i] = {a[i], -i};
    }
    sort(p, p + n);

    set<int> cur;
    for (int i = 0; i < n; ++i) {
        int ind = -p[i].second;
        if (cur.empty() || ind < *cur.begin()) {
            L[ind] = ind;
            dp[ind] = 1;
            cur.insert(ind);
        }
        else {
            auto it = --cur.lower_bound(ind);
            if (ind - *it <= d) {
                L[ind] = get(*it);
            }
            else {
                L[ind] = ind;
            }
            dp[ind] = seg.get(L[ind], ind) + 1;
        }
        cur.insert(ind);
        seg.set(ind, dp[ind]);

        auto it = cur.upper_bound(ind);
        if (it != cur.end() && *it - ind <= d) {
            L[*it] = L[ind];
        }
    }
    cout << seg.seg[1] << '\n';
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 324 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 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 324 KB Output is correct
37 Correct 1 ms 328 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 324 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 324 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 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 324 KB Output is correct
37 Correct 1 ms 328 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 324 KB Output is correct
41 Correct 7 ms 936 KB Output is correct
42 Correct 8 ms 852 KB Output is correct
43 Correct 7 ms 848 KB Output is correct
44 Correct 7 ms 852 KB Output is correct
45 Correct 6 ms 796 KB Output is correct
46 Correct 7 ms 852 KB Output is correct
47 Correct 7 ms 852 KB Output is correct
48 Correct 8 ms 852 KB Output is correct
49 Correct 5 ms 852 KB Output is correct
50 Correct 5 ms 856 KB Output is correct
51 Correct 5 ms 852 KB Output is correct
52 Correct 6 ms 852 KB Output is correct
53 Correct 4 ms 852 KB Output is correct
54 Correct 5 ms 848 KB Output is correct
55 Correct 8 ms 852 KB Output is correct
56 Correct 6 ms 848 KB Output is correct
57 Correct 5 ms 852 KB Output is correct
58 Correct 4 ms 852 KB Output is correct
59 Correct 5 ms 852 KB Output is correct
60 Correct 5 ms 848 KB Output is correct
61 Correct 5 ms 852 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 27208 KB Output is correct
2 Correct 245 ms 26924 KB Output is correct
3 Correct 384 ms 24532 KB Output is correct
4 Correct 519 ms 24496 KB Output is correct
5 Correct 383 ms 24540 KB Output is correct
6 Correct 492 ms 24516 KB Output is correct
7 Correct 244 ms 24456 KB Output is correct
8 Correct 207 ms 24516 KB Output is correct
9 Correct 181 ms 24456 KB Output is correct
10 Correct 207 ms 24512 KB Output is correct
11 Correct 277 ms 24492 KB Output is correct
12 Correct 352 ms 24572 KB Output is correct
13 Correct 404 ms 24576 KB Output is correct
14 Correct 545 ms 24580 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 236 ms 27528 KB Output is correct
2 Correct 390 ms 27212 KB Output is correct
3 Correct 482 ms 27208 KB Output is correct
4 Correct 553 ms 27352 KB Output is correct
5 Correct 504 ms 27192 KB Output is correct
6 Correct 530 ms 27224 KB Output is correct
7 Correct 224 ms 27284 KB Output is correct
8 Correct 212 ms 27204 KB Output is correct
9 Correct 211 ms 27064 KB Output is correct
10 Correct 274 ms 27240 KB Output is correct
11 Correct 508 ms 27264 KB Output is correct
12 Correct 406 ms 27400 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 324 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 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 324 KB Output is correct
37 Correct 1 ms 328 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 324 KB Output is correct
41 Correct 7 ms 936 KB Output is correct
42 Correct 8 ms 852 KB Output is correct
43 Correct 7 ms 848 KB Output is correct
44 Correct 7 ms 852 KB Output is correct
45 Correct 6 ms 796 KB Output is correct
46 Correct 7 ms 852 KB Output is correct
47 Correct 7 ms 852 KB Output is correct
48 Correct 8 ms 852 KB Output is correct
49 Correct 5 ms 852 KB Output is correct
50 Correct 5 ms 856 KB Output is correct
51 Correct 5 ms 852 KB Output is correct
52 Correct 6 ms 852 KB Output is correct
53 Correct 4 ms 852 KB Output is correct
54 Correct 5 ms 848 KB Output is correct
55 Correct 8 ms 852 KB Output is correct
56 Correct 6 ms 848 KB Output is correct
57 Correct 5 ms 852 KB Output is correct
58 Correct 4 ms 852 KB Output is correct
59 Correct 5 ms 852 KB Output is correct
60 Correct 5 ms 848 KB Output is correct
61 Correct 5 ms 852 KB Output is correct
62 Correct 220 ms 27208 KB Output is correct
63 Correct 245 ms 26924 KB Output is correct
64 Correct 384 ms 24532 KB Output is correct
65 Correct 519 ms 24496 KB Output is correct
66 Correct 383 ms 24540 KB Output is correct
67 Correct 492 ms 24516 KB Output is correct
68 Correct 244 ms 24456 KB Output is correct
69 Correct 207 ms 24516 KB Output is correct
70 Correct 181 ms 24456 KB Output is correct
71 Correct 207 ms 24512 KB Output is correct
72 Correct 277 ms 24492 KB Output is correct
73 Correct 352 ms 24572 KB Output is correct
74 Correct 404 ms 24576 KB Output is correct
75 Correct 545 ms 24580 KB Output is correct
76 Correct 236 ms 27528 KB Output is correct
77 Correct 390 ms 27212 KB Output is correct
78 Correct 482 ms 27208 KB Output is correct
79 Correct 553 ms 27352 KB Output is correct
80 Correct 504 ms 27192 KB Output is correct
81 Correct 530 ms 27224 KB Output is correct
82 Correct 224 ms 27284 KB Output is correct
83 Correct 212 ms 27204 KB Output is correct
84 Correct 211 ms 27064 KB Output is correct
85 Correct 274 ms 27240 KB Output is correct
86 Correct 508 ms 27264 KB Output is correct
87 Correct 406 ms 27400 KB Output is correct
88 Correct 478 ms 24656 KB Output is correct
89 Correct 561 ms 24528 KB Output is correct
90 Correct 564 ms 24652 KB Output is correct
91 Correct 528 ms 24460 KB Output is correct
92 Correct 373 ms 24736 KB Output is correct
93 Correct 484 ms 24472 KB Output is correct
94 Correct 544 ms 24592 KB Output is correct
95 Correct 392 ms 24516 KB Output is correct
96 Correct 521 ms 24492 KB Output is correct
97 Correct 550 ms 24576 KB Output is correct
98 Correct 594 ms 24504 KB Output is correct
99 Correct 546 ms 24528 KB Output is correct
100 Correct 463 ms 24584 KB Output is correct
101 Correct 222 ms 24520 KB Output is correct
102 Correct 201 ms 24576 KB Output is correct
103 Correct 241 ms 24488 KB Output is correct
104 Correct 268 ms 24500 KB Output is correct
105 Correct 309 ms 24524 KB Output is correct
106 Correct 296 ms 24528 KB Output is correct
107 Correct 307 ms 24704 KB Output is correct
108 Correct 558 ms 24616 KB Output is correct
109 Correct 300 ms 24620 KB Output is correct
110 Correct 466 ms 24504 KB Output is correct
111 Correct 540 ms 24468 KB Output is correct
112 Correct 273 ms 24560 KB Output is correct
113 Correct 502 ms 24824 KB Output is correct
114 Correct 534 ms 24524 KB Output is correct
115 Correct 222 ms 24504 KB Output is correct
116 Correct 254 ms 24572 KB Output is correct
117 Correct 280 ms 24532 KB Output is correct
118 Correct 285 ms 24524 KB Output is correct
119 Correct 231 ms 24628 KB Output is correct
120 Correct 237 ms 24492 KB Output is correct