Submission #420262

#	Time	Username	Problem	Language	Result	Execution time	Memory
420262		temurbek_khujaev	Wiring (IOI17_wiring)	C++17	0 / 100	1 ms	292 KiB

wiring

#include <bits/stdc++.h>
#include "wiring.h"

using namespace std;
#define N 402
long long dp[N];
const long long INF = 1e18;

long long min_total_length(std::vector<int> r, std::vector<int> b) {
    vector<pair<int, int >> v;
    for (auto x:r) v.emplace_back(x, 0);
    for (auto x:b) v.emplace_back(x, 1);
    v.emplace_back(-1, -2);
    sort(v.begin(), v.end());

    dp[0] = 0;
    for (int i = 1; i < (int) v.size(); i++) {
        dp[i] = INF;
        long long cnt[] = {0, 0};
        long long sum[] = {0ll, 0ll};
        for (int j = i; j > 0; j--) {
            sum[v[j].second] += v[j].first;
            cnt[v[j].second]++;
            if (v[i].second != v[j].second) {
                dp[i] = min(dp[i], dp[i - 1] + v[i].first - v[j].first);
            }

            if (min(cnt[0], cnt[1]) == 1 && v[i].second != v[j].second) {
                long long cost = 0ll;
                if (cnt[v[i].second] == 1) {
                    cost = v[i].first * cnt[v[j].second] - sum[v[j].second];
                } else {
                    cost = sum[v[i].second] - cnt[v[i].second] * v[j].first;
                }
//                cerr << i << ' ' << j << ' ' << cost << endl;
                dp[i] = min(dp[i], dp[j - 1] + cost);
            }
            if (cnt[0] == cnt[1]) {
                long long cost = 0;
                vector<int> st[2];
                for (int k = j; k <= i; k++) {
                    st[v[k].second].push_back(v[k].first);
                    if (!st[0].empty() && !st[1].empty()) {
                        cost += abs(st[1].back() - st[0].back());
                        st[0].pop_back();
                        st[1].pop_back();
                    }
                }
                dp[i] = min(dp[i], dp[j - 1] + cost);
            }
        }
//        cout << dp[i] << ' ';
    }
    return dp[v.size() - 1];
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 13
• Subtask 3: 0 / 10
• Subtask 4: 0 / 25
• Subtask 5: 0 / 45