結果
問題 | No.966 引き算をして門松列(その1) |
ユーザー |
![]() |
提出日時 | 2020-02-02 14:43:54 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 968 bytes |
コンパイル時間 | 126 ms |
コンパイル使用メモリ | 12,928 KB |
実行使用メモリ | 12,160 KB |
最終ジャッジ日時 | 2024-09-18 20:45:19 |
合計ジャッジ時間 | 1,091 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 2 WA * 3 |
ソースコード
T = int(input()) A = [0]*T B = [0]*T C = [0]*T for i in range(T): A[i], B[i], C[i] = map(int, input().split()) inf = 3*10**9 for i in range(T): if 0 < A[i] < B[i] and 0 < C[i] < B[i] and A[i] != C[i]: print(0) continue if 0 < B[i] < A[i] and B[i] < C[i] and A[i] != C[i]: print(0) continue a = max(B[i], C[i])-1 if a == min(B[i], C[i]): a -= 1 if a <= 0 or B[i] == C[i] or (A[i] < B[i] and A[i] < C[i]): a = inf else: a = A[i]-a b = min(A[i], C[i])-1 if b <= 0 or A[i] == C[i] or (B[i] < A[i] and B[i] < C[i]): b = inf else: b = B[i]-b c = max(A[i], B[i])-1 if c == min(A[i], B[i]): c -= 1 if c <= 0 or A[i] == B[i] or (C[i] < A[i] and C[i] < B[i]): c = inf else: c = C[i]-c ans = min(a, b, c) if ans == inf: ans = -1 if A[i] == B[i] and B[i] == C[i] and A[i] > 2: ans = 3 print(ans)