結果

問題 No.2495 Three Sets
ユーザー startcpp
提出日時 2023-10-07 17:59:02
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 599 ms / 3,000 ms
コード長 2,849 bytes
コンパイル時間 645 ms
コンパイル使用メモリ 70,684 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-26 17:52:09
合計ジャッジ時間 10,011 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

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

//A, B, Ca, b, c (0-idx) j * a_i + k * b_j + i * c_k max
//i, jf(k) = k * b_j + i * c_kmax.
//f(k + 1) - f(k) = b_j + i * C_k ≧ 0i * C_k ≧ -b_j ⇔ (i≠0) C_k ≧ Ceil(-b_j / i)
//CC_k < Ceil(-b_j / i)k(≧0, nC)c_kOK
// or O(M^2)
//i = 0nC * max(b_j)OK. (M: - ≦ 6000)
#include <iostream>
#include <algorithm>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
int Ceil(int si, int bo) {
if (bo < 0) { bo *= -1; si *= -1; }
if (si >= 0) { return (si + bo - 1) / bo; }
return si / bo;
}
const int M = 3000;
int nA, nB, nC;
int a[100000];
int b[100000];
int c[100000];
int rcntA[2 * M + 2], rsumA[2 * M + 2]; //[i]: -M + i (0 ≦ i ≦ 2M + 1)
int rcntB[2 * M + 2], rsumB[2 * M + 2];
int rcntC[2 * M + 2], rsumC[2 * M + 2];
void make_rui(int a[], int n, int rCnt[], int rSum[]) {
int i, len = 1, s = a[0];
for (i = 1; i < n; i++) {
if (a[i - 1] != a[i]) {
rCnt[a[i - 1] + M + 1] += len;
rSum[a[i - 1] + M + 1] += s;
len = 0; s = 0;
}
len++; s += a[i];
}
rCnt[a[n - 1] + M + 1] += len;
rSum[a[n - 1] + M + 1] += s;
rep(i, 2 * M + 1) rCnt[i + 1] += rCnt[i];
rep(i, 2 * M + 1) rSum[i + 1] += rSum[i];
}
signed main() {
int i, j;
cin >> nA >> nB >> nC;
rep(i, nA) cin >> a[i];
rep(i, nB) cin >> b[i];
rep(i, nC) cin >> c[i];
sort(a, a + nA);
sort(b, b + nB);
sort(c, c + nC);
make_rui(a, nA, rcntA, rsumA);
make_rui(b, nB, rcntB, rsumB);
make_rui(c, nC, rcntC, rsumC);
int ans = 0;
for (i = -M; i <= M + 1; i++) { //Ai
int cntA = rcntA[2 * M + 1] - rcntA[i + M];
int sumA = rsumA[2 * M + 1] - rsumA[i + M];
if (cntA == 0) continue;
for (j = -M; j <= M + 1; j++) { //Bj
int cntB = rcntB[2 * M + 1] - rcntB[j + M];
int sumB = rsumB[2 * M + 1] - rsumB[j + M];
int high = Ceil(-sumB, cntA); //Chigh
high = max(-M, min(high, M + 1)); //
int cntC = rcntC[2 * M + 1] - rcntC[high + M];
int sumC = rsumC[2 * M + 1] - rsumC[high + M];
int score = sumA * cntB + sumB * cntC + sumC * cntA;
ans = max(ans, score);
}
}
//A
int maxB = 0;
for (i = -M; i <= M + 1; i++) { //Bi
int sumB = rsumB[2 * M + 1] - rsumB[i + M];
maxB = max(maxB, sumB);
}
ans = max(ans, maxB * nC);
cout << ans << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0