oj.uz

Submission #575679

# Submission time Handle Problem Language Result Execution time Memory
575679 2022-06-11T07:57:45 Z vaaven Financial Report (JOI21_financial) C++14
100 / 100
 514 ms 29796 KB 
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
//#pragma GCC target("popcnt")
//#pragma comment(linker, "/STACK:36777216")
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <array>
#include <unordered_set>
#include <cmath>
#include <cassert>
#include <unordered_map>

#define DEBUG
#define pqueue priority_queue
#define pb(x) push_back(x)
#define endl '\n'
#define all(x) x.begin(), x.end()
//#define int long long

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ull> vull;
typedef vector<ll> vll;
// typedef tuple<ll, ll, ll> tiii;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<vector<int> > vvi;
typedef vector<char> vc;

const ll inf = 1e9 + 228;
const ll infll = 1e18 + 228;
const ll mod = 1e9 + 7;
const ll mod3 = 1e9 + 7;
//static const int maxn = 1e6 + 228;
const ld eps = 1e-6;
const ll mod2 = 998244353;
const ld PI = atan2l(0, -1);

void fast_io() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    freopen("input.txt", "r", stdin);
//    freopen("lumber.out", "w", stdout);
}

const int maxn = 3e5 + 228;
int link[maxn];
int sz[maxn];
int lef[maxn];

int find(int v) {
    if (link[v] == v)
        return v;
    return link[v] = find(link[v]);
}

void unite(int a, int b) {
    a = find(a);
    b = find(b);
    if (a == b)
        return;
    if (sz[a] > sz[b])
        swap(a, b);
    sz[b] += sz[a];
    link[a] = b;
    lef[b] = min(lef[b], lef[a]);
}

bool cmp(pii a, pii b) {
    if (a.first == b.first) {
        return a.second > b.second;
    } else {
        return a.first < b.first;
    }
}

int t[maxn * 4];

int get(int v, int l, int r, int ql, int qr) {
    if (ql <= l && r <= qr) {
        return t[v];
    } else if (l > qr || ql > r) {
        return 0;
    } else {
        int mid = (l + r) / 2;
        return max(get(v * 2, l, mid, ql, qr), get(v * 2 + 1, mid + 1, r, ql, qr));
    }
}

void upd(int v, int l, int r, int k, int k_new) {
    if (l == r) {
        t[v] = k_new;
    } else {
        int mid = (l + r) / 2;
        if (k <= mid) {
            upd(v * 2, l, mid, k, k_new);
        } else {
            upd(v * 2 + 1, mid + 1, r, k, k_new);
        }
        t[v] = max(t[v * 2], t[v * 2 + 1]);
    }
}

void solve() {
    for (int i = 0; i < maxn; i++) {
        link[i] = i;
        sz[i] = 1;
        lef[i] = i;
    }
    int n, d;
    cin >> n >> d;
    vector<int> a(n);
    for (int &i: a)
        cin >> i;
    vector<pii> kek;
    for (int i = 0; i < n; i++) {
        kek.pb(make_pair(a[i], i));
    }
    sort(all(kek), cmp);
    set<int> lol;
    vector<int> dp(n, 0);
    for (pii i: kek) {
        auto it = lol.lower_bound(i.second);
        if (it != lol.end()) {
            if (abs(i.second - *it) <= d)
                unite(i.second, *it);
        }
        if (it != lol.begin()) {
            it--;
            if (abs(i.second - *it) <= d)
                unite(i.second, *it);
        }
        lol.insert(i.second);
        int root = find(i.second);
        int l = lef[root];
        dp[i.second] = get(1, 0, maxn, max(l - d, 0), i.second - 1) + 1;
        upd(1, 0, maxn, i.second, dp[i.second]);
    }
    cout << *max_element(all(dp)) << endl;
}

/*
7 1
100 600 600 200 300 500 500
========
6 6
100 500 200 400 600 300
========
11 2
1 4 4 2 2 4 9 5 7 0 3
 */


