結果
問題 | No.967 引き算をして門松列(その2) |
ユーザー | McGregorsh |
提出日時 | 2023-07-11 12:26:07 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,334 bytes |
コンパイル時間 | 390 ms |
コンパイル使用メモリ | 82,588 KB |
実行使用メモリ | 90,772 KB |
最終ジャッジ日時 | 2024-09-13 03:01:35 |
合計ジャッジ時間 | 3,375 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 143 ms
88,816 KB |
testcase_01 | AC | 146 ms
88,632 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
ソースコード
import sysfrom sys import stdinfrom fractions import Fractionimport mathfrom math import ceil, floor, sqrt, pi, factorial, gcdfrom copy import deepcopyfrom collections import Counter, deque, defaultdictfrom heapq import heapify, heappop, heappushfrom itertools import accumulate, product, combinations, combinations_with_replacement, permutationsfrom bisect import bisect, bisect_left, bisect_rightfrom functools import reduce, lru_cachefrom decimal import Decimal, getcontext, ROUND_HALF_UPdef i_input(): return int(stdin.readline())def i_map(): return map(int, stdin.readline().split())def i_list(): return list(i_map())def s_input(): return stdin.readline()[:-1]def s_map(): return s_input().split()def s_list(): return list(s_map())def lcm(a, b): return a * b // gcd(a, b)def get_distance(x1, y1, x2, y2):d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)return ddef rotate(table):n_fild = []for x in zip(*table[::-1]):n_fild.append(x)return n_fildsys.setrecursionlimit(10 ** 7)INF = float('inf')MOD = 10 ** 9 + 7MOD2 = 998244353alpa = 'abcdefghijklmnopqrstuvwxyz'ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'def main():T = int(input())base = [[2, 0, 1], [1, 0, 2], [0, 2, 1], [1, 2, 0]]for i in range(T):a, b, c, x, y, z = i_map()B = [x, y, z]ans = INFfor l, m, r in base:nums = [0] * 3P = [0] * 3nums[l] = anums[m] = bnums[r] = cP[l] = 0P[m] = 1P[r] = 2score = INFcost = 0if nums[0] <= nums[1]:p = nums[0]-1if p > 0:cost += (nums[1]-p) * B[P[1]]nums[1] = pif nums[1] <= nums[2]:pp = nums[1]-1if pp > 0:cost += (nums[2]-pp) * B[P[2]]score = min(score, cost)else:if nums[1] <= nums[2]:pp = nums[1]-1if pp > 0:cost = (nums[2]-pp) * B[P[2]]score = min(score, cost)else:score = 0ans = min(ans, score)if ans == INF:print(-1)else:print(ans)if __name__ == '__main__':main()