oj.uz

Submission #832186

# Submission time Handle Problem Language Result Execution time Memory
832186 2023-08-21T06:00:25 Z skittles1412 Wiring (IOI17_wiring) C++17
17 / 100
 1000 ms 12420 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;
                long wsum = 0, last_m;
                for (j = i; j < n; j++) {
                    if (arr[i].second == arr[j].second) {
                        wsum -= arr[j].first;
                        last_m = arr[j].first;
                        cnt++;
                    } else {
                        wsum += arr[j].first;
                        cnt--;
                    }
                    if (!cnt) {
                        break;
                    }
                }

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

                if (!cnt) {
                    assert(wsum == abs(psa_w.query(i, j + 1)));
                    assert(last_m == arr[p_occ[j][ty]].first);

                    dp[i] = min(dp[i], wsum + 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Execution timed out 1083 ms 10980 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.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 359 ms 11612 KB Output is correct
4 Correct 47 ms 11732 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 304 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 296 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 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 340 ms 11740 KB Output is correct
19 Correct 287 ms 11760 KB Output is correct
20 Correct 47 ms 11716 KB Output is correct
21 Correct 271 ms 11788 KB Output is correct
22 Correct 155 ms 11804 KB Output is correct
23 Correct 273 ms 11832 KB Output is correct
24 Correct 235 ms 11776 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1069 ms 12420 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 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 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 300 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Execution timed out 1083 ms 10980 KB Time limit exceeded
20 Halted 0 ms 0 KB -