結果

問題 No.2495 Three Sets
ユーザー sgfc
提出日時 2023-10-06 22:10:35
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,474 bytes
コンパイル時間 4,921 ms
コンパイル使用メモリ 318,028 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-26 16:22:22
合計ジャッジ時間 5,995 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 6 WA * 12
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>

#include <stdio.h>
#include <math.h>
#include <cassert>

#include "atcoder/all"
#include <float.h>

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)
#define TCASE() ll t; cin >> t; REP(i, t)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using vd = vector<double>;
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>;
using vvm = vector<vm>;

void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
template<class T, class U> bool chmin(T& a, const U& b) { const T olda = a; a = gmin(a, b); return olda != a; }
template<class T, class U> bool chmax(T& a, const U& b) { const T olda = a; a = gmax(a, b); return olda != a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };

ll sa, sb, sc;
ll ca, cb, cc;

ll f(ll sa, ll ca, ll sb, ll cb, ll sc, ll cc) {
	return sa * cb + sb * cc + sc * ca;
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	ll na, nb, nc;
	cin >> na >> nb >> nc;

	VLI(a, na);
	VLI(b, nb);
	VLI(c, nc);

	mysort(a);
	mysort(b);
	mysort(c);

	sa = sb = sc = 0;
	ca = cb = cc = 0;

	while (!a.empty() && a.back() >= 0) {
		sa += a.back();
		a.pop_back();
		ca++;
	}
	while (!b.empty() && b.back() >= 0) {
		sb += b.back();
		b.pop_back();
		cb++;
	}
	while (!c.empty() && c.back() >= 0) {
		sc += c.back();
		c.pop_back();
		cc++;
	}

	ll ans = f(sa, ca, sb, cb, sc, cc);
	while (!a.empty() || !b.empty() || !c.empty()) {
		ll ma = -llhuge, mb = -llhuge, mc = -llhuge;

		vl ts(8, -llhuge);

		REP(i, 8) {
			ll tsa = sa;
			ll tsb = sb;
			ll tsc = sc;
			ll tca = ca;
			ll tcb = cb;
			ll tcc = cc;
			if (i & 1) {
				if (a.empty()) continue;
				tsa += a.back();
				tca++;
			}
			if (i & 2) {
				if (b.empty()) continue;
				tsb += b.back();
				tcb++;
			}
			if (i & 4) {
				if (c.empty()) continue;
				tsc += c.back();
				tcc++;
			}
			ts[i] = f(tsa, tca, tsb, tcb, tsc, tcc);
		}

		ll mxi = 0;
		ll mxv = -llhuge;
		REP(i, 8) {
			if (mxv >= ts[i]) continue;
			mxi = i;
			mxv = ts[i];
		}
		chmax(ans, mxv);
		if (mxi == 0) break;

		if (mxi & 1) {
			sa += a.back();
			a.pop_back();
			ca++;
		}
		if (mxi & 2) {
			sb += b.back();
			b.pop_back();
			cb++;
		}
		if (mxi & 4) {
			sc += c.back();
			c.pop_back();
			cc++;
		}

	}

	cout << ans << endl;
}
0