signed main() {
    srand(time(NULL));
    fast_io();
    int q = 1;
//    cin >> q;
    while (q--) {
        solve();
    }
    return 0;
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 2 ms 3848 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 3 ms 3860 KB Output is correct
15 Correct 2 ms 3796 KB Output is correct
16 Correct 2 ms 3796 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3856 KB Output is correct
19 Correct 2 ms 3796 KB Output is correct
20 Correct 2 ms 3796 KB Output is correct
21 Correct 2 ms 3796 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 2 ms 3796 KB Output is correct
24 Correct 2 ms 3796 KB Output is correct
25 Correct 2 ms 3852 KB Output is correct
26 Correct 2 ms 3848 KB Output is correct
27 Correct 2 ms 3924 KB Output is correct
28 Correct 2 ms 3924 KB Output is correct
29 Correct 2 ms 3852 KB Output is correct
30 Correct 2 ms 3852 KB Output is correct
31 Correct 3 ms 3924 KB Output is correct
32 Correct 3 ms 3924 KB Output is correct
33 Correct 3 ms 3924 KB Output is correct
34 Correct 3 ms 3924 KB Output is correct
35 Correct 2 ms 3924 KB Output is correct
36 Correct 2 ms 3924 KB Output is correct
37 Correct 2 ms 3852 KB Output is correct
38 Correct 2 ms 3860 KB Output is correct
39 Correct 2 ms 3924 KB Output is correct
40 Correct 2 ms 3924 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 2 ms 3848 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 3 ms 3860 KB Output is correct
15 Correct 2 ms 3796 KB Output is correct
16 Correct 2 ms 3796 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3856 KB Output is correct
19 Correct 2 ms 3796 KB Output is correct
20 Correct 2 ms 3796 KB Output is correct
21 Correct 2 ms 3796 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 2 ms 3796 KB Output is correct
24 Correct 2 ms 3796 KB Output is correct
25 Correct 2 ms 3852 KB Output is correct
26 Correct 2 ms 3848 KB Output is correct
27 Correct 2 ms 3924 KB Output is correct
28 Correct 2 ms 3924 KB Output is correct
29 Correct 2 ms 3852 KB Output is correct
30 Correct 2 ms 3852 KB Output is correct
31 Correct 3 ms 3924 KB Output is correct
32 Correct 3 ms 3924 KB Output is correct
33 Correct 3 ms 3924 KB Output is correct
34 Correct 3 ms 3924 KB Output is correct
35 Correct 2 ms 3924 KB Output is correct
36 Correct 2 ms 3924 KB Output is correct
37 Correct 2 ms 3852 KB Output is correct
38 Correct 2 ms 3860 KB Output is correct
39 Correct 2 ms 3924 KB Output is correct
40 Correct 2 ms 3924 KB Output is correct
41 Correct 8 ms 4472 KB Output is correct
42 Correct 8 ms 4380 KB Output is correct
43 Correct 7 ms 4436 KB Output is correct
44 Correct 7 ms 4312 KB Output is correct
45 Correct 7 ms 4360 KB Output is correct
46 Correct 7 ms 4436 KB Output is correct
47 Correct 7 ms 4376 KB Output is correct
48 Correct 8 ms 4480 KB Output is correct
49 Correct 8 ms 4436 KB Output is correct
50 Correct 7 ms 4460 KB Output is correct
51 Correct 7 ms 4436 KB Output is correct
52 Correct 7 ms 4436 KB Output is correct
53 Correct 6 ms 4500 KB Output is correct
54 Correct 7 ms 4436 KB Output is correct
55 Correct 8 ms 4436 KB Output is correct
56 Correct 8 ms 4460 KB Output is correct
57 Correct 7 ms 4436 KB Output is correct
58 Correct 6 ms 4456 KB Output is correct
59 Correct 6 ms 4376 KB Output is correct
60 Correct 7 ms 4388 KB Output is correct
61 Correct 6 ms 4436 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 26680 KB Output is correct
2 Correct 250 ms 26648 KB Output is correct
3 Correct 362 ms 29568 KB Output is correct
4 Correct 480 ms 29584 KB Output is correct
5 Correct 346 ms 29716 KB Output is correct
6 Correct 456 ms 29568 KB Output is correct
7 Correct 205 ms 29572 KB Output is correct
8 Correct 207 ms 29572 KB Output is correct
9 Correct 175 ms 29524 KB Output is correct
10 Correct 188 ms 29560 KB Output is correct
11 Correct 294 ms 29564 KB Output is correct
12 Correct 314 ms 29588 KB Output is correct
13 Correct 361 ms 29556 KB Output is correct
14 Correct 463 ms 29616 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 26648 KB Output is correct
2 Correct 341 ms 26728 KB Output is correct
3 Correct 449 ms 29532 KB Output is correct
4 Correct 449 ms 29616 KB Output is correct
5 Correct 354 ms 29632 KB Output is correct
6 Correct 449 ms 29560 KB Output is correct
7 Correct 199 ms 29572 KB Output is correct
8 Correct 202 ms 29564 KB Output is correct
9 Correct 190 ms 29764 KB Output is correct
10 Correct 264 ms 29540 KB Output is correct
11 Correct 447 ms 29628 KB Output is correct
12 Correct 356 ms 29604 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3796 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 2 ms 3796 KB Output is correct
5 Correct 2 ms 3796 KB Output is correct
6 Correct 2 ms 3796 KB Output is correct
7 Correct 2 ms 3796 KB Output is correct
8 Correct 2 ms 3796 KB Output is correct
9 Correct 2 ms 3796 KB Output is correct
10 Correct 2 ms 3796 KB Output is correct
11 Correct 2 ms 3848 KB Output is correct
12 Correct 2 ms 3796 KB Output is correct
13 Correct 2 ms 3796 KB Output is correct
14 Correct 3 ms 3860 KB Output is correct
15 Correct 2 ms 3796 KB Output is correct
16 Correct 2 ms 3796 KB Output is correct
17 Correct 2 ms 3796 KB Output is correct
18 Correct 2 ms 3856 KB Output is correct
19 Correct 2 ms 3796 KB Output is correct
20 Correct 2 ms 3796 KB Output is correct
21 Correct 2 ms 3796 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 2 ms 3796 KB Output is correct
24 Correct 2 ms 3796 KB Output is correct
25 Correct 2 ms 3852 KB Output is correct
26 Correct 2 ms 3848 KB Output is correct
27 Correct 2 ms 3924 KB Output is correct
28 Correct 2 ms 3924 KB Output is correct
29 Correct 2 ms 3852 KB Output is correct
30 Correct 2 ms 3852 KB Output is correct
31 Correct 3 ms 3924 KB Output is correct
32 Correct 3 ms 3924 KB Output is correct
33 Correct 3 ms 3924 KB Output is correct
34 Correct 3 ms 3924 KB Output is correct
35 Correct 2 ms 3924 KB Output is correct
36 Correct 2 ms 3924 KB Output is correct
37 Correct 2 ms 3852 KB Output is correct
38 Correct 2 ms 3860 KB Output is correct
39 Correct 2 ms 3924 KB Output is correct
40 Correct 2 ms 3924 KB Output is correct
41 Correct 8 ms 4472 KB Output is correct
42 Correct 8 ms 4380 KB Output is correct
43 Correct 7 ms 4436 KB Output is correct
44 Correct 7 ms 4312 KB Output is correct
45 Correct 7 ms 4360 KB Output is correct
46 Correct 7 ms 4436 KB Output is correct
47 Correct 7 ms 4376 KB Output is correct
48 Correct 8 ms 4480 KB Output is correct
49 Correct 8 ms 4436 KB Output is correct
50 Correct 7 ms 4460 KB Output is correct
51 Correct 7 ms 4436 KB Output is correct
52 Correct 7 ms 4436 KB Output is correct
53 Correct 6 ms 4500 KB Output is correct
54 Correct 7 ms 4436 KB Output is correct
55 Correct 8 ms 4436 KB Output is correct
56 Correct 8 ms 4460 KB Output is correct
57 Correct 7 ms 4436 KB Output is correct
58 Correct 6 ms 4456 KB Output is correct
59 Correct 6 ms 4376 KB Output is correct
60 Correct 7 ms 4388 KB Output is correct
61 Correct 6 ms 4436 KB Output is correct
62 Correct 215 ms 26680 KB Output is correct
63 Correct 250 ms 26648 KB Output is correct
64 Correct 362 ms 29568 KB Output is correct
65 Correct 480 ms 29584 KB Output is correct
66 Correct 346 ms 29716 KB Output is correct
67 Correct 456 ms 29568 KB Output is correct
68 Correct 205 ms 29572 KB Output is correct
69 Correct 207 ms 29572 KB Output is correct
70 Correct 175 ms 29524 KB Output is correct
71 Correct 188 ms 29560 KB Output is correct
72 Correct 294 ms 29564 KB Output is correct
73 Correct 314 ms 29588 KB Output is correct
74 Correct 361 ms 29556 KB Output is correct
75 Correct 463 ms 29616 KB Output is correct
76 Correct 215 ms 26648 KB Output is correct
77 Correct 341 ms 26728 KB Output is correct
78 Correct 449 ms 29532 KB Output is correct
79 Correct 449 ms 29616 KB Output is correct
80 Correct 354 ms 29632 KB Output is correct
81 Correct 449 ms 29560 KB Output is correct
82 Correct 199 ms 29572 KB Output is correct
83 Correct 202 ms 29564 KB Output is correct
84 Correct 190 ms 29764 KB Output is correct
85 Correct 264 ms 29540 KB Output is correct
86 Correct 447 ms 29628 KB Output is correct
87 Correct 356 ms 29604 KB Output is correct
88 Correct 445 ms 29708 KB Output is correct
89 Correct 481 ms 29620 KB Output is correct
90 Correct 514 ms 29584 KB Output is correct
91 Correct 460 ms 29708 KB Output is correct
92 Correct 292 ms 29572 KB Output is correct
93 Correct 436 ms 29796 KB Output is correct
94 Correct 458 ms 29680 KB Output is correct
95 Correct 406 ms 29556 KB Output is correct
96 Correct 423 ms 29568 KB Output is correct
97 Correct 471 ms 29604 KB Output is correct
98 Correct 459 ms 29612 KB Output is correct
99 Correct 489 ms 29568 KB Output is correct
100 Correct 464 ms 29648 KB Output is correct
101 Correct 179 ms 29572 KB Output is correct
102 Correct 191 ms 29576 KB Output is correct
103 Correct 217 ms 29628 KB Output is correct
104 Correct 246 ms 29568 KB Output is correct
105 Correct 300 ms 29548 KB Output is correct
106 Correct 259 ms 29564 KB Output is correct
107 Correct 304 ms 29568 KB Output is correct
108 Correct 424 ms 29676 KB Output is correct
109 Correct 303 ms 29536 KB Output is correct
110 Correct 432 ms 29572 KB Output is correct
111 Correct 451 ms 29572 KB Output is correct
112 Correct 280 ms 29616 KB Output is correct
113 Correct 425 ms 29572 KB Output is correct
114 Correct 453 ms 29652 KB Output is correct
115 Correct 215 ms 29628 KB Output is correct
116 Correct 224 ms 29664 KB Output is correct
117 Correct 271 ms 29628 KB Output is correct
118 Correct 279 ms 29696 KB Output is correct
119 Correct 247 ms 29500 KB Output is correct
120 Correct 241 ms 29500 KB Output is correct