oj.uz

답안 #650060

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
650060 2022-10-12T07:59:10 Z Alexandruabcde Financial Report (JOI21_financial) C++14
100 / 100
 641 ms 46648 KB 
#include <bits/stdc++.h>

using namespace std;

constexpr int NMAX = 3e5 + 5;
constexpr int INF = 1e6;

class SegmentTree {
private:
    vector <int> arb;
    int Sz;

    void Update (int nod, int a, int b, int pos, int val) {
        if (a == b) {
            arb[nod] = val;
            return;
        }

        int mij = (a + b) / 2;

        if (pos <= mij) Update(2*nod, a, mij, pos, val);
        else Update(2*nod+1, mij+1, b, pos, val);

        arb[nod] = max(arb[2*nod], arb[2*nod+1]);
    }

    int Query (int nod, int a, int b, int qa, int qb) {
        if (qa <= a && b <= qb) return arb[nod];

        int mij = (a + b) / 2;

        int ans_st = -1, ans_dr = -1;

        if (qa <= mij) ans_st = Query(2*nod, a, mij, qa, qb);
        if (mij < qb) ans_dr = Query(2*nod+1, mij+1, b, qa, qb);

        return max(ans_st, ans_dr);
    }

public:
    void Init (int N) {
        Sz = N;
        arb.resize(4 * N + 5);

        for (int i = 0; i < arb.size(); ++ i )
            arb[i] = -1;
    }

    void AddValue (int pos, int val) {
        Update(1, 1, Sz, pos, val);
    }

    int Ask (int st, int dr) {
        return Query(1, 1, Sz, st, dr);
    }
};

class DSU {
private:
    int Dad[NMAX];
    int Sz[NMAX];
    int Min[NMAX];
    int N;

    int Reprezentant (int Node) {
        if (Dad[Node] == Node) return Node;

        Dad[Node] = Reprezentant(Dad[Node]);
        return Dad[Node];
    }

public:
    void Init (int n) {
        N = n;

        for (int i = 1; i <= N; ++ i ) {
            Sz[i] = 1;
            Dad[i] = i;
            Min[i] = i;
        }
    }

    void Unite (int x, int y) {
        x = Reprezentant(x);
        y = Reprezentant(y);

        if (x == y) return;

        if (Sz[x] <= Sz[y]) {
            Dad[x] = y;
            Sz[y] += Sz[x];

            Min[y] = min(Min[y], Min[x]);
        }
        else {
            Dad[y] = x;
            Sz[x] += Sz[y];

            Min[x] = min(Min[x], Min[y]);
        }
    }

    int Ask (int Node) {
        return Min[Reprezentant(Node)];
    }
};

DSU Pad;
SegmentTree Sgt;

int N, D;
int A[NMAX];

int WhatBucket (int pos) {
    return (pos + D - 1) / D;
}

int Max[NMAX];
int Min[NMAX];
int dp[NMAX];

void Read () {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> D;

    for (int i = 1; i <= N; ++ i )
        cin >> A[i];
}

map <int, int> mp;
int cnt = 0;

void Normalize () {
    for (int i = 1; i <= N; ++ i )
        mp[A[i]] = 1;

    for (auto &it : mp)
        it.second = ++cnt;

    for (int i = 1; i <= N; ++ i )
        A[i] = mp[A[i]];
}

vector <int> V[NMAX];

void Precompute () {
    Normalize();
    for (int i = 0; i <= N+1; ++ i ) {
        Min[WhatBucket(i)] = INF;
        Max[WhatBucket(i)] = -INF;
        dp[i] = -1;
    }

    for (int i = 1; i <= N; ++ i )
        V[A[i]].push_back(i);
}

