結果

問題 No.3583 二部マッチング最適化
コンテスト
ユーザー aPNJ777
提出日時 2026-07-03 23:09:12
言語 C++23
(gcc 15.2.0 + boost 1.89.0)
コンパイル:
g++-15 -O2 -lm -std=c++23 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
TLE  
実行時間 -
コード長 10,945 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 2,510 ms
コンパイル使用メモリ 352,268 KB
実行使用メモリ 68,096 KB
最終ジャッジ日時 2026-07-03 23:09:55
合計ジャッジ時間 33,986 ms
ジャッジサーバーID
（参考情報） 		judge3_0 / judge2_0
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 32 TLE * 2 -- * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;

template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;

#define vv(type, name, h, w) vector<vector<type>> name(h, vector<type>(w))
#define vvv(type, name, h, w, l) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(l)))
#define vvvv(type, name, a, b, c, d) vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(d))))
#define vvvvv(type, name, a, b, c, d, e) vector<vector<vector<vector<vector<type>>>>> name(a, vector<vector<vector<vector<type>>>>(b, vector<vector<vector<type>>>(c, vector<vector<type>>(d, vector<type>(e)))))

#define elif else if

#define FOR1(a) for (long long _ = 0; _ < (long long)(a); _++)
#define FOR2(i, n) for (long long i = 0; i < (long long)(n); i++)
#define FOR3(i, l, r) for (long long i = l; i < (long long)(r); i++)
#define FOR4(i, l, r, c) for (long long i = l; i < (long long)(r); i += c)
#define FOR1_R(a) for (long long _ = (long long)(a) - 1; _ >= 0; _--)
#define FOR2_R(i, n) for (long long i = (long long)(n) - 1; i >= (long long)(0); i--)
#define FOR3_R(i, l, r) for (long long i = (long long)(r) - 1; i >= (long long)(l); i--)
#define FOR4_R(i, l, r, c) for (long long i = (long long)(r) - 1; i >= (long long)(l); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_in(a, A) for (auto a: A)
#define FOR_each(a, A) for (auto &&a: A)
#define FOR_subset(t, s) for(long long t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))

#define all(x) x.begin(), x.end()
#define len(x) int(x.size())

