#928870 (C++17) No.2495 Three Sets

• 問題: No.2495 Three Sets
• ユーザー: a_s_k
• 提出日時: 2023-11-15 14:24:40
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 355 ms / 3,000 ms
• コード長: 1,952 bytes
• コンパイル時間: 2,191 ms
• コンパイル使用メモリ: 201,064 KB
• 最終ジャッジ日時: 2025-02-17 22:05:54
• ジャッジサーバーID （参考情報）: judge5 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 18

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i, m, n) for (ll i = m; i < n; i++)
#define Endl endl
vector<ll> sa, sb, sc;
ll A, B, C;
ll f(ll s, ll t, ll u)
{
    return sa[s] * t + sb[t] * u + sc[u] * s;
}
ll g(ll i, ll j)
{
    ll sub = -1e18;
    if (f(i, j, C - 1) <= f(i, j, C))
        sub = max(sub, f(i, j, C));
    else if (f(i, j, 0) > f(i, j, 1))
        sub = max(sub, f(i, j, 0));
    else
    {
        ll l = 0;
        ll r = C - 1;
        while (r - l > 1)
        {
            ll search = l + (r - l) / 2;
            if (f(i, j, search) <= f(i, j, search + 1))
                l = search;
            else
                r = search;
        }
        sub = max(sub, f(i, j, r));
    }
    return sub;
}
int main()
{
    cin >> A >> B >> C;
    vector<ll> a(A), b(B), c(C);
    rep(i, 0, A) cin >> a[i];
    rep(i, 0, B) cin >> b[i];
    rep(i, 0, C) cin >> c[i];
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    sort(c.begin(), c.end());
    reverse(a.begin(), a.end());
    reverse(b.begin(), b.end());
    reverse(c.begin(), c.end());
    sa.push_back(0);
    sb.push_back(0);
    sc.push_back(0);
    rep(i, 0, A)
    {
        sa.push_back(sa[i] + a[i]);
    }
    rep(i, 0, B)
    {
        sb.push_back(sb[i] + b[i]);
    }
    rep(i, 0, C)
    {
        sc.push_back(sc[i] + c[i]);
    }
    ll ans = -1e18;
    rep(i, 0, A + 1)
    {
        
        if(g(i,0)>g(i,1))ans=max(ans,g(i,0));
        else if(g(i,B-1)<g(i,B))ans=max(ans,g(i,B));
        else {
            ll l=0;
            ll r=B-1;
            while(r-l>1){
                ll search=l+(r-l)/2;
                if(g(i,search)<=g(i,search+1))l=search;
                else r=search;
            }
            ans=max(ans,g(i,r));
        }
        /*rep(j, 0, B + 1)
        {
            ans=max(ans,g(i,j));
            cout<<g(i,j)<<endl;
        }
        cout<<endl;*/
    }
    cout << ans << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX