結果

問題 No.2309 [Cherry 5th Tune D] 夏の先取り
ユーザー chro_96chro_96
提出日時 2023-05-19 23:11:19
言語 C
(gcc 13.3.0)
結果
AC  
実行時間 8 ms / 3,000 ms
コード長 3,157 bytes
コンパイル時間 269 ms
コンパイル使用メモリ 31,232 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-12-20 01:41:52
合計ジャッジ時間 1,955 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

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

#include <stdio.h>
int main () {
int t = 0;
int res = 0;
res = scanf("%d", &t);
while (t > 0) {
int a = 0;
int b = 0;
int c = 0;
long long x = 0LL;
long long y = 0LL;
long long z = 0LL;
long long w = 0LL;
long long ans = 0LL;
res = scanf("%d", &a);
res = scanf("%d", &b);
res = scanf("%d", &c);
res = scanf("%lld", &x);
res = scanf("%lld", &y);
res = scanf("%lld", &z);
res = scanf("%lld", &w);
for (int i = 0; (i <= a && i <= b && i <= c); i++) {
long long tmp = 0LL;
if (2LL*w >= x+y+z) {
tmp = w*((long long)i);
} else {
tmp = w*((long long)(i%2))+(x+y+z)*((long long)(i/2));
}
if (x > y) {
long long tmptmp = 0LL;
if (a > b) {
tmptmp = x*((long long)(b-i));
} else {
tmptmp = x*((long long)(a-i));
if (b-a < c-i) {
tmptmp += y*((long long)(b-a));
} else {
tmptmp += y*((long long)(c-i));
}
}
if (tmp+tmptmp > ans) {
ans = tmp+tmptmp;
}
} else {
long long tmptmp = 0LL;
if (c > b) {
tmptmp = y*((long long)(b-i));
} else {
tmptmp = y*((long long)(c-i));
if (b-c < a-i) {
tmptmp += x*((long long)(b-c));
} else {
tmptmp += x*((long long)(a-i));
}
}
if (tmp+tmptmp > ans) {
ans = tmp+tmptmp;
}
}
if (y > z) {
long long tmptmp = 0LL;
if (b > c) {
tmptmp = y*((long long)(c-i));
} else {
tmptmp = y*((long long)(b-i));
if (c-b < a-i) {
tmptmp += z*((long long)(c-b));
} else {
tmptmp += z*((long long)(a-i));
}
}
if (tmp+tmptmp > ans) {
ans = tmp+tmptmp;
}
} else {
long long tmptmp = 0LL;
if (a > c) {
tmptmp = z*((long long)(c-i));
} else {
tmptmp = z*((long long)(a-i));
if (c-a < b-i) {
tmptmp += y*((long long)(c-a));
} else {
tmptmp += y*((long long)(b-i));
}
}
if (tmp+tmptmp > ans) {
ans = tmp+tmptmp;
}
}
if (z > x) {
long long tmptmp = 0LL;
if (c > a) {
tmptmp = z*((long long)(a-i));
} else {
tmptmp = z*((long long)(c-i));
if (a-c < b-i) {
tmptmp += x*((long long)(a-c));
} else {
tmptmp += x*((long long)(b-i));
}
}
if (tmp+tmptmp > ans) {
ans = tmp+tmptmp;
}
} else {
long long tmptmp = 0LL;
if (b > a) {
tmptmp = x*((long long)(a-i));
} else {
tmptmp = x*((long long)(b-i));
if (a-b < c-i) {
tmptmp += z*((long long)(a-b));
} else {
tmptmp += z*((long long)(c-i));
}
}
if (tmp+tmptmp > ans) {
ans = tmp+tmptmp;
}
}
}
printf("%lld\n", ans);
t--;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0