結果

問題 No.401 数字の渦巻き
ユーザー McGregorshMcGregorsh
提出日時 2023-04-11 20:58:47
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 149 ms / 2,000 ms
コード長 2,598 bytes
コンパイル時間 241 ms
コンパイル使用メモリ 82,100 KB
実行使用メモリ 89,604 KB
最終ジャッジ日時 2024-10-07 15:38:01
合計ジャッジ時間 5,895 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 143 ms
88,900 KB
testcase_01 AC 141 ms
89,264 KB
testcase_02 AC 142 ms
89,320 KB
testcase_03 AC 144 ms
89,360 KB
testcase_04 AC 145 ms
89,532 KB
testcase_05 AC 145 ms
89,204 KB
testcase_06 AC 143 ms
89,388 KB
testcase_07 AC 147 ms
89,224 KB
testcase_08 AC 145 ms
89,200 KB
testcase_09 AC 143 ms
89,524 KB
testcase_10 AC 143 ms
89,220 KB
testcase_11 AC 141 ms
89,272 KB
testcase_12 AC 142 ms
89,412 KB
testcase_13 AC 142 ms
88,936 KB
testcase_14 AC 140 ms
89,208 KB
testcase_15 AC 142 ms
89,456 KB
testcase_16 AC 145 ms
89,300 KB
testcase_17 AC 141 ms
89,604 KB
testcase_18 AC 141 ms
89,308 KB
testcase_19 AC 142 ms
88,708 KB
testcase_20 AC 140 ms
89,240 KB
testcase_21 AC 143 ms
89,168 KB
testcase_22 AC 144 ms
89,320 KB
testcase_23 AC 143 ms
89,536 KB
testcase_24 AC 144 ms
89,172 KB
testcase_25 AC 144 ms
89,256 KB
testcase_26 AC 148 ms
89,268 KB
testcase_27 AC 145 ms
89,384 KB
testcase_28 AC 145 ms
89,520 KB
testcase_29 AC 149 ms
89,508 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys, re
from fractions import Fraction
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext, ROUND_HALF_UP
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def get_distance(x1, y1, x2, y2):
	  d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
	  return d
def rotate(table):
   	  n_fild = []
   	  for x in zip(*table[::-1]):
   	  	  n_fild.append(x)
   	  return n_fild
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
MOD = 10 ** 9 + 7
MOD2 = 998244353


def main():
   
   N = int(input())
   
   ans = [[-1] * N for i in range(N)]
   x = 0
   y = 0
   ans[x][y] = 1
   
   now = 2
   muki = 2
   while now <= N ** 2:
   	  if muki == 1:
   	  	  if x - 1 >= 0:
   	  	  	  if ans[x-1][y] == -1:
   	  	  	  	  ans[x-1][y] = now
   	  	  	  	  x -= 1
   	  	  	  	  now += 1
   	  	  	  else:
   	  	  	  	  muki = 2
   	  	  else:
   	  	  	  muki = 2
   	  elif muki == 2:
   	  	  if y + 1 < N:
   	  	  	  if ans[x][y+1] == -1:
   	  	  	  	  ans[x][y+1] = now
   	  	  	  	  y += 1
   	  	  	  	  now += 1
   	  	  	  else:
   	  	  	  	  muki = 3
   	  	  else:
   	  	  	  muki = 3
   	  elif muki == 3:
   	  	  if x + 1 < N:
   	  	  	  if ans[x+1][y] == -1:
   	  	  	  	  ans[x+1][y] = now
   	  	  	  	  x += 1
   	  	  	  	  now += 1
   	  	  	  else:
   	  	  	  	  muki = 4
   	  	  else:
   	  	  	  muki = 4
   	  elif muki == 4:
   	  	  if y - 1 >= 0:
   	  	  	  if ans[x][y-1] == -1:
   	  	  	  	  ans[x][y-1] = now
   	  	  	  	  y -= 1
   	  	  	  	  now += 1
   	  	  	  else:
   	  	  	  	  muki = 1
   	  	  else:
   	  	  	  muki = 1
   	  
   
   for i in range(N):
   	  base = []
   	  for j in range(N):
   	  	  p = str(ans[i][j]).zfill(3)
   	  	  base.append(p)
   	  print(*base)
   
   
if __name__ == '__main__':
    main()
0