oj.uz

답안 #705015

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705015 2023-03-03T08:04:16 Z Cyanmond Financial Report (JOI21_financial) C++17
100 / 100
 606 ms 46996 KB 
#include <bits/stdc++.h>

constexpr int inf = 1 << 30;

class SegTree {
    int n, size;
    std::vector<int> data;
    void update(int i) {
        data[i] = std::max(data[2 * i], data[2 * i + 1]);
    }

    public:
    SegTree(int n_) : n(n_) {
        size = 1;
        while (size < n) size *= 2;
        data.assign(2 * size, -inf);
    }

    void set(int i, int v) {
        i += size;
        data[i] = v;
        while (i != 1) {
            i /= 2;
            update(i);
        }
    }

    int fold(int l, int r) {
        int res = -inf;
        for (l += size, r += size; l < r; l >>= 1, r >>= 1) {
            if (l & 1) res = std::max(res, data[l++]);
            if (r & 1) res = std::max(res, data[--r]);
        }
        return res;
    }

    int get(int i) {
        return data[i + size];
    }
};

int solve(int D, std::vector<int> A) {
    const int N = (int)A.size();
    {
        // press
        auto B = A;
        std::sort(B.begin(), B.end());
        B.erase(std::unique(B.begin(), B.end()), B.end());
        for (auto &e : A) e = (int)(std::lower_bound(B.begin(), B.end(), e) - B.begin()) + 1;
    }

    std::vector<std::vector<int>> posList(N + 1);
    for (int i = 0; i < N; ++i) {
        posList[A[i]].push_back(i);
    }
    std::vector<int> keepLimit(N, N);
    std::set<int> sids;
    for (int i = D; i < N; ++i) sids.insert(i);
    for (int v = 1; v <= N; ++v) {
        for (const int i : posList[v]) {
            // [i + 1, i + D]
            auto itr = sids.upper_bound(i);
            while (itr != sids.end() and *itr <= i + D) {
                itr = sids.erase(itr);
            }
        }
        for (const int i : posList[v]) {
            auto itr = sids.upper_bound(i);
            if (itr != sids.end()) {
                keepLimit[i] = *itr;
            }
        }
    }

    SegTree seg(N + 1);
    seg.set(0, 0);
    std::vector<std::vector<int>> eraseList(N + 1);
    for (int i = 0; i < N; ++i) {
        for (const int j : eraseList[i]) {
            seg.set(j, -inf);
        }
        const int f = seg.fold(0, A[i]);
        seg.set(A[i], std::max(seg.get(A[i]), f + 1));
        eraseList[keepLimit[i]].push_back(A[i]);
    }
    return seg.fold(0, N + 1);
}

int solveNaive(int D, std::vector<int> A) {
    const int N = (int)A.size();
    int answer = 1;
    for (int bits = 0; bits < (1 << N); ++bits) {
        int last = -1;
        if (not(bits & (1 << (N - 1)))) {
            continue;
        }
        int res = 0, ma = -1;
        for (int i = 0; i < N; ++i) {
            if (bits & (1 << i)) {
                if (last == -1) {
                    last = i;
                } else {
                    if (i - last > D) {
                        res = -1;
                        break;
                    }
                }
                last = i;
                if (A[i] > ma) {
                    ++res;
                    ma = A[i];
                }
            }
        }
        answer = std::max(answer, res);
    }
    return answer;
}

int main() {
    int N, D;
    std::cin >> N >> D;
    std::vector<int> A(N);
    for (auto &e : A) {
        std::cin >> e;
    }
    std::cout << solve(D, A) << std::endl;
    /*
    int N = 15;
    int cas = 100;
    std::mt19937 mt(100);
    std::uniform_int_distribution dist(1, N);
    while (cas--) {
        std::vector<int> A(N);
        for (auto &e : A) e = dist(mt);
        int D = dist(mt);
        const int a = solveNaive(D, A), b = solve(D, A);
        if (a != b) {
            std::cout << D << std::endl;
            for (const auto e : A) std::cout << e << ' ';
            std::cout << std::endl;
        }
    }*/
}

