結果

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

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 
typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};
#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif
int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int NA, NB, NC;
    cin >> NA >> NB >> NC;
    vector<ll> 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));
    vector<ll> accA(NA + 1), accB(NB + 1), accC(NC + 1);
    accA[0] = accB[0] = accC[0] = 0;
    rep(i,NA) accA[i + 1] = accA[i] + A[i];
    rep(i,NB) accB[i + 1] = accB[i] + B[i];
    rep(i,NC) accC[i + 1] = accC[i] + C[i];
    auto score = [&](int a, int b, int c){
        return accA[a] * (ll)b + accB[b] * (ll)c + accC[c] * (ll)a;
    };
    ll ans = -LINF;
    rep(a,NA+1){
        int lb = -1, rb = NB + 1;
        while(abs(lb - rb) > 3){
            int b1 = (lb * 2 + rb) / 3;
            int b2 = (lb + 2 * rb) / 3;
            
            int lc = -1, rc = NC + 1;
            while(abs(lc - rc) > 3){
                int c1 = (lc * 2 + rc) / 3;
                int c2 = (lc + 2 * rc) / 3;
                if (score(a, b1, c1) > score(a, b1, c2)) rc = c2;
                else lc = c1;
            }
            ll left = -LINF;
            for(int c = lc - 2; c < rc + 2; c++){
                if ((c < 0)||(c > NC)) continue;
                chmax(left, score(a, b1, c));
            }
            lc = -1, rc = NC + 1;
            while(abs(lc - rc) > 3){
                int c1 = (lc * 2 + rc) / 3;
                int c2 = (lc + 2 * rc) / 3;
                if (score(a, b2, c1) > score(a, b2, c2)) rc = c2;
                else lc = c1;
            }
            ll right = -LINF;
            for(int c = lc - 2; c < rc + 2; c++){
                if ((c < 0)||(c > NC)) continue;
                chmax(right, score(a, b2, c));
            }
            if (left > right) rb = b2;
            else lb = b1;
        }
        for(int b = lb - 2; b < rb + 2; b++){
            if ((b < 0)||(b > NB)) continue;
            int lc = -1, rc = NC + 1;
            while(abs(lc - rc) > 3){
                int c1 = (lc * 2 + rc) / 3;
                int c2 = (lc + 2 * rc) / 3;
                if (score(a, b, c1) > score(a, b, c2)) rc = c2;
                else lc = c1;
                debug(a, b, lc, rc, c1, c2);
            }
            ll right = -LINF;
            for(int c = lc - 2; c < rc + 2; c++){
                if ((c < 0)||(c > NC)) continue;
                chmax(ans, score(a, b, c));
            }
        }
    }
    cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0