oj.uz

Submission #832187

# Submission time Handle Problem Language Result Execution time Memory
832187 2023-08-21T06:01:28 Z skittles1412 Wiring (IOI17_wiring) C++17
100 / 100
 67 ms 17932 KB 
#include "bits/extc++.h"

using namespace std;

template <typename T, typename... U>
void dbgh(const T& t, const U&... u) {
    cerr << t;
    ((cerr << " | " << u), ...);
    cerr << endl;
}

#ifdef DEBUG
#define dbg(...)                                              \
    cerr << "L" << __LINE__ << " [" << #__VA_ARGS__ << "]: "; \
    dbgh(__VA_ARGS__)
#else
#define dbg(...)
#define cerr   \
    if (false) \
    cerr
#endif

using ll = long long;

#define endl "\n"
#define long int64_t
#define sz(x) int(std::size(x))

struct PSA {
    vector<long> psum;

    PSA(const vector<int>& arr) : psum(sz(arr) + 1) {
        for (int i = 0; i < sz(arr); i++) {
            psum[i + 1] = psum[i] + arr[i];
        }
    }

    long query(int l, int r) const {
        return psum[r] - psum[l];
    }
};

ll min_total_length(vector<int> arr_r, vector<int> arr_b) {
    vector<pair<int, bool>> arr;
    for (auto& a : arr_r) {
        arr.emplace_back(a, false);
    }
    for (auto& a : arr_b) {
        arr.emplace_back(a, true);
    }

    sort(begin(arr), end(arr));

    int n = sz(arr);

    long dp[n + 1];
    memset(dp, 0x3f, sizeof(dp));
    dp[n] = 0;

    deque<int> inds[2];

    int psum_c[n + 1] {};
    for (int i = 0; i < n; i++) {
        psum_c[i + 1] = psum_c[i];
        if (arr[i].second) {
            psum_c[i + 1]++;
        } else {
            psum_c[i + 1]--;
        }
    }

    int p_occ[n + 1][2];
    p_occ[0][0] = p_occ[0][1] = -1;
    for (int i = 0; i < n; i++) {
        memcpy(p_occ[i + 1], p_occ[i], sizeof(p_occ[i]));
        p_occ[i + 1][arr[i].second] = i;
    }

    PSA psa_w(({
        vector<int> v;
        for (auto& [t, ty] : arr) {
            if (ty) {
                v.push_back(t);
            } else {
                v.push_back(-t);
            }
        }
        v;
    }));

    map<int, int> last_p;

    long dp2[n];
    auto upd_dp2 = [&](int j) -> void {
        // for (; j < n; j++) {
        //     dp[i] = min(dp[i], wsum + min(dp[j], dp[j + 1]));

        //     if (j + 1 < n) {
        //         if (arr[j + 1].second != arr[j].second) {
        //             break;
        //         }
        //         wsum += arr[j + 1].first - last_m;
        //     }
        // }

        dp2[j] = min(dp[j], dp[j + 1]);
        if (j + 1 < n) {
            if (arr[j + 1].second != arr[j].second) {
                return;
            }
            dp2[j] = min(dp2[j], arr[j + 1].first -
                                     arr[p_occ[j][!arr[j].second]].first +
                                     dp2[j + 1]);
        }
    };

    for (int i = n - 1; i >= 0; i--) {
        last_p[psum_c[i + 1]] = i;
        if (i + 1 < n) {
            inds[arr[i + 1].second].push_front(i + 1);
            upd_dp2(i + 1);
        }
        auto [t, ty] = arr[i];

        auto &me = inds[ty], &other = inds[!ty];

        auto get_w = [&](int u, int v) -> long {
            return abs(arr[u].first - arr[v].first);
        };
        auto get = [&](const deque<int>& arr, int ind) -> int {
            if (ind >= sz(arr)) {
                return n;
            }
            return arr[ind];
        };

        if (!sz(other)) {
            continue;
        }

        if (get(other, 0) < get(me, 0)) {
            long csum = 0;

            for (int j = 0; j < sz(other) && get(other, j) < get(me, 0); j++) {
                csum += get_w(i, other[j]);
                dp[i] = min(dp[i], csum + min(dp[other[j]], dp[other[j] + 1]));
            }
        } else {
            dp[i] = dp[i + 1] + get_w(i, other[0]);

            {
                int j, cnt = 0;

                {
                    auto it = last_p.find(psum_c[i]);
                    if (it == last_p.end()) {
                        cnt = 1;
                        assert(cnt);
                    } else {
                        j = it->second;
                    }
                }

                if (!cnt) {
                    dp[i] = min(dp[i], abs(psa_w.query(i, j + 1)) + dp2[j]);
                    // for (; j < n; j++) {
                    //     dp[i] = min(dp[i], wsum + min(dp[j], dp[j + 1]));

                    //     if (j + 1 < n) {
                    //         if (arr[j + 1].second != arr[j].second) {
                    //             break;
                    //         }
                    //         wsum += arr[j + 1].first - last_m;
                    //     }
                    // }
                }
            }

            // long csum = 0;

            // me.push_front(i);
            // for (int j = 0; j < sz(other) && j < sz(me); j++) {
            //     long xsum = csum;
            //     for (int k = j; k < sz(other); k++) {
            //         xsum += get_w(me[j], other[k]);
            //         dp[i] =
            //             min(dp[i],
            //                 xsum + dp[min(get(other, k + 1), get(me, j +
            //                 1))]);
            //     }
            //     csum += get_w(me[j], other[j]);
            // }
            // me.pop_front();
        }
    }

    return dp[0];
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 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 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 38 ms 13236 KB Output is correct
4 Correct 38 ms 14616 KB Output is correct
5 Correct 42 ms 14608 KB Output is correct
6 Correct 54 ms 17876 KB Output is correct
7 Correct 49 ms 17808 KB Output is correct
8 Correct 50 ms 17932 KB Output is correct
9 Correct 51 ms 17932 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 48 ms 11280 KB Output is correct
4 Correct 48 ms 11292 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 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 48 ms 11216 KB Output is correct
19 Correct 48 ms 11224 KB Output is correct
20 Correct 46 ms 11288 KB Output is correct
21 Correct 46 ms 11280 KB Output is correct
22 Correct 52 ms 11244 KB Output is correct
23 Correct 47 ms 11236 KB Output is correct
24 Correct 46 ms 11236 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 54 ms 12840 KB Output is correct
3 Correct 46 ms 12608 KB Output is correct
4 Correct 55 ms 13004 KB Output is correct
5 Correct 46 ms 12496 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 300 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 308 KB Output is correct
15 Correct 0 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 54 ms 14436 KB Output is correct
19 Correct 49 ms 12620 KB Output is correct
20 Correct 55 ms 12968 KB Output is correct
21 Correct 52 ms 13684 KB Output is correct
22 Correct 55 ms 16348 KB Output is correct
23 Correct 52 ms 16652 KB Output is correct
24 Correct 53 ms 15888 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 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 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 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 1 ms 212 KB Output is correct
19 Correct 38 ms 13236 KB Output is correct
20 Correct 38 ms 14616 KB Output is correct
21 Correct 42 ms 14608 KB Output is correct
22 Correct 54 ms 17876 KB Output is correct
23 Correct 49 ms 17808 KB Output is correct
24 Correct 50 ms 17932 KB Output is correct
25 Correct 51 ms 17932 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 48 ms 11280 KB Output is correct
29 Correct 48 ms 11292 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 48 ms 11216 KB Output is correct
44 Correct 48 ms 11224 KB Output is correct
45 Correct 46 ms 11288 KB Output is correct
46 Correct 46 ms 11280 KB Output is correct
47 Correct 52 ms 11244 KB Output is correct
48 Correct 47 ms 11236 KB Output is correct
49 Correct 46 ms 11236 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 54 ms 12840 KB Output is correct
52 Correct 46 ms 12608 KB Output is correct
53 Correct 55 ms 13004 KB Output is correct
54 Correct 46 ms 12496 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 0 ms 300 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 300 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 308 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 54 ms 14436 KB Output is correct
68 Correct 49 ms 12620 KB Output is correct
69 Correct 55 ms 12968 KB Output is correct
70 Correct 52 ms 13684 KB Output is correct
71 Correct 55 ms 16348 KB Output is correct
72 Correct 52 ms 16652 KB Output is correct
73 Correct 53 ms 15888 KB Output is correct
74 Correct 53 ms 17312 KB Output is correct
75 Correct 66 ms 16440 KB Output is correct
76 Correct 61 ms 16432 KB Output is correct
77 Correct 57 ms 15540 KB Output is correct
78 Correct 55 ms 15896 KB Output is correct
79 Correct 58 ms 15760 KB Output is correct
80 Correct 53 ms 16256 KB Output is correct
81 Correct 56 ms 16892 KB Output is correct
82 Correct 53 ms 17016 KB Output is correct
83 Correct 52 ms 16704 KB Output is correct
84 Correct 50 ms 17632 KB Output is correct
85 Correct 60 ms 16744 KB Output is correct
86 Correct 53 ms 16516 KB Output is correct
87 Correct 53 ms 16560 KB Output is correct
88 Correct 56 ms 16120 KB Output is correct
89 Correct 54 ms 16132 KB Output is correct
90 Correct 67 ms 15992 KB Output is correct
91 Correct 56 ms 17308 KB Output is correct
92 Correct 63 ms 16472 KB Output is correct
93 Correct 53 ms 16540 KB Output is correct
94 Correct 56 ms 16872 KB Output is correct
95 Correct 56 ms 15760 KB Output is correct
96 Correct 55 ms 16908 KB Output is correct
97 Correct 54 ms 17680 KB Output is correct
98 Correct 55 ms 17292 KB Output is correct
99 Correct 56 ms 17388 KB Output is correct
100 Correct 57 ms 16424 KB Output is correct
101 Correct 54 ms 17148 KB Output is correct
102 Correct 59 ms 16520 KB Output is correct