oj.uz

Submission #423156

# Submission time Handle Problem Language Result Execution time Memory
423156 2021-06-10T19:08:16 Z abdzag Financial Report (JOI21_financial) C++17
100 / 100
 1101 ms 53700 KB 
#include <bits/stdc++.h>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define f first
#define s second
#define pb push_back
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;

const int MAXN = 300100, MAXK = 20;
const ll INF = 1e17;

// DSU
int par[MAXN], mn[MAXN];
int find(int a) { return par[a] = par[a] == a ? a : find(par[a]); }
bool same(int a, int b) { return find(a) == find(b); }
void unite(int a, int b) {
    a = find(a), b = find(b);
    if (a == b) return;
    par[b] = a;
    mn[a] = min(mn[a], mn[b]);
}

int n, d;
int a[MAXN];
set<int> tmp;
unordered_map<int, int> toId;

// two segtrees. i am actually using only one in this solution (the second one was left from the solution for subtasks)
int tree[2][4 * MAXN];

void upd(int tid, int p, int val, int id = 1, int le = 1, int ri = n) {
    if (le == ri) {
        tree[tid][id] = val;
        return;
    }
    int mid = (le + ri) / 2;
    if (p <= mid)
        upd(tid, p, val, 2 * id, le, mid);
    else
        upd(tid, p, val, 2 * id + 1, mid + 1, ri);
    tree[tid][id] = max(tree[tid][2 * id], tree[tid][2 * id + 1]);
}

int get(int tid, int x, int y, int id = 1, int le = 1, int ri = n) {
    if (x > ri || y < le) return 0;
    if (x <= le && ri <= y) return tree[tid][id];
    int mid = (le + ri) / 2;
    return max(get(tid, x, y, 2 * id, le, mid), get(tid, x, y, 2 * id + 1, mid + 1, ri));
}

bool cmp(int f, int s) {
    if (a[f] != a[s])
        return a[f] < a[s];
    return f > s;
}

vi seq;
set<int> spec;