Subtask #1
14.0 / 14.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 356 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 8 ms 1080 KB Output is correct
42 Correct 8 ms 1148 KB Output is correct
43 Correct 5 ms 852 KB Output is correct
44 Correct 6 ms 852 KB Output is correct
45 Correct 6 ms 912 KB Output is correct
46 Correct 5 ms 980 KB Output is correct
47 Correct 7 ms 1108 KB Output is correct
48 Correct 8 ms 1052 KB Output is correct
49 Correct 7 ms 1108 KB Output is correct
50 Correct 7 ms 1044 KB Output is correct
51 Correct 7 ms 1108 KB Output is correct
52 Correct 8 ms 980 KB Output is correct
53 Correct 6 ms 1108 KB Output is correct
54 Correct 7 ms 980 KB Output is correct
55 Correct 6 ms 980 KB Output is correct
56 Correct 7 ms 1064 KB Output is correct
57 Correct 6 ms 1108 KB Output is correct
58 Correct 4 ms 980 KB Output is correct
59 Correct 4 ms 980 KB Output is correct
60 Correct 6 ms 980 KB Output is correct
61 Correct 6 ms 1056 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 229 ms 26396 KB Output is correct
2 Correct 320 ms 27704 KB Output is correct
3 Correct 430 ms 31496 KB Output is correct
4 Correct 594 ms 46996 KB Output is correct
5 Correct 466 ms 44296 KB Output is correct
6 Correct 606 ms 44292 KB Output is correct
7 Correct 305 ms 43320 KB Output is correct
8 Correct 281 ms 38284 KB Output is correct
9 Correct 316 ms 40992 KB Output is correct
10 Correct 311 ms 38416 KB Output is correct
11 Correct 464 ms 39060 KB Output is correct
12 Correct 476 ms 39192 KB Output is correct
13 Correct 447 ms 44372 KB Output is correct
14 Correct 557 ms 44288 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 26424 KB Output is correct
2 Correct 171 ms 26772 KB Output is correct
3 Correct 200 ms 30228 KB Output is correct
4 Correct 290 ms 37496 KB Output is correct
5 Correct 265 ms 37560 KB Output is correct
6 Correct 285 ms 37536 KB Output is correct
7 Correct 204 ms 37572 KB Output is correct
8 Correct 191 ms 37652 KB Output is correct
9 Correct 192 ms 37276 KB Output is correct
10 Correct 249 ms 37372 KB Output is correct
11 Correct 308 ms 37480 KB Output is correct
12 Correct 240 ms 37408 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 356 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 8 ms 1080 KB Output is correct
42 Correct 8 ms 1148 KB Output is correct
43 Correct 5 ms 852 KB Output is correct
44 Correct 6 ms 852 KB Output is correct
45 Correct 6 ms 912 KB Output is correct
46 Correct 5 ms 980 KB Output is correct
47 Correct 7 ms 1108 KB Output is correct
48 Correct 8 ms 1052 KB Output is correct
49 Correct 7 ms 1108 KB Output is correct
50 Correct 7 ms 1044 KB Output is correct
51 Correct 7 ms 1108 KB Output is correct
52 Correct 8 ms 980 KB Output is correct
53 Correct 6 ms 1108 KB Output is correct
54 Correct 7 ms 980 KB Output is correct
55 Correct 6 ms 980 KB Output is correct
56 Correct 7 ms 1064 KB Output is correct
57 Correct 6 ms 1108 KB Output is correct
58 Correct 4 ms 980 KB Output is correct
59 Correct 4 ms 980 KB Output is correct
60 Correct 6 ms 980 KB Output is correct
61 Correct 6 ms 1056 KB Output is correct
62 Correct 229 ms 26396 KB Output is correct
63 Correct 320 ms 27704 KB Output is correct
64 Correct 430 ms 31496 KB Output is correct
65 Correct 594 ms 46996 KB Output is correct
66 Correct 466 ms 44296 KB Output is correct
67 Correct 606 ms 44292 KB Output is correct
68 Correct 305 ms 43320 KB Output is correct
69 Correct 281 ms 38284 KB Output is correct
70 Correct 316 ms 40992 KB Output is correct
71 Correct 311 ms 38416 KB Output is correct
72 Correct 464 ms 39060 KB Output is correct
73 Correct 476 ms 39192 KB Output is correct
74 Correct 447 ms 44372 KB Output is correct
75 Correct 557 ms 44288 KB Output is correct
76 Correct 162 ms 26424 KB Output is correct
77 Correct 171 ms 26772 KB Output is correct
78 Correct 200 ms 30228 KB Output is correct
79 Correct 290 ms 37496 KB Output is correct
80 Correct 265 ms 37560 KB Output is correct
81 Correct 285 ms 37536 KB Output is correct
82 Correct 204 ms 37572 KB Output is correct
83 Correct 191 ms 37652 KB Output is correct
84 Correct 192 ms 37276 KB Output is correct
85 Correct 249 ms 37372 KB Output is correct
86 Correct 308 ms 37480 KB Output is correct
87 Correct 240 ms 37408 KB Output is correct
88 Correct 449 ms 30088 KB Output is correct
89 Correct 538 ms 43936 KB Output is correct
90 Correct 376 ms 30516 KB Output is correct
91 Correct 369 ms 38260 KB Output is correct
92 Correct 228 ms 30144 KB Output is correct
93 Correct 262 ms 29984 KB Output is correct
94 Correct 282 ms 34684 KB Output is correct
95 Correct 488 ms 38560 KB Output is correct
96 Correct 448 ms 37248 KB Output is correct
97 Correct 410 ms 37140 KB Output is correct
98 Correct 372 ms 38248 KB Output is correct
99 Correct 366 ms 38424 KB Output is correct
100 Correct 368 ms 44324 KB Output is correct
101 Correct 311 ms 39008 KB Output is correct
102 Correct 313 ms 37244 KB Output is correct
103 Correct 318 ms 37144 KB Output is correct
104 Correct 345 ms 37156 KB Output is correct
105 Correct 352 ms 36468 KB Output is correct
106 Correct 329 ms 38292 KB Output is correct
107 Correct 339 ms 38364 KB Output is correct
108 Correct 354 ms 38048 KB Output is correct
109 Correct 401 ms 43724 KB Output is correct
110 Correct 387 ms 44188 KB Output is correct
111 Correct 369 ms 44184 KB Output is correct
112 Correct 305 ms 36940 KB Output is correct
113 Correct 341 ms 44068 KB Output is correct
114 Correct 354 ms 38180 KB Output is correct
115 Correct 194 ms 37412 KB Output is correct
116 Correct 191 ms 37524 KB Output is correct
117 Correct 251 ms 37512 KB Output is correct
118 Correct 248 ms 37540 KB Output is correct
119 Correct 403 ms 37448 KB Output is correct
120 Correct 303 ms 37372 KB Output is correct