結果
問題 | No.1130 Grid Numbers |
ユーザー | McGregorsh |
提出日時 | 2023-05-04 12:34:28 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 166 ms / 2,000 ms |
コード長 | 1,668 bytes |
コンパイル時間 | 1,287 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 89,600 KB |
最終ジャッジ日時 | 2024-11-22 05:52:40 |
合計ジャッジ時間 | 3,054 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 160 ms
89,344 KB |
testcase_01 | AC | 159 ms
89,088 KB |
testcase_02 | AC | 164 ms
89,472 KB |
testcase_03 | AC | 161 ms
89,472 KB |
testcase_04 | AC | 160 ms
89,088 KB |
testcase_05 | AC | 161 ms
89,088 KB |
testcase_06 | AC | 160 ms
89,344 KB |
testcase_07 | AC | 160 ms
89,216 KB |
testcase_08 | AC | 161 ms
89,472 KB |
testcase_09 | AC | 161 ms
88,960 KB |
testcase_10 | AC | 166 ms
89,600 KB |
testcase_11 | AC | 164 ms
89,088 KB |
ソースコード
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(): H, W = i_map() nums = [] for i in range(H): S = i_list() for j in range(W): nums.append(S[j]) nums.sort() ans = [[0] * W for i in range(H)] for i in range(len(nums)): x, y = i // W, i % W ans[x][y] = nums[i] for i in range(H): print(*ans[i]) if __name__ == '__main__': main()