int popcount(int x) { return __builtin_popcount(x); }
int popcount(uint32_t x) { return __builtin_popcount(x); }
int popcount(long long x) { return __builtin_popcountll(x); }
int popcount(uint64_t x) { return __builtin_popcountll(x); }
// __builtin_clz(x)は最上位bitからいくつ0があるか.
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(uint32_t x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(long long x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(uint64_t x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }

// 入力
void rd() {}
void rd(char &c) { cin >> c; }
void rd(string &s) { cin >> s; }
void rd(int &x) { cin >> x; }
void rd(uint32_t &x) { cin >> x; }
void rd(long long &x) { cin >> x; }
void rd(uint64_t &x) { cin >> x; }
template<class T>
void rd(vector<T> &v) {
  for (auto& x:v) rd(x);
}

void read() {}
template <class H, class... T>
void read(H &h, T &... t) {
  rd(h), read(t...);
}

#define CHAR(...) \
  char __VA_ARGS__; \
  read(__VA_ARGS__)

#define STRING(...) \
  string __VA_ARGS__; \
  read(__VA_ARGS__)

#define INT(...) \
  int __VA_ARGS__; \
  read(__VA_ARGS__)

#define U32(...) \
  uint32_t __VA_ARGS__; \
  read(__VA_ARGS__)

#define LL(...) \
  long long __VA_ARGS__; \
  read(__VA_ARGS__)

#define U64(...) \
  uint64_t __VA_ARGS__; \
  read(__VA_ARGS__)

#define VC(t, a, n) \
  vector<t> a(n); \
  read(a)

#define VVC(t, a, h, w) \
  vector<vector<t>> a(h, vector<t>(w)); \
  read(a)

//出力
void wt() {}
void wt(const char c) { cout << c; }
void wt(const string s) { cout << s; }
void wt(int x) { cout << x; }
void wt(uint32_t x) { cout << x; }
void wt(long long x) { cout << x; }
void wt(uint64_t x) { cout << x; }
void wt(double x) { cout << fixed << setprecision(16) << x; }
void wt(long double x) { cout << fixed << setprecision(16) << x; }

template<class T>
void wt(const vector<T> v) {
  int n = v.size();
  for (int i = 0; i < n; i++) {
    if (i) wt(' ');
    wt(v[i]);
  }
}

void print() { wt('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
  wt(head);
  if (sizeof...(Tail)) wt(' ');
  print(forward<Tail>(tail)...);
}

/////////////////////////////////////////////////////////////////////////////////////////
template <class T>
int bisect_left(const vector<T> &A, T x) {
  auto idx = lower_bound(A.begin(), A.end(), x) - A.begin();
  return idx;
}

template <class T>
int bisect_right(const vector<T> &A, T x) {
  auto idx = upper_bound(A.begin(), A.end(), x) - A.begin();
  return idx;
}

long long min(long long a, long long b) { return a < b ? a : b; }

template <class T>
T min(vector<T> A) {
  assert (A.size());
  T S = A[0];
  for (T a : A) S = min(a, S);
  return S;
}

template <class T>
T max(vector<T> A) {
  assert (A.size());
  T S = A[0];
  for (T a : A) S = max(a, S);
  return S;
}

template <class T>
T add(T x, T y) { return x + y; }

template <class T>
bool chmin(T & x, T a) { return a < x ? (x = a, true) : false; }

template <class T>
bool chmax(T & x, T a) { return a > x ? (x = a, true) : false; }

template <class T>
T sum(vector<T> A) {
  T S = 0;
  for (int i = 0; i < int(A.size()); i++) S += A[i];
  return S;
}

uint64_t random_u64(uint64_t l, uint64_t r) {
  static std::random_device rd;
  static std::mt19937_64 gen(rd());
  std::uniform_int_distribution<uint64_t> dist(l, r);
  return dist(gen);
}

long long gcd(long long a, long long b) {
  while (a) {
    b %= a;
    if (b == 0) return a;
    a %= b;
  }
  return b;
}

long long lcm(long long a, long long b) {
  if (a * b == 0) return 0;
  return a * b / gcd(a, b);
}

long long pow_mod(long long a, long long r, long long mod) {
  long long res = 1, p = a % mod;
  while (r) {
    if ((r % 2) == 1) res = res * p % mod;
    p = p * p % mod, r >>= 1;
  }
  return res;
}

long long mod_inv(long long a, long long mod) {
  if (mod == 1) return 0;
  a %= mod;
  long long b = mod, s = 1, t = 0;
  while (1) {
    if (a == 1) return s;
    t -= (b / a) * s;
    b %= a;
    if (b == 1) return t + mod;
    s -= (a / b) * t;
    a %= b;
  }
}

long long Garner(vector<long long> Rem, vector<long long> Mod, int MOD) {
  assert (Rem.size() == Mod.size());
  long long mod = MOD;
  Rem.push_back(0);
  Mod.push_back(mod);
  long long n = Mod.size();
  vector<long long> coffs(n, 1);
  vector<long long> constants(n, 0);
  for (int i = 0; i < n - 1; i++) {
    long long v = (Mod[i] + Rem[i] - constants[i]) % Mod[i];
    v *= mod_inv(coffs[i], Mod[i]);
    v %= Mod[i];
    for (int j = i + 1; j < n; j++) {
      constants[j] = (constants[j] + coffs[j] * v) % Mod[j];
      coffs[j] = (coffs[j] * Mod[i]) % Mod[j];
    }
  }
  return constants[n - 1];
}

long long Tonelli_Shanks(long long a, long long mod) {
  a %= mod;
  if (a < 2) return a;
  if (pow_mod(a, (mod - 1) / 2, mod) != 1) return -1;
  if (mod % 4 == 3) return pow_mod(a, (mod + 1) / 4, mod);

  long long b = 3;
  if (mod != 998244353) {
    while (pow_mod(b, (mod - 1) / 2, mod) == 1) {
      b = random_u64(2, mod - 1);
    }
  }

  long long q = mod - 1;
  long long Q = 0;
  while (q % 2 == 0) {
    Q++, q /= 2;
  }

  long long x = pow_mod(a, (q + 1) / 2, mod);
  b = pow_mod(b, q, mod);

  long long shift = 2;
  while ((x * x) % mod != a) {
    long long error = (((pow_mod(a, mod - 2, mod) * x) % mod) * x) % mod;
    if (pow_mod(error, 1 << (Q - shift), mod) != 1) {
      x = (x * b) % mod;
    }
    b = (b * b) % mod;
    shift++;
  }
  return x;
}

long long floor_div(long long a, long long b) {
  if (b < 0) a *= -1, b *= -1;
  if (a >= 0) return a / b;
  return -((-a + b - 1) / b);
}

long long ceil_div(long long a, long long b) {
    if (b < 0) a *= -1, b *= -1;
    if (a >= 0) return (a + b - 1) / b;
    return - ((-a) / b);
}

/////////////////////////////////////////////////////////////////////////////////////////

/*
検索するとき

https://www.google.com/search?udm=14&q=

-ai
*/

template <typename Cap, typename Cost>
struct MinCostFlow {

  struct edge {
    int to;
    Cap cap;
    Cost cost;
    int rev;
  };

  int V;
  vector<vector<edge>> G;
  static constexpr Cap inf = 1000000000000000000; // 型によっていじらなきゃいけない

  MinCostFlow(int V) : V(V), G(V) {}

  int add_edge(int u, int v, Cap cap, Cost cost) {
    int id = int(G[u].size());
    G[u].push_back({v, cap, cost, int(G[v].size())});
    G[v].push_back({u, 0, -cost, int(G[u].size()) - 1});
    return id;
  }

  // x_i < x_(i + 1), (x_i, g(x_i)), (x_(i + 1), g(x_(i + 1)))どうしを結んだ折れ線になる.
  vector<pair<Cap, Cost>> slope(int s, int t, Cap flow_limit = inf) {
    vector<pair<Cap, Cost>> res;
    res.push_back({0, 0});
    Cap flow_now = 0;
    Cost cost = 0;
    vector<Cost> dist(V, inf), potential(V, 0);
    vector<int> preV(V, -1), preE(V, -1);
    priority_queue<pair<Cost, int>, vector<pair<Cost, int>>, greater<pair<Cost, int>>> pq;
    while (flow_now < flow_limit) {
      //dijkstra
      fill(dist.begin(), dist.end(), inf);
      vector<int> seen(V);
      dist[s] = 0;
      int now = s;
      Cost c = 0;
      while (now != -1) {
        int v = now;
        seen[v] = 1;
        for (int i = 0; i < int(G[v].size()); i++) {
          edge & e = G[v][i];
          if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + potential[v] - potential[e.to]) {
            dist[e.to] = dist[v] + e.cost + potential[v] - potential[e.to];
            preV[e.to] = v;
            preE[e.to] = i;
          }
        }
        int nex = -1;
        c = inf;
        for (int u = 0; u < V; u++) {
          if (seen[u]) continue;
          if (c > dist[u]) c = dist[u], nex = u;
        }
        now = nex;
      }
      if (dist[t] == inf) break; // もう流せない
      for (int v = 0; v < V; v++) potential[v] += dist[v]; // potentialの更新
      // 残与グラフの更新など
      Cap f = flow_limit - flow_now;
      for (int v = t; v != s; v = preV[v]) f = min(f, G[preV[v]][preE[v]].cap);
      flow_now += f;
      cost += f * potential[t];
      res.push_back({flow_now, cost});
      for (int v = t; v != s; v = preV[v]) {
        edge & e = G[preV[v]][preE[v]];
        e.cap -= f;
        G[v][e.rev].cap += f;
      }
    }
    return res;
  }

  pair<Cap, Cost> flow(int s, int t, Cap flow_limit = inf) { return slope(s, t, flow_limit).back(); }

};


void solve() {
  LL(N, M, L);
  MinCostFlow<long long, long long> mcf(N + M + 2);
  VC(ll, A, N);
  VC(ll, B, M);
  for (int u = 1; u <= N; u++) {
    mcf.add_edge(0, u, 1, 0);
    for (int v = 1; v <= M; v++) {
      ll a = A[u - 1], b = B[v - 1];
      mcf.add_edge(u, v + N, 1, abs(a - b));
    }
  }
  for (int v = 1; v <= M; v++) mcf.add_edge(v + N, N + M + 1, 1, 0);
  print(mcf.flow(0, N + M + 1, L).second);
}
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int testcases = 1;
  //cin >> testcases;
  FOR(testcases) solve();
}
0