int main()
{
    FAST_IO;



    cin >> n >> d;
    FOR(i, 1, n) cin >> a[i];
    FOR(i, 1, n) par[i] = i, mn[i] = i;

    // coordinate compression which ended up being not necessary in the full solution
    FOR(i, 1, n) tmp.insert(a[i]);
    int cur = 0;
    for (int x : tmp)
        toId[x] = ++cur;
    FOR(i, 1, n) a[i] = toId[a[i]];

    FOR(i, 1, n) upd(0, i, a[i]);

    FOR(i, 1, n) seq.pb(i);

    // sorting by a[i]
    sort(seq.begin(), seq.end(), cmp);

    for (int i : seq) {

        auto it = spec.lower_bound(i);
        if (it != spec.end()) {
            int id = *it;
            if (abs(id - i) <= d) {
                unite(id, i);
            }
        }
        if (it != spec.begin()) {
            it--;
            int id = *it;
            if (abs(id - i) <= d) {
                unite(id, i);
            }
        }

        spec.insert(i);

        int cur = 1; // cur is the value of dp[i]
        int fr = mn[find(i)];
        if (fr <= i - 1) cur = max(cur, get(1, fr, i - 1) + 1);
        upd(1, i, cur);
    }

    cout << (get(1, 1, n)) << "\n";

    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 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 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 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 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 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 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 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 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 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 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 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 1 ms 332 KB Output is correct
26 Correct 0 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 1 ms 332 KB Output is correct
2 Correct 1 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 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 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 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 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 1 ms 332 KB Output is correct
26 Correct 0 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 972 KB Output is correct
42 Correct 10 ms 1420 KB Output is correct
43 Correct 7 ms 844 KB Output is correct
44 Correct 9 ms 1100 KB Output is correct
45 Correct 9 ms 1136 KB Output is correct
46 Correct 11 ms 1484 KB Output is correct
47 Correct 12 ms 1460 KB Output is correct
48 Correct 13 ms 1464 KB Output is correct
49 Correct 11 ms 1460 KB Output is correct
50 Correct 11 ms 1484 KB Output is correct
51 Correct 10 ms 1484 KB Output is correct
52 Correct 10 ms 1484 KB Output is correct
53 Correct 9 ms 1532 KB Output is correct
54 Correct 9 ms 1484 KB Output is correct
55 Correct 12 ms 1484 KB Output is correct
56 Correct 11 ms 1484 KB Output is correct
57 Correct 11 ms 1484 KB Output is correct
58 Correct 9 ms 1484 KB Output is correct
59 Correct 9 ms 1484 KB Output is correct
60 Correct 9 ms 1492 KB Output is correct
61 Correct 10 ms 1476 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 27224 KB Output is correct
2 Correct 365 ms 27244 KB Output is correct
3 Correct 560 ms 27316 KB Output is correct
4 Correct 939 ms 50076 KB Output is correct
5 Correct 737 ms 53552 KB Output is correct
6 Correct 927 ms 53484 KB Output is correct
7 Correct 485 ms 53164 KB Output is correct
8 Correct 421 ms 53356 KB Output is correct
9 Correct 497 ms 53608 KB Output is correct
10 Correct 472 ms 53596 KB Output is correct
11 Correct 649 ms 53652 KB Output is correct
12 Correct 686 ms 53508 KB Output is correct
13 Correct 813 ms 53604 KB Output is correct
14 Correct 808 ms 53424 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 315 ms 27340 KB Output is correct
2 Correct 559 ms 27308 KB Output is correct
3 Correct 659 ms 27628 KB Output is correct
4 Correct 975 ms 53596 KB Output is correct
5 Correct 839 ms 53472 KB Output is correct
6 Correct 1025 ms 53448 KB Output is correct
7 Correct 493 ms 53476 KB Output is correct
8 Correct 411 ms 53444 KB Output is correct
9 Correct 563 ms 53196 KB Output is correct
10 Correct 651 ms 53484 KB Output is correct
11 Correct 978 ms 53504 KB Output is correct
12 Correct 864 ms 53424 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 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 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 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 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 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 1 ms 332 KB Output is correct
26 Correct 0 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 972 KB Output is correct
42 Correct 10 ms 1420 KB Output is correct
43 Correct 7 ms 844 KB Output is correct
44 Correct 9 ms 1100 KB Output is correct
45 Correct 9 ms 1136 KB Output is correct
46 Correct 11 ms 1484 KB Output is correct
47 Correct 12 ms 1460 KB Output is correct
48 Correct 13 ms 1464 KB Output is correct
49 Correct 11 ms 1460 KB Output is correct
50 Correct 11 ms 1484 KB Output is correct
51 Correct 10 ms 1484 KB Output is correct
52 Correct 10 ms 1484 KB Output is correct
53 Correct 9 ms 1532 KB Output is correct
54 Correct 9 ms 1484 KB Output is correct
55 Correct 12 ms 1484 KB Output is correct
56 Correct 11 ms 1484 KB Output is correct
57 Correct 11 ms 1484 KB Output is correct
58 Correct 9 ms 1484 KB Output is correct
59 Correct 9 ms 1484 KB Output is correct
60 Correct 9 ms 1492 KB Output is correct
61 Correct 10 ms 1476 KB Output is correct
62 Correct 303 ms 27224 KB Output is correct
63 Correct 365 ms 27244 KB Output is correct
64 Correct 560 ms 27316 KB Output is correct
65 Correct 939 ms 50076 KB Output is correct
66 Correct 737 ms 53552 KB Output is correct
67 Correct 927 ms 53484 KB Output is correct
68 Correct 485 ms 53164 KB Output is correct
69 Correct 421 ms 53356 KB Output is correct
70 Correct 497 ms 53608 KB Output is correct
71 Correct 472 ms 53596 KB Output is correct
72 Correct 649 ms 53652 KB Output is correct
73 Correct 686 ms 53508 KB Output is correct
74 Correct 813 ms 53604 KB Output is correct
75 Correct 808 ms 53424 KB Output is correct
76 Correct 315 ms 27340 KB Output is correct
77 Correct 559 ms 27308 KB Output is correct
78 Correct 659 ms 27628 KB Output is correct
79 Correct 975 ms 53596 KB Output is correct
80 Correct 839 ms 53472 KB Output is correct
81 Correct 1025 ms 53448 KB Output is correct
82 Correct 493 ms 53476 KB Output is correct
83 Correct 411 ms 53444 KB Output is correct
84 Correct 563 ms 53196 KB Output is correct
85 Correct 651 ms 53484 KB Output is correct
86 Correct 978 ms 53504 KB Output is correct
87 Correct 864 ms 53424 KB Output is correct
88 Correct 627 ms 27412 KB Output is correct
89 Correct 1101 ms 52588 KB Output is correct
90 Correct 858 ms 31624 KB Output is correct
91 Correct 1042 ms 53504 KB Output is correct
92 Correct 495 ms 27360 KB Output is correct
93 Correct 727 ms 27868 KB Output is correct
94 Correct 916 ms 46592 KB Output is correct
95 Correct 850 ms 53700 KB Output is correct
96 Correct 922 ms 53432 KB Output is correct
97 Correct 977 ms 53596 KB Output is correct
98 Correct 977 ms 53524 KB Output is correct
99 Correct 1000 ms 53560 KB Output is correct
100 Correct 979 ms 53452 KB Output is correct
101 Correct 515 ms 53492 KB Output is correct
102 Correct 523 ms 53544 KB Output is correct
103 Correct 564 ms 53520 KB Output is correct
104 Correct 619 ms 53484 KB Output is correct
105 Correct 744 ms 53520 KB Output is correct
106 Correct 661 ms 53684 KB Output is correct
107 Correct 746 ms 53524 KB Output is correct
108 Correct 1032 ms 53552 KB Output is correct
109 Correct 717 ms 53520 KB Output is correct
110 Correct 988 ms 53512 KB Output is correct
111 Correct 989 ms 53504 KB Output is correct
112 Correct 687 ms 53484 KB Output is correct
113 Correct 915 ms 53544 KB Output is correct
114 Correct 972 ms 53496 KB Output is correct
115 Correct 554 ms 53432 KB Output is correct
116 Correct 561 ms 53436 KB Output is correct
117 Correct 637 ms 53600 KB Output is correct
118 Correct 625 ms 53576 KB Output is correct
119 Correct 586 ms 53452 KB Output is correct
120 Correct 597 ms 53500 KB Output is correct