結果

問題 No.2495 Three Sets
コンテスト
ユーザー Aoxiang Cui
提出日時 2023-10-06 23:25:56
言語 C++17
(gcc 13.3.0 + boost 1.89.0)
結果
WA  
実行時間 -
コード長 8,699 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 1,532 ms
コンパイル使用メモリ 137,668 KB
最終ジャッジ日時 2025-02-17 05:40:51
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 11 WA * 7
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

using int64 = long long;
using int128 = __int128_t;
using ii = pair<int, int>;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
// const int MOD = 1e9 + 7;
const int MOD = 998244353;
mt19937_64 mrand(random_device{}());
int64 rnd(int64 x) { return mrand() % x; }
constexpr inline int lg2(int64 x) { return x == 0 ? -1 : sizeof(int64) * 8 - 1 - __builtin_clzll(x); }
constexpr inline int64 p2ceil(int64 x) { return 1LL << (lg2(x - 1) + 1); }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
inline void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }
inline void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; }
inline int mod(int x) { return x >= MOD ? x - MOD : x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

template <int MOD_> struct modnum {
  static constexpr int MOD = MOD_;
  static_assert(MOD_ > 0, "MOD must be positive");

 private:
  int v;
  static int minv(int a, int m) {
    a %= m; assert(a);
    return a == 1 ? 1 : int(m - int64(minv(m, a)) * int64(m) / a);
  }

 public:
  modnum() : v(0) {}
  modnum(int64 v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; }
  explicit operator int() const { return v; }
  friend std::ostream& operator << (std::ostream& out, const modnum& n) { return out << int(n); }
  friend std::istream& operator >> (std::istream& in, modnum& n) { int64 v_; in >> v_; n = modnum(v_); return in; }
  friend bool operator == (const modnum& a, const modnum& b) { return a.v == b.v; }
  friend bool operator != (const modnum& a, const modnum& b) { return a.v != b.v; }

  modnum inv() const { modnum res; res.v = minv(v, MOD); return res; }
  friend modnum inv(const modnum& m) { return m.inv(); }
  modnum neg() const { modnum res; res.v = v ? MOD-v : 0; return res; }
  friend modnum neg(const modnum& m) { return m.neg(); }

  modnum operator- () const { return neg(); }
  modnum operator+ () const { return modnum(*this); }

  modnum& operator ++ () { ++v; if (v == MOD) v = 0; return *this; }
  modnum& operator -- () { if (v == 0) v = MOD; --v; return *this; }
  modnum& operator += (const modnum& o) { v += o.v; if (v >= MOD) v -= MOD; return *this; }
  modnum& operator -= (const modnum& o) { v -= o.v; if (v < 0) v += MOD; return *this; }
  modnum& operator *= (const modnum& o) { v = int(int64(v) * int64(o.v) % MOD); return *this; }
  modnum& operator /= (const modnum& o) { return *this *= o.inv(); }

  friend modnum operator ++ (modnum& a, int) { modnum r = a; ++a; return r; }
  friend modnum operator -- (modnum& a, int) { modnum r = a; --a; return r; }
  friend modnum operator + (const modnum& a, const modnum& b) { return modnum(a) += b; }
  friend modnum operator - (const modnum& a, const modnum& b) { return modnum(a) -= b; }
  friend modnum operator * (const modnum& a, const modnum& b) { return modnum(a) *= b; }
  friend modnum operator / (const modnum& a, const modnum& b) { return modnum(a) /= b; }
  friend modnum power(modnum a, int64 n) {
    modnum ret = 1;
    for (; n; n >>= 1) {
      if (n & 1) ret *= a;
      a *= a;
    }
    return ret;
  }
};

using mint = modnum<MOD>;

struct DSU {
  vector<int> f, c;
  DSU(int n) : f(n), c(n, 1) {
    iota(f.begin(), f.end(), 0);
  }
  int find(int x) {
    if (f[x] != f[f[x]]) f[x] = find(f[x]);
    return f[x];
  }
  bool join(int x, int y) {
    int rx = find(x), ry = find(y);
    if (rx == ry) return false;
    if (c[rx] < c[ry]) swap(rx, ry);
    f[ry] = rx;
    c[rx] += c[ry];
    return true;
  }
};

int main() {
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> a(n), b(m), c(k);
  for (auto& x : a) cin >> x;
  for (auto& x : b) cin >> x;
  for (auto& x : c) cin >> x;
  sort(a.rbegin(), a.rend());
  sort(b.rbegin(), b.rend());
  sort(c.rbegin(), c.rend());
  vector<int64> A(n + 1), B(m + 1), C(k + 1);
  for (int i = 0; i < n; ++i) A[i + 1] = A[i] + a[i];
  for (int i = 0; i < m; ++i) B[i + 1] = B[i] + b[i];
  for (int i = 0; i < k; ++i) C[i + 1] = C[i] + c[i];
  trace(a, b, c, A, B, C);

  // int64 ret = 0;
  auto solve =
    [&](int x, int y, int z) {
      return A[x] * y + B[y] * z + C[z] * x;
    };

  auto solveZ =
    [&](int x, int y, int low, int high) {
      while (high - low > 3) {
        int m1 = (low * 2 + high) / 3;
        int m2 = (low + high * 2) / 3;
        if (solve(x, y, m1) > solve(x, y, m2)) {
          high = m2;
        } else {
          low = m1;
        }
      }
      int64 ret = 0;
      for (int z = low; z <= high; ++z) {
        ckmax(ret, solve(x, y, z));
      }
      return ret;
    };
  auto solveY =
    [&](int x, int low, int high) {
      while (high - low > 3) {
        int m1 = (low * 2 + high) / 3;
        int m2 = (low + high * 2) / 3;
        if (solveZ(x, m1, 0, k) > solveZ(x, m2, 0, k)) {
          high = m2;
        } else {
          low = m1;
        }
      }
      int64 ret = 0;
      for (int y = low; y <= high; ++y) {
        ckmax(ret, solveZ(x, y, 0, m));
      }
      return ret;
    };
  auto solveX =
    [&](int low, int high) {
      while (high - low > 3) {
        int m1 = (low * 2 + high) / 3;
        int m2 = (low + high * 2) / 3;
        if (solveY(m1, 0, m) > solveY(m2, 0, m)) {
          high = m2;
        } else {
          low = m1;
        }
      }
      int64 ret = 0;
      for (int x = low; x <= high; ++x) {
        ckmax(ret, solveY(x, 0, m));
      }
      return ret;
    };
  // for (int x = 0; x <= n; ++x) {
  //   for (int y = 0; y <= m; ++y) {
  //     for (int z = 0; z <= k; ++z) {
  //       int64 cur = A[x] * y + B[y] * z + C[z] * x;
  //       if (cur > ret) {
  //         ret = cur;
  //         trace(x, y, z, cur);
  //       }
  //     }
  //   }
  // }
  int64 ret = solveX(0, n);
  cout << ret << '\n';
  return 0;
}
0