結果
問題 | No.662 スロットマシーン |
ユーザー | McGregorsh |
提出日時 | 2022-07-01 14:19:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 269 ms / 2,000 ms |
コード長 | 1,955 bytes |
コンパイル時間 | 298 ms |
コンパイル使用メモリ | 87,280 KB |
実行使用メモリ | 94,124 KB |
最終ジャッジ日時 | 2023-08-17 01:08:34 |
合計ジャッジ時間 | 6,240 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 232 ms
92,728 KB |
testcase_01 | AC | 230 ms
92,796 KB |
testcase_02 | AC | 236 ms
92,756 KB |
testcase_03 | AC | 238 ms
92,772 KB |
testcase_04 | AC | 247 ms
94,044 KB |
testcase_05 | AC | 232 ms
92,472 KB |
testcase_06 | AC | 256 ms
94,108 KB |
testcase_07 | AC | 251 ms
94,120 KB |
testcase_08 | AC | 269 ms
93,748 KB |
testcase_09 | AC | 258 ms
93,776 KB |
testcase_10 | AC | 255 ms
94,016 KB |
testcase_11 | AC | 257 ms
94,124 KB |
testcase_12 | AC | 260 ms
93,756 KB |
testcase_13 | AC | 257 ms
93,756 KB |
testcase_14 | AC | 256 ms
94,016 KB |
testcase_15 | AC | 254 ms
94,040 KB |
testcase_16 | AC | 233 ms
92,652 KB |
testcase_17 | AC | 256 ms
94,100 KB |
testcase_18 | AC | 254 ms
93,752 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 def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): strs = [] score = [] for i in range(5): s, k = input().split() k = int(k) strs.append(s) score.append(k) base = 1 cic = [[] for i in range(3)] for i in range(3): num = int(input()) base *= num for j in range(num): mozi = input() cic[i].append(mozi) total_score = 0 nums = [0] * 5 for i in range(5): now = strs[i] cou = 1 for j in range(3): ninzu = cic[j].count(now) cou *= ninzu cou *= 5 nums[i] = cou total_score += cou * score[i] print(total_score / base) for i in nums: print(i) if __name__ == '__main__': main()