結果

問題 No.2495 Three Sets
コンテスト
ユーザー akiaa11
提出日時 2023-10-06 22:49:45
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 478 ms / 3,000 ms
コード長 3,944 bytes
コンパイル時間 4,298 ms
コンパイル使用メモリ 256,484 KB
最終ジャッジ日時 2025-02-17 05:24:57
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)n-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}

constexpr ll INF=numeric_limits<ll>::max() / 4;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int na, nb, nc;cin>>na>>nb>>nc;
	vecll a(na), b(nb), c(nc);
	rep(i, na) cin>>a[i];
	rep(i, nb) cin>>b[i];
	rep(i, nc) cin>>c[i];
	sort(rall(a));
	sort(rall(b));
	sort(rall(c));
	rep(i, 1, na) a[i] += a[i - 1];
	rep(i, 1, nb) b[i] += b[i - 1];
	rep(i, 1, nc) c[i] += c[i - 1];
	auto get = [&](int ka, int kb, ll sa, ll sb, int mid){
		return sa * kb + sb * mid + (mid > 0 ? c[mid - 1] : 0) * ka;
	};
	auto f = [&](int ka, int kb, ll sa, ll sb){
		int l = 0, r = nc;
		while(r - l > 1){
			int mid = (l + r) / 2;
			if(get(ka, kb, sa, sb, mid) < get(ka, kb, sa, sb, mid + 1)) l = mid;
			else r = mid;
		}
		return max(get(ka, kb, sa, sb, l), get(ka, kb, sa, sb, r));
	};
	ll ans = 0;
	rep(i, na + 1){
		ll s = (i > 0 ? a[i - 1] : 0);
		int l = 0, r = nb;
		while(r - l > 1){
			int mid = (l + r) / 2;
			if(f(i, mid, s, b[mid - 1]) < f(i, mid + 1, s, b[mid])) l = mid;
			else r = mid;
		}
		chmax(ans, f(i, l, s, (l > 0 ? b[l - 1] : 0)));
		chmax(ans, f(i, r, s, b[r - 1]));
	}
	cout<<ans<<endl;
}
0