結果
問題 | No.662 スロットマシーン |
ユーザー | Coki628 |
提出日時 | 2020-05-14 19:19:06 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 405 ms / 2,000 ms |
コード長 | 1,960 bytes |
コンパイル時間 | 465 ms |
コンパイル使用メモリ | 87,284 KB |
実行使用メモリ | 81,296 KB |
最終ジャッジ日時 | 2023-10-13 17:48:43 |
合計ジャッジ時間 | 6,546 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 83 ms
71,808 KB |
testcase_01 | AC | 104 ms
77,732 KB |
testcase_02 | AC | 180 ms
80,040 KB |
testcase_03 | AC | 198 ms
80,204 KB |
testcase_04 | AC | 155 ms
79,812 KB |
testcase_05 | AC | 155 ms
79,412 KB |
testcase_06 | AC | 303 ms
80,324 KB |
testcase_07 | AC | 349 ms
80,408 KB |
testcase_08 | AC | 345 ms
80,432 KB |
testcase_09 | AC | 370 ms
80,848 KB |
testcase_10 | AC | 395 ms
80,808 KB |
testcase_11 | AC | 365 ms
81,052 KB |
testcase_12 | AC | 385 ms
81,080 KB |
testcase_13 | AC | 367 ms
80,516 KB |
testcase_14 | AC | 152 ms
80,064 KB |
testcase_15 | AC | 383 ms
81,232 KB |
testcase_16 | AC | 84 ms
71,812 KB |
testcase_17 | AC | 376 ms
81,296 KB |
testcase_18 | AC | 405 ms
80,880 KB |
ソースコード
import sys from collections import Counter def input(): return sys.stdin.readline().strip() def list2d(a, b, c): return [[c] * b for i in range(a)] def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)] def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)] def ceil(x, y=1): return int(-(-x // y)) def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)] def Yes(): print('Yes') def No(): print('No') def YES(): print('YES') def NO(): print('NO') sys.setrecursionlimit(10 ** 9) INF = 10 ** 18 MOD = 10 ** 9 + 7 EPS = 10 ** -10 M = 5 coin = [0] * M stoi = {} for i in range(M): s, c = input().split() c = int(c) coin[i] = c stoi[s] = i C = [Counter() for i in range(3)] for i in range(3): N = INT() S = [input() for i in range(N)] for j in range(N): k = (j+1) % N l = (j+2) % N C[i][(stoi[S[j]], stoi[S[k]], stoi[S[l]])] += 1 grid = list2d(3, 3, '') ans = [0] * M total = 0 sm = 0 for k1, v1 in C[0].items(): for i, s in enumerate(k1): grid[i][0] = s for k2, v2 in C[1].items(): for i, s in enumerate(k2): grid[i][1] = s for k3, v3 in C[2].items(): cnt = v1 * v2 * v3 for i, s in enumerate(k3): grid[i][2] = s for i in range(3): if grid[i][0] == grid[i][1] == grid[i][2]: ans[grid[i][0]] += cnt sm += coin[grid[i][0]] * cnt if grid[0][0] == grid[1][1] == grid[2][2]: ans[grid[0][0]] += cnt sm += coin[grid[0][0]] * cnt if grid[0][2] == grid[1][1] == grid[2][0]: ans[grid[0][2]] += cnt sm += coin[grid[0][2]] * cnt total += cnt exp = sm / total print(exp) for a in ans: print(a)