結果
問題 | No.565 回転拡大 |
ユーザー | McGregorsh |
提出日時 | 2022-06-29 12:33:54 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 199 ms / 2,000 ms |
コード長 | 1,888 bytes |
コンパイル時間 | 2,203 ms |
コンパイル使用メモリ | 86,720 KB |
実行使用メモリ | 93,856 KB |
最終ジャッジ日時 | 2023-08-14 14:43:25 |
合計ジャッジ時間 | 10,623 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 195 ms
93,456 KB |
testcase_01 | AC | 190 ms
93,676 KB |
testcase_02 | AC | 189 ms
93,564 KB |
testcase_03 | AC | 189 ms
92,460 KB |
testcase_04 | AC | 187 ms
93,132 KB |
testcase_05 | AC | 190 ms
92,720 KB |
testcase_06 | AC | 195 ms
93,740 KB |
testcase_07 | AC | 188 ms
93,616 KB |
testcase_08 | AC | 195 ms
93,064 KB |
testcase_09 | AC | 186 ms
92,632 KB |
testcase_10 | AC | 189 ms
92,672 KB |
testcase_11 | AC | 192 ms
92,468 KB |
testcase_12 | AC | 199 ms
93,856 KB |
testcase_13 | AC | 192 ms
92,544 KB |
testcase_14 | AC | 192 ms
92,576 KB |
testcase_15 | AC | 192 ms
92,712 KB |
testcase_16 | AC | 187 ms
92,668 KB |
testcase_17 | AC | 187 ms
92,484 KB |
testcase_18 | AC | 185 ms
92,676 KB |
testcase_19 | AC | 188 ms
93,640 KB |
testcase_20 | AC | 190 ms
92,620 KB |
testcase_21 | AC | 185 ms
92,524 KB |
testcase_22 | AC | 195 ms
93,196 KB |
testcase_23 | AC | 186 ms
92,404 KB |
testcase_24 | AC | 191 ms
93,732 KB |
testcase_25 | AC | 196 ms
93,764 KB |
testcase_26 | AC | 188 ms
92,436 KB |
testcase_27 | AC | 187 ms
93,056 KB |
testcase_28 | AC | 190 ms
93,552 KB |
testcase_29 | AC | 189 ms
92,684 KB |
testcase_30 | AC | 194 ms
92,764 KB |
testcase_31 | AC | 187 ms
92,668 KB |
testcase_32 | AC | 185 ms
92,448 KB |
ソースコード
import sys, re 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 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): r, k = i_map() h, w = i_map() fild = [input() for i in range(h)] def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild if r == 90: fild = rotate(fild) elif r == 180: fild = rotate(fild) fild = rotate(fild) elif r == 270: fild = rotate(fild) fild = rotate(fild) fild = rotate(fild) ans = [[0] * (len(fild[0]) * k) for i in range(len(fild) * k)] for i in range(len(fild)): for j in range(len(fild[i])): for l in range(k): for m in range(k): ans[i*k+l][j*k+m] = fild[i][j] for i in ans: print(''.join(i)) if __name__ == '__main__': main()