結果
問題 | No.2178 Payable Magic Items |
ユーザー | rlangevin |
提出日時 | 2023-03-18 23:30:47 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,683 ms / 4,000 ms |
コード長 | 3,620 bytes |
コンパイル時間 | 180 ms |
コンパイル使用メモリ | 81,840 KB |
実行使用メモリ | 135,724 KB |
最終ジャッジ日時 | 2023-10-18 17:36:47 |
合計ジャッジ時間 | 35,621 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 988 ms
114,288 KB |
testcase_01 | AC | 987 ms
114,288 KB |
testcase_02 | AC | 988 ms
114,296 KB |
testcase_03 | AC | 1,014 ms
114,780 KB |
testcase_04 | AC | 990 ms
114,288 KB |
testcase_05 | AC | 987 ms
114,288 KB |
testcase_06 | AC | 984 ms
114,288 KB |
testcase_07 | AC | 985 ms
114,620 KB |
testcase_08 | AC | 984 ms
114,288 KB |
testcase_09 | AC | 996 ms
114,288 KB |
testcase_10 | AC | 987 ms
114,284 KB |
testcase_11 | AC | 1,612 ms
135,724 KB |
testcase_12 | AC | 1,658 ms
135,708 KB |
testcase_13 | AC | 1,668 ms
135,708 KB |
testcase_14 | AC | 1,665 ms
135,708 KB |
testcase_15 | AC | 1,667 ms
135,704 KB |
testcase_16 | AC | 1,683 ms
135,708 KB |
testcase_17 | AC | 1,230 ms
120,548 KB |
testcase_18 | AC | 1,024 ms
115,312 KB |
testcase_19 | AC | 1,118 ms
118,876 KB |
testcase_20 | AC | 995 ms
114,564 KB |
testcase_21 | AC | 1,019 ms
115,528 KB |
testcase_22 | AC | 1,019 ms
115,228 KB |
testcase_23 | AC | 1,010 ms
114,768 KB |
testcase_24 | AC | 1,486 ms
128,804 KB |
testcase_25 | AC | 1,118 ms
116,892 KB |
testcase_26 | AC | 1,171 ms
121,208 KB |
ソースコード
import sys readline = sys.stdin.readline N, K = map(int, readline().split()) D = [[[[[[[[0] * 6 for _ in range(6)] for _ in range(6)] for _ in range(6)] for _ in range(6)] for _ in range(6)] for _ in range(6)] for _ in range(6)] S = [] for i in range(N): s = readline().rstrip() s = str(s).zfill(8) s = list(s) s = list(map(int, s)) s = list(map(lambda x : 4 - x, s)) s = list(map(str, s)) s = "".join(s) S.append(s) i,j,k,l,m,n,o,p = map(int,s) D[i + 1][j + 1][k + 1][l + 1][m + 1][n + 1][o + 1][p + 1] += 1 for i in range(6): for j in range(6): for k in range(6): for l in range(6): for m in range(6): for n in range(6): for o in range(6): for p in range(5): D[i][j][k][l][m][n][o][p + 1] += D[i][j][k][l][m][n][o][p] for i in range(6): for j in range(6): for k in range(6): for l in range(6): for m in range(6): for n in range(6): for o in range(5): for p in range(6): D[i][j][k][l][m][n][o + 1][p] += D[i][j][k][l][m][n][o][p] for i in range(6): for j in range(6): for k in range(6): for l in range(6): for m in range(6): for n in range(5): for o in range(6): for p in range(6): D[i][j][k][l][m][n + 1][o][p] += D[i][j][k][l][m][n][o][p] for i in range(6): for j in range(6): for k in range(6): for l in range(6): for m in range(5): for n in range(6): for o in range(6): for p in range(6): D[i][j][k][l][m + 1][n][o][p] += D[i][j][k][l][m][n][o][p] for i in range(6): for j in range(6): for k in range(6): for l in range(5): for m in range(6): for n in range(6): for o in range(6): for p in range(6): D[i][j][k][l + 1][m][n][o][p] += D[i][j][k][l][m][n][o][p] for i in range(6): for j in range(6): for k in range(5): for l in range(6): for m in range(6): for n in range(6): for o in range(6): for p in range(6): D[i][j][k + 1][l][m][n][o][p] += D[i][j][k][l][m][n][o][p] for i in range(6): for j in range(5): for k in range(6): for l in range(6): for m in range(6): for n in range(6): for o in range(6): for p in range(6): D[i][j + 1][k][l][m][n][o][p] += D[i][j][k][l][m][n][o][p] for i in range(5): for j in range(6): for k in range(6): for l in range(6): for m in range(6): for n in range(6): for o in range(6): for p in range(6): D[i + 1][j][k][l][m][n][o][p] += D[i][j][k][l][m][n][o][p] ans = 0 for s in S: i,j,k,l,m,n,o,p = map(int,s) if D[i + 1][j + 1][k + 1][l + 1][m + 1][n + 1][o + 1][p + 1] >= 2: ans += 1 print(ans)