結果
問題 | No.452 横着者のビンゴゲーム |
ユーザー | matsu7874 |
提出日時 | 2016-12-02 03:58:30 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,292 bytes |
コンパイル時間 | 82 ms |
コンパイル使用メモリ | 12,800 KB |
実行使用メモリ | 12,928 KB |
最終ジャッジ日時 | 2024-05-05 16:47:55 |
合計ジャッジ時間 | 33,222 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
10,752 KB |
testcase_01 | AC | 29 ms
10,880 KB |
testcase_02 | AC | 27 ms
10,880 KB |
testcase_03 | AC | 37 ms
10,880 KB |
testcase_04 | AC | 27 ms
10,752 KB |
testcase_05 | AC | 41 ms
10,752 KB |
testcase_06 | AC | 26 ms
10,880 KB |
testcase_07 | AC | 28 ms
10,752 KB |
testcase_08 | AC | 30 ms
10,752 KB |
testcase_09 | AC | 27 ms
10,880 KB |
testcase_10 | AC | 28 ms
10,752 KB |
testcase_11 | AC | 30 ms
10,752 KB |
testcase_12 | AC | 26 ms
10,752 KB |
testcase_13 | AC | 25 ms
10,752 KB |
testcase_14 | AC | 1,679 ms
12,928 KB |
testcase_15 | AC | 1,643 ms
12,800 KB |
testcase_16 | AC | 1,073 ms
11,776 KB |
testcase_17 | AC | 462 ms
10,880 KB |
testcase_18 | AC | 407 ms
11,008 KB |
testcase_19 | AC | 385 ms
11,008 KB |
testcase_20 | AC | 382 ms
11,008 KB |
testcase_21 | AC | 879 ms
11,392 KB |
testcase_22 | AC | 369 ms
10,880 KB |
testcase_23 | AC | 1,634 ms
11,776 KB |
testcase_24 | AC | 344 ms
10,752 KB |
testcase_25 | AC | 171 ms
10,752 KB |
testcase_26 | AC | 1,006 ms
11,264 KB |
testcase_27 | AC | 851 ms
11,136 KB |
testcase_28 | AC | 455 ms
11,008 KB |
testcase_29 | AC | 350 ms
11,008 KB |
testcase_30 | AC | 1,163 ms
11,392 KB |
testcase_31 | AC | 247 ms
10,880 KB |
testcase_32 | AC | 225 ms
10,752 KB |
testcase_33 | AC | 617 ms
11,136 KB |
testcase_34 | AC | 513 ms
11,008 KB |
testcase_35 | AC | 527 ms
10,880 KB |
testcase_36 | AC | 214 ms
10,880 KB |
testcase_37 | AC | 264 ms
10,752 KB |
testcase_38 | TLE | - |
testcase_39 | AC | 2,432 ms
11,904 KB |
testcase_40 | AC | 2,445 ms
11,904 KB |
testcase_41 | AC | 2,460 ms
11,776 KB |
testcase_42 | AC | 2,473 ms
11,776 KB |
testcase_43 | AC | 2,421 ms
11,776 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))