void Solve () {
    Sgt.Init(N);
    Pad.Init(N);

    for (int i = 1; i <= N; ++ i ) {
        for (auto pos : V[i]) {
            dp[pos] = 1;
            int who_Buck = WhatBucket(pos);

            if (who_Buck > 1 && min(pos, Min[who_Buck]) <= Max[who_Buck-1] + D)
                -- who_Buck;

            int best = Pad.Ask(who_Buck);

            if (Min[best] <= pos) dp[pos] = Sgt.Ask(min(pos, Min[best]), pos) + 1;
        }

        for (auto pos : V[i]) {
            Min[WhatBucket(pos)] = min(Min[WhatBucket(pos)], pos);
            Max[WhatBucket(pos)] = max(Max[WhatBucket(pos)], pos);

            int buck = WhatBucket(pos);
            if (buck > 1 && Min[buck] <= Max[buck-1] + D)
                Pad.Unite(buck-1, buck);

            if (buck < WhatBucket(N) && Max[buck] + D >= Min[buck+1])
                Pad.Unite(buck, buck+1);

            Sgt.AddValue(pos, dp[pos]);
        }
    }

    cout << Sgt.Ask(1, N) << '\n';
}

int main () {
    Read();
    Precompute();


    Solve();

    return 0;
}

Compilation message

Main.cpp: In member function 'void SegmentTree::Init(int)':
Main.cpp:45:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int i = 0; i < arb.size(); ++ i )
      |                         ~~^~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7380 KB Output is correct
