結果
問題 | No.2958 Placing Many L-s |
ユーザー |
|
提出日時 | 2024-11-08 22:08:40 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,273 bytes |
コンパイル時間 | 309 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 80,000 KB |
最終ジャッジ日時 | 2024-11-08 22:08:58 |
合計ジャッジ時間 | 6,900 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 WA * 9 |
ソースコード
for _ in range(int(input())):N, M = map(int, input().split())if N >= 3 and N % 2 == 1 and M % 8 == 0:print(N * M // 4)ans = [[0] * M for _ in range(N)]c = 1for i in range(0, N - 3, 2):for j in range(0, M, 4):ans[i][j] = cans[i][j + 1] = cans[i][j + 2] = cans[i][j + 3] = c + 1ans[i + 1][j] = cans[i + 1][j + 1] = c + 1ans[i + 1][j + 2] = c + 1ans[i + 1][j + 3] = c + 1c += 2for j in range(0, M, 8):ans[N - 3][j] = cans[N - 3][j + 1] = c + 1ans[N - 3][j + 2] = c + 1ans[N - 3][j + 3] = c + 1ans[N - 3][j + 4] = c + 2ans[N - 3][j + 5] = c + 2ans[N - 3][j + 6] = c + 2ans[N - 3][j + 7] = c + 3ans[N - 2][j] = cans[N - 2][j + 1] = c + 1ans[N - 2][j + 2] = c + 4ans[N - 2][j + 3] = c + 5ans[N - 2][j + 4] = c + 5ans[N - 2][j + 5] = c + 5ans[N - 2][j + 6] = c + 2ans[N - 2][j + 7] = c + 3ans[N - 1][j] = cans[N - 1][j + 1] = cans[N - 1][j + 2] = c + 4ans[N - 1][j + 3] = c + 4ans[N - 1][j + 4] = c + 4ans[N - 1][j + 5] = c + 5ans[N - 1][j + 6] = c + 3ans[N - 1][j + 7] = c + 3c += 6for i in range(N):print(*ans[i])continueif M >= 3 and M % 2 == 1 and N % 8 == 0:print(N * M // 4)ans = [[0] * M for _ in range(N)]c = 1for i in range(0, N, 4):for j in range(0, M - 3, 2):ans[i][j] = cans[i][j + 1] = cans[i + 1][j] = cans[i + 1][j + 1] = c + 1ans[i + 2][j] = cans[i + 2][j + 1] = c + 1ans[i + 3][j] = c + 1ans[i + 3][j + 1] = c + 1for i in range(0, N, 8):ans[i][M - 3] = cans[i][M - 2] = cans[i][M - 1] = cans[i + 1][M - 3] = cans[i + 1][M - 2] = c + 1ans[i + 1][M - 1] = c + 1ans[i + 2][M - 3] = c + 4ans[i + 2][M - 2] = c + 4ans[i + 2][M - 1] = c + 1ans[i + 3][M - 3] = c + 4ans[i + 3][M - 2] = c + 5ans[i + 3][M - 1] = c + 1ans[i + 4][M - 3] = c + 4ans[i + 4][M - 2] = c + 5ans[i + 4][M - 1] = c + 2ans[i + 5][M - 3] = c + 5ans[i + 5][M - 2] = c + 5ans[i + 5][M - 1] = c + 2ans[i + 6][M - 3] = c + 3ans[i + 6][M - 2] = c + 2ans[i + 6][M - 1] = c + 2ans[i + 7][M - 3] = c + 3ans[i + 7][M - 2] = c + 3ans[i + 7][M - 1] = c + 3c += 6for i in range(N):print(*ans[i])continueif N % 4 == 0 and M % 2 == 0:print(N * M // 4)ans = [[0] * M for _ in range(N)]c = 1for i in range(N // 4):for j in range(M // 2):ans[4 * i][2 * j] = cans[4 * i][2 * j + 1] = cans[4 * i + 1][2 * j] = cans[4 * i + 1][2 * j + 1] = c + 1ans[4 * i + 2][2 * j] = cans[4 * i + 2][2 * j + 1] = c + 1ans[4 * i + 3][2 * j] = c + 1ans[4 * i + 3][2 * j + 1] = c + 1c += 2for i in range(N):print(*ans[i])continueelif N % 2 == 0 and M % 4 == 0:print(N * M // 4)ans = [[0] * M for _ in range(N)]c = 1for i in range(N // 2):for j in range(M // 4):ans[2 * i][4 * j] = cans[2 * i + 1][4 * j] = cans[2 * i][4 * j + 1] = cans[2 * i + 1][4 * j + 1] = c + 1ans[2 * i][4 * j + 2] = cans[2 * i + 1][4 * j + 2] = c + 1ans[2 * i][4 * j + 3] = c + 1ans[2 * i + 1][4 * j + 3] = c + 1c += 2for i in range(N):print(*ans[i])continueprint(-1)