Submission #1194463

#	Time	Username	Problem	Language	Result	Execution time	Memory
1194463		mannshah1211	Wiring (IOI17_wiring)	C++20	0 / 100	1097 ms	6904 KiB

wiring

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

using namespace std;

const long long inf = (long long) 1e18;

using Int = long long;

long long min_total_length(vector<int> r, vector<int> b) {
  int n = r.size(), m = b.size();
	vector<pair<long long, int>> all;
  all.emplace_back(-1, 0);
  for (int i = 0; i < n; i++) {
    all.emplace_back(r[i], 0);
  }
  for (int i = 0; i < m; i++) {
    all.emplace_back(b[i], 1);
  }
  sort(all.begin(), all.end());
  vector<long long> dp(all.size() + 1, inf);
  auto Cost = [&](vector<long long> big, vector<long long> small) {
    // big is the one that comes later; small is the one that comes earlier
    if (big.size() == small.size()) {
      return accumulate(big.begin(), big.end(), Int(0)) - accumulate(small.begin(), small.end(), Int(0));
    } else if (big.size() > small.size()) {
      return accumulate(big.begin(), big.end(), Int(0)) - accumulate(small.begin(), small.end(), Int(0)) - (Int(big.size() - small.size()) * (Int(small[0])));
    } else {
      return accumulate(big.begin(), big.end(), Int(0)) - accumulate(small.begin(), small.end(), Int(0)) + (Int(small.size() - big.size()) * (Int(big[0])));
    }
  };
  vector<long long> cur;
  int color = all[1].second;
  dp[0] = 0;
  for (int i = 1; i <= n + m; i++) {
    if (color == all[i].second) {
      cur.push_back(all[i].first);
    } else {
      cur.clear();
      cur.push_back(all[i].first);
      color = all[i].second;
    }
    bool found_opp = false;
    vector<long long> opp;
    for (int j = i - 1; j >= 1; j--) {
      if (all[j].second != all[i].second) {
        found_opp = true;
        opp.push_back(all[j].first);
        dp[i] = min(dp[i], dp[j - 1] + Cost(cur, opp));
      } else if (all[j].second == all[i].second) {
        if (found_opp) {
          break;
        }
      }
    }
  }
  return dp[n + m];
}

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