2 Correct 4 ms 7384 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 6 ms 7380 KB Output is correct
8 Correct 5 ms 7384 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 5 ms 7312 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 5 ms 7380 KB Output is correct
15 Correct 6 ms 7480 KB Output is correct
16 Correct 5 ms 7388 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 4 ms 7380 KB Output is correct
20 Correct 5 ms 7388 KB Output is correct
21 Correct 4 ms 7380 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 4 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 4 ms 7368 KB Output is correct
26 Correct 4 ms 7388 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7380 KB Output is correct
2 Correct 4 ms 7384 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 6 ms 7380 KB Output is correct
8 Correct 5 ms 7384 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 5 ms 7312 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 5 ms 7380 KB Output is correct
15 Correct 6 ms 7480 KB Output is correct
16 Correct 5 ms 7388 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 4 ms 7380 KB Output is correct
20 Correct 5 ms 7388 KB Output is correct
21 Correct 4 ms 7380 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 4 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 4 ms 7368 KB Output is correct
26 Correct 4 ms 7388 KB Output is correct
27 Correct 5 ms 7380 KB Output is correct
28 Correct 5 ms 7384 KB Output is correct
29 Correct 5 ms 7380 KB Output is correct
30 Correct 5 ms 7388 KB Output is correct
31 Correct 5 ms 7388 KB Output is correct
32 Correct 5 ms 7388 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 5 ms 7380 KB Output is correct
35 Correct 5 ms 7384 KB Output is correct
36 Correct 5 ms 7380 KB Output is correct
37 Correct 5 ms 7380 KB Output is correct
38 Correct 4 ms 7384 KB Output is correct
39 Correct 5 ms 7380 KB Output is correct
40 Correct 5 ms 7380 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7380 KB Output is correct
2 Correct 4 ms 7384 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 6 ms 7380 KB Output is correct
8 Correct 5 ms 7384 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 5 ms 7312 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 5 ms 7380 KB Output is correct
15 Correct 6 ms 7480 KB Output is correct
16 Correct 5 ms 7388 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 4 ms 7380 KB Output is correct
20 Correct 5 ms 7388 KB Output is correct
21 Correct 4 ms 7380 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 4 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 4 ms 7368 KB Output is correct
26 Correct 4 ms 7388 KB Output is correct
27 Correct 5 ms 7380 KB Output is correct
28 Correct 5 ms 7384 KB Output is correct
29 Correct 5 ms 7380 KB Output is correct
30 Correct 5 ms 7388 KB Output is correct
31 Correct 5 ms 7388 KB Output is correct
32 Correct 5 ms 7388 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 5 ms 7380 KB Output is correct
35 Correct 5 ms 7384 KB Output is correct
36 Correct 5 ms 7380 KB Output is correct
37 Correct 5 ms 7380 KB Output is correct
38 Correct 4 ms 7384 KB Output is correct
39 Correct 5 ms 7380 KB Output is correct
40 Correct 5 ms 7380 KB Output is correct
41 Correct 9 ms 7892 KB Output is correct
42 Correct 10 ms 8148 KB Output is correct
43 Correct 7 ms 7656 KB Output is correct
44 Correct 9 ms 7892 KB Output is correct
45 Correct 10 ms 7892 KB Output is correct
46 Correct 11 ms 8164 KB Output is correct
47 Correct 9 ms 8164 KB Output is correct
48 Correct 11 ms 8148 KB Output is correct
49 Correct 9 ms 8224 KB Output is correct
50 Correct 10 ms 8148 KB Output is correct
51 Correct 10 ms 8224 KB Output is correct
52 Correct 12 ms 8276 KB Output is correct
53 Correct 10 ms 8148 KB Output is correct
54 Correct 9 ms 8148 KB Output is correct
55 Correct 13 ms 8148 KB Output is correct
56 Correct 12 ms 8224 KB Output is correct
57 Correct 11 ms 8148 KB Output is correct
58 Correct 8 ms 8276 KB Output is correct
59 Correct 8 ms 8148 KB Output is correct
60 Correct 8 ms 8208 KB Output is correct
61 Correct 8 ms 8164 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 21692 KB Output is correct
2 Correct 111 ms 22036 KB Output is correct
3 Correct 192 ms 22428 KB Output is correct
4 Correct 611 ms 40416 KB Output is correct
5 Correct 435 ms 43872 KB Output is correct
6 Correct 641 ms 43828 KB Output is correct
7 Correct 202 ms 43560 KB Output is correct
8 Correct 181 ms 46480 KB Output is correct
9 Correct 177 ms 46648 KB Output is correct
10 Correct 163 ms 46536 KB Output is correct
11 Correct 332 ms 46640 KB Output is correct
12 Correct 378 ms 46624 KB Output is correct
13 Correct 434 ms 46644 KB Output is correct
14 Correct 462 ms 46616 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 19260 KB Output is correct
2 Correct 169 ms 19516 KB Output is correct
3 Correct 191 ms 20232 KB Output is correct
4 Correct 548 ms 41556 KB Output is correct
5 Correct 432 ms 41420 KB Output is correct
6 Correct 517 ms 41456 KB Output is correct
7 Correct 204 ms 41432 KB Output is correct
8 Correct 184 ms 41544 KB Output is correct
9 Correct 215 ms 41244 KB Output is correct
10 Correct 389 ms 41428 KB Output is correct
11 Correct 629 ms 41440 KB Output is correct
12 Correct 557 ms 41548 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 7380 KB Output is correct
2 Correct 4 ms 7384 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 6 ms 7380 KB Output is correct
8 Correct 5 ms 7384 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 5 ms 7312 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 5 ms 7380 KB Output is correct
15 Correct 6 ms 7480 KB Output is correct
16 Correct 5 ms 7388 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 5 ms 7380 KB Output is correct
19 Correct 4 ms 7380 KB Output is correct
20 Correct 5 ms 7388 KB Output is correct
21 Correct 4 ms 7380 KB Output is correct
22 Correct 4 ms 7380 KB Output is correct
23 Correct 4 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 4 ms 7368 KB Output is correct
26 Correct 4 ms 7388 KB Output is correct
27 Correct 5 ms 7380 KB Output is correct
28 Correct 5 ms 7384 KB Output is correct
29 Correct 5 ms 7380 KB Output is correct
30 Correct 5 ms 7388 KB Output is correct
31 Correct 5 ms 7388 KB Output is correct
32 Correct 5 ms 7388 KB Output is correct
33 Correct 4 ms 7380 KB Output is correct
34 Correct 5 ms 7380 KB Output is correct
35 Correct 5 ms 7384 KB Output is correct
36 Correct 5 ms 7380 KB Output is correct
37 Correct 5 ms 7380 KB Output is correct
38 Correct 4 ms 7384 KB Output is correct
39 Correct 5 ms 7380 KB Output is correct
40 Correct 5 ms 7380 KB Output is correct
41 Correct 9 ms 7892 KB Output is correct
42 Correct 10 ms 8148 KB Output is correct
43 Correct 7 ms 7656 KB Output is correct
44 Correct 9 ms 7892 KB Output is correct
45 Correct 10 ms 7892 KB Output is correct
46 Correct 11 ms 8164 KB Output is correct
47 Correct 9 ms 8164 KB Output is correct
48 Correct 11 ms 8148 KB Output is correct
49 Correct 9 ms 8224 KB Output is correct
50 Correct 10 ms 8148 KB Output is correct
51 Correct 10 ms 8224 KB Output is correct
52 Correct 12 ms 8276 KB Output is correct
53 Correct 10 ms 8148 KB Output is correct
54 Correct 9 ms 8148 KB Output is correct
55 Correct 13 ms 8148 KB Output is correct
56 Correct 12 ms 8224 KB Output is correct
57 Correct 11 ms 8148 KB Output is correct
58 Correct 8 ms 8276 KB Output is correct
59 Correct 8 ms 8148 KB Output is correct
60 Correct 8 ms 8208 KB Output is correct
61 Correct 8 ms 8164 KB Output is correct
62 Correct 76 ms 21692 KB Output is correct
63 Correct 111 ms 22036 KB Output is correct
64 Correct 192 ms 22428 KB Output is correct
65 Correct 611 ms 40416 KB Output is correct
66 Correct 435 ms 43872 KB Output is correct
67 Correct 641 ms 43828 KB Output is correct
68 Correct 202 ms 43560 KB Output is correct
69 Correct 181 ms 46480 KB Output is correct
70 Correct 177 ms 46648 KB Output is correct
71 Correct 163 ms 46536 KB Output is correct
72 Correct 332 ms 46640 KB Output is correct
73 Correct 378 ms 46624 KB Output is correct
74 Correct 434 ms 46644 KB Output is correct
75 Correct 462 ms 46616 KB Output is correct
76 Correct 82 ms 19260 KB Output is correct
77 Correct 169 ms 19516 KB Output is correct
78 Correct 191 ms 20232 KB Output is correct
79 Correct 548 ms 41556 KB Output is correct
80 Correct 432 ms 41420 KB Output is correct
81 Correct 517 ms 41456 KB Output is correct
82 Correct 204 ms 41432 KB Output is correct
83 Correct 184 ms 41544 KB Output is correct
84 Correct 215 ms 41244 KB Output is correct
85 Correct 389 ms 41428 KB Output is correct
86 Correct 629 ms 41440 KB Output is correct
87 Correct 557 ms 41548 KB Output is correct
88 Correct 278 ms 23884 KB Output is correct
89 Correct 543 ms 44096 KB Output is correct
90 Correct 310 ms 26112 KB Output is correct
91 Correct 529 ms 44268 KB Output is correct
92 Correct 147 ms 22856 KB Output is correct
93 Correct 228 ms 22864 KB Output is correct
94 Correct 503 ms 37228 KB Output is correct
95 Correct 466 ms 45448 KB Output is correct
96 Correct 525 ms 44644 KB Output is correct
97 Correct 576 ms 44352 KB Output is correct
98 Correct 547 ms 44312 KB Output is correct
99 Correct 528 ms 44268 KB Output is correct
100 Correct 545 ms 44248 KB Output is correct
101 Correct 181 ms 45408 KB Output is correct
102 Correct 197 ms 44320 KB Output is correct
103 Correct 253 ms 44268 KB Output is correct
104 Correct 267 ms 44308 KB Output is correct
105 Correct 337 ms 44212 KB Output is correct
106 Correct 271 ms 44324 KB Output is correct
107 Correct 342 ms 44208 KB Output is correct
108 Correct 525 ms 44228 KB Output is correct
109 Correct 326 ms 44300 KB Output is correct
110 Correct 471 ms 44252 KB Output is correct
111 Correct 574 ms 44464 KB Output is correct
112 Correct 286 ms 44244 KB Output is correct
113 Correct 464 ms 44236 KB Output is correct
114 Correct 480 ms 44204 KB Output is correct
115 Correct 205 ms 44268 KB Output is correct
116 Correct 202 ms 44296 KB Output is correct
117 Correct 187 ms 44260 KB Output is correct
118 Correct 187 ms 44316 KB Output is correct
119 Correct 226 ms 44236 KB Output is correct
120 Correct 221 ms 44236 KB Output is correct