#1061942 (PyPy3) No.967 引き算をして門松列（その２）

• 問題: No.967 引き算をして門松列（その２）
• ユーザー: lam6er
• 提出日時: 2025-03-31 17:42:03
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 181 ms / 2,000 ms
• コード長: 1,686 bytes
• コンパイル時間: 413 ms
• コンパイル使用メモリ: 82,768 KB
• 実行使用メモリ: 83,548 KB
• 最終ジャッジ日時: 2025-03-31 17:43:17
• 合計ジャッジ時間: 2,848 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 2
other	AC * 10

ソースコード

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
import sys
import math
def main():
    input = sys.stdin.read().split()
    idx = 0
    T = int(input[idx])
    idx += 1
    for _ in range(T):
        A = int(input[idx])
        B = int(input[idx + 1])
        C = int(input[idx + 2])
        X = int(input[idx + 3])
        Y = int(input[idx + 4])
        Z = int(input[idx + 5])
        idx += 6
        
        min_cost = math.inf
        
        # Case 1: C > A > B
        c_prime = C
        a_prime = min(A, c_prime - 1)
        if a_prime >= 2:
            b_prime = min(B, a_prime - 1)
            if b_prime >= 1:
                cost = (A - a_prime) * X + (B - b_prime) * Y
                min_cost = min(min_cost, cost)
        
        # Case 2: A > C > B
        a_prime = A
        c_prime = min(C, a_prime - 1)
        if c_prime >= 2:
            b_prime = min(B, c_prime - 1)
            if b_prime >= 1:
                cost = (C - c_prime) * Z + (B - b_prime) * Y
                min_cost = min(min_cost, cost)
        
        # Case 3: B > A > C
        b_prime = B
        a_prime = min(A, b_prime - 1)
        if a_prime >= 2:
            c_prime = min(C, a_prime - 1)
            if c_prime >= 1:
                cost = (A - a_prime) * X + (C - c_prime) * Z
                min_cost = min(min_cost, cost)
        
        # Case 4: B > C > A
        b_prime = B
        c_prime = min(C, b_prime - 1)
        if c_prime >= 2:
            a_prime = min(A, c_prime - 1)
            if a_prime >= 1:
                cost = (C - c_prime) * Z + (A - a_prime) * X
                min_cost = min(min_cost, cost)
        
        print(min_cost if min_cost != math.inf else -1)
if __name__ == '__main__':
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX