結果
問題 | No.267 トランプソート |
ユーザー | McGregorsh |
提出日時 | 2022-06-20 10:14:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 146 ms / 1,000 ms |
コード長 | 2,390 bytes |
コンパイル時間 | 186 ms |
コンパイル使用メモリ | 82,564 KB |
実行使用メモリ | 83,616 KB |
最終ジャッジ日時 | 2024-04-20 22:21:47 |
合計ジャッジ時間 | 4,548 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 134 ms
83,200 KB |
testcase_01 | AC | 135 ms
83,616 KB |
testcase_02 | AC | 135 ms
83,200 KB |
testcase_03 | AC | 136 ms
83,456 KB |
testcase_04 | AC | 136 ms
83,328 KB |
testcase_05 | AC | 135 ms
83,328 KB |
testcase_06 | AC | 143 ms
83,456 KB |
testcase_07 | AC | 145 ms
83,060 KB |
testcase_08 | AC | 142 ms
82,944 KB |
testcase_09 | AC | 132 ms
83,200 KB |
testcase_10 | AC | 141 ms
83,456 KB |
testcase_11 | AC | 137 ms
83,328 KB |
testcase_12 | AC | 136 ms
82,816 KB |
testcase_13 | AC | 140 ms
83,328 KB |
testcase_14 | AC | 140 ms
83,328 KB |
testcase_15 | AC | 138 ms
83,576 KB |
testcase_16 | AC | 133 ms
83,328 KB |
testcase_17 | AC | 135 ms
83,328 KB |
testcase_18 | AC | 132 ms
82,944 KB |
testcase_19 | AC | 140 ms
83,328 KB |
testcase_20 | AC | 146 ms
83,456 KB |
testcase_21 | AC | 137 ms
83,200 KB |
testcase_22 | AC | 135 ms
83,584 KB |
ソースコード
import sys, re from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] 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 d sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n = int(input()) cards = s_list() nums = [] for i in range(n): score = 0 if cards[i][0] == 'D': score += 100 elif cards [i][0] == 'C': score += 200 elif cards [i][0] == 'H': score += 300 elif cards [i][0] == 'S': score += 400 if len(cards[i]) == 2: if cards[i][1] == 'A': score += 1 if cards[i][1] == '2': score += 2 if cards[i][1] == '3': score += 3 if cards[i][1] == '4': score += 4 if cards[i][1] == '5': score += 5 if cards[i][1] == '6': score += 6 if cards[i][1] == '7': score += 7 if cards[i][1] == '8': score += 8 if cards[i][1] == '9': score += 9 if cards[i][1] == 'T': score += 10 if cards[i][1] == 'J': score += 11 if cards[i][1] == 'Q': score += 12 if cards[i][1] == 'K': score += 13 nums.append([score, cards[i]]) nums.sort() ans = [] for i in range(n): ans.append(nums[i][1]) print(*ans) if __name__ == '__main__': main()