結果
問題 | No.452 横着者のビンゴゲーム |
ユーザー | matsu7874 |
提出日時 | 2016-12-02 03:39:59 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 581 ms / 3,000 ms |
コード長 | 1,292 bytes |
コンパイル時間 | 271 ms |
コンパイル使用メモリ | 87,176 KB |
実行使用メモリ | 78,304 KB |
最終ジャッジ日時 | 2023-08-19 06:55:05 |
合計ジャッジ時間 | 10,726 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
71,028 KB |
testcase_01 | AC | 70 ms
71,196 KB |
testcase_02 | AC | 76 ms
75,328 KB |
testcase_03 | AC | 97 ms
76,096 KB |
testcase_04 | AC | 77 ms
75,152 KB |
testcase_05 | AC | 97 ms
76,504 KB |
testcase_06 | AC | 75 ms
75,256 KB |
testcase_07 | AC | 86 ms
75,952 KB |
testcase_08 | AC | 92 ms
75,972 KB |
testcase_09 | AC | 76 ms
75,104 KB |
testcase_10 | AC | 79 ms
75,384 KB |
testcase_11 | AC | 91 ms
76,044 KB |
testcase_12 | AC | 77 ms
75,392 KB |
testcase_13 | AC | 74 ms
71,180 KB |
testcase_14 | AC | 167 ms
77,952 KB |
testcase_15 | AC | 164 ms
77,744 KB |
testcase_16 | AC | 145 ms
77,700 KB |
testcase_17 | AC | 163 ms
76,644 KB |
testcase_18 | AC | 157 ms
77,576 KB |
testcase_19 | AC | 167 ms
77,196 KB |
testcase_20 | AC | 163 ms
77,340 KB |
testcase_21 | AC | 226 ms
77,576 KB |
testcase_22 | AC | 167 ms
76,580 KB |
testcase_23 | AC | 304 ms
78,008 KB |
testcase_24 | AC | 162 ms
76,616 KB |
testcase_25 | AC | 130 ms
76,452 KB |
testcase_26 | AC | 244 ms
77,740 KB |
testcase_27 | AC | 230 ms
77,548 KB |
testcase_28 | AC | 170 ms
77,448 KB |
testcase_29 | AC | 160 ms
77,004 KB |
testcase_30 | AC | 267 ms
77,884 KB |
testcase_31 | AC | 135 ms
77,192 KB |
testcase_32 | AC | 137 ms
76,868 KB |
testcase_33 | AC | 195 ms
77,456 KB |
testcase_34 | AC | 177 ms
77,408 KB |
testcase_35 | AC | 197 ms
77,320 KB |
testcase_36 | AC | 141 ms
76,336 KB |
testcase_37 | AC | 155 ms
76,452 KB |
testcase_38 | AC | 581 ms
78,240 KB |
testcase_39 | AC | 457 ms
77,900 KB |
testcase_40 | AC | 430 ms
78,052 KB |
testcase_41 | AC | 447 ms
77,604 KB |
testcase_42 | AC | 434 ms
77,792 KB |
testcase_43 | AC | 456 ms
78,304 KB |
ソースコード
n,m = map(int, input().split()) players = [[] for i in range(m)] def rowize(matrix): size = len(matrix) rows = [matrix[i][:] for i in range(size)] for i in range(size): column = [] for j in range(size): column.append(matrix[j][i]) rows.append(column[:]) diagonal = [] for i in range(size): diagonal.append(matrix[i][i]) rows.append(diagonal[:]) diagonal = [] for i in range(size): diagonal.append(matrix[i][size-i-1]) rows.append(diagonal[:]) return rows def count_duplicated(a, b): cnt = 0 i = 0 j = 0 while i<n and j<n: if a[i] < b[j]: i += 1 elif a[i] == b[j]: cnt += 1 i += 1 j += 1 else: j += 1 return cnt def max_x(duplicated): return 2*(n-duplicated) + (duplicated-1) for p in range(m): card = [] for i in range(n): card.append(list(map(int, input().split()))) for row in rowize(card): players[p].append(sorted(row)) max_duplicated = 0 for i in range(m-1): for j in range(i+1, m): for p in players[i]: for q in players[j]: max_duplicated = max(max_duplicated, count_duplicated(p, q)) print(max_x(max_duplicated))