oj.uz

Submission #832170

# Submission time Handle Problem Language Result Execution time Memory
832170 2023-08-21T05:34:34 Z skittles1412 Wiring (IOI17_wiring) C++17
7 / 100
 1000 ms 7032 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))

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];

    for (int i = n - 1; i >= 0; i--) {
        if (i + 1 < n) {
            inds[arr[i + 1].second].push_front(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]);

            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 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 1 ms 212 KB Output is correct
7 Correct 12 ms 312 KB Output is correct
8 Correct 12 ms 212 KB Output is correct
9 Correct 16 ms 212 KB Output is correct
10 Correct 14 ms 316 KB Output is correct
11 Correct 21 ms 212 KB Output is correct
12 Correct 12 ms 212 KB Output is correct
13 Correct 18 ms 296 KB Output is correct
14 Correct 12 ms 304 KB Output is correct
15 Correct 13 ms 212 KB Output is correct
16 Correct 20 ms 312 KB Output is correct

Subtask #2
0 / 13.0

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

Subtask #3
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 Execution timed out 1060 ms 7032 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

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

Subtask #5
0 / 45.0

# Verdict Execution time Memory 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 1 ms 212 KB Output is correct
7 Correct 12 ms 312 KB Output is correct
8 Correct 12 ms 212 KB Output is correct
9 Correct 16 ms 212 KB Output is correct
10 Correct 14 ms 316 KB Output is correct
11 Correct 21 ms 212 KB Output is correct
12 Correct 12 ms 212 KB Output is correct
13 Correct 18 ms 296 KB Output is correct
14 Correct 12 ms 304 KB Output is correct
15 Correct 13 ms 212 KB Output is correct
16 Correct 20 ms 312 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 3 ms 212 KB Output is correct
19 Execution timed out 1075 ms 3948 KB Time limit exceeded
20 Halted 0 ms 0 KB -