結果
問題 | No.401 数字の渦巻き |
ユーザー | ys |
提出日時 | 2018-08-19 08:06:20 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 18 ms / 2,000 ms |
コード長 | 1,454 bytes |
コンパイル時間 | 484 ms |
コンパイル使用メモリ | 10,960 KB |
実行使用メモリ | 8,224 KB |
最終ジャッジ日時 | 2023-08-08 13:17:02 |
合計ジャッジ時間 | 2,456 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 16 ms
8,092 KB |
testcase_01 | AC | 15 ms
8,016 KB |
testcase_02 | AC | 16 ms
8,068 KB |
testcase_03 | AC | 15 ms
8,184 KB |
testcase_04 | AC | 15 ms
8,088 KB |
testcase_05 | AC | 16 ms
8,060 KB |
testcase_06 | AC | 16 ms
8,096 KB |
testcase_07 | AC | 15 ms
8,064 KB |
testcase_08 | AC | 16 ms
8,036 KB |
testcase_09 | AC | 15 ms
8,072 KB |
testcase_10 | AC | 15 ms
8,100 KB |
testcase_11 | AC | 16 ms
8,088 KB |
testcase_12 | AC | 16 ms
8,204 KB |
testcase_13 | AC | 16 ms
8,012 KB |
testcase_14 | AC | 16 ms
8,220 KB |
testcase_15 | AC | 16 ms
8,092 KB |
testcase_16 | AC | 16 ms
8,184 KB |
testcase_17 | AC | 16 ms
8,060 KB |
testcase_18 | AC | 16 ms
8,016 KB |
testcase_19 | AC | 16 ms
8,184 KB |
testcase_20 | AC | 16 ms
8,120 KB |
testcase_21 | AC | 16 ms
8,036 KB |
testcase_22 | AC | 17 ms
8,172 KB |
testcase_23 | AC | 17 ms
8,132 KB |
testcase_24 | AC | 16 ms
8,092 KB |
testcase_25 | AC | 16 ms
8,224 KB |
testcase_26 | AC | 16 ms
8,124 KB |
testcase_27 | AC | 17 ms
8,092 KB |
testcase_28 | AC | 17 ms
8,208 KB |
testcase_29 | AC | 18 ms
8,076 KB |
ソースコード
n = int(input()) T = [[0] * n for i in range(n)] i, j = 0, 0 k = 1 d = (0, 1) while True: T[i][j] = k if k == n ** 2: break if d == (0, 1): for dx, dy in [(0, 1), (1, 0), (0, -1), (-1, 0)]: nx, ny = i + dx, j + dy if 0 <= nx < n and 0 <= ny < n and T[nx][ny] == 0: i, j = nx, ny d = (dx, dy) k += 1 break elif d == (1, 0): for dx, dy in [(1, 0), (0, -1), (-1, 0),(0, 1)]: nx, ny = i + dx, j + dy if 0 <= nx < n and 0 <= ny < n and T[nx][ny] == 0: i, j = nx, ny d = (dx, dy) k += 1 break elif d == (0, -1): for dx, dy in [(0, -1), (-1, 0),(0, 1), (1, 0)]: nx, ny = i + dx, j + dy if 0 <= nx < n and 0 <= ny < n and T[nx][ny] == 0: i, j = nx, ny d = (dx, dy) k += 1 break else: for dx, dy in [(-1, 0),(0, 1), (1, 0), (0, -1)]: nx, ny = i + dx, j + dy if 0 <= nx < n and 0 <= ny < n and T[nx][ny] == 0: i, j = nx, ny d = (dx, dy) k += 1 break S = [[""] * n for i in range(n)] for i in range(n): for j in range(n): s = str(T[i][j]) S[i][j] = (3 - len(s)) * "0" + s for i in range(n): print(" ".join(map(str, S[i])))