結果
問題 | No.893 お客様を誘導せよ |
ユーザー | McGregorsh |
提出日時 | 2023-04-13 22:52:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 205 ms / 2,000 ms |
コード長 | 1,728 bytes |
コンパイル時間 | 172 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 100,816 KB |
最終ジャッジ日時 | 2024-04-18 01:10:15 |
合計ジャッジ時間 | 2,938 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 127 ms
89,724 KB |
testcase_01 | AC | 131 ms
89,600 KB |
testcase_02 | AC | 159 ms
91,128 KB |
testcase_03 | AC | 179 ms
94,436 KB |
testcase_04 | AC | 162 ms
92,900 KB |
testcase_05 | AC | 173 ms
94,464 KB |
testcase_06 | AC | 162 ms
92,628 KB |
testcase_07 | AC | 136 ms
89,600 KB |
testcase_08 | AC | 205 ms
100,816 KB |
testcase_09 | AC | 160 ms
90,624 KB |
testcase_10 | AC | 130 ms
89,580 KB |
testcase_11 | AC | 152 ms
90,848 KB |
testcase_12 | AC | 149 ms
90,840 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(): N = int(input()) nums = [] for i in range(N): A = i_list() base = [] for j in range(1, A[0]+1): base.append(A[j]) for k in range(120 - A[0]): base.append(0) nums.append(base) ans = [] for i in range(120): for j in range(N): if nums[j][i] != 0: ans.append(nums[j][i]) print(*ans) if __name__ == '__main__': main()