結果
問題 | No.909 たぴの配置 |
ユーザー | McGregorsh |
提出日時 | 2022-07-05 22:46:41 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 344 ms / 3,000 ms |
コード長 | 1,619 bytes |
コンパイル時間 | 506 ms |
コンパイル使用メモリ | 86,976 KB |
実行使用メモリ | 131,224 KB |
最終ジャッジ日時 | 2023-08-22 13:12:42 |
合計ジャッジ時間 | 8,368 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 229 ms
92,460 KB |
testcase_01 | AC | 227 ms
92,432 KB |
testcase_02 | AC | 233 ms
92,624 KB |
testcase_03 | AC | 232 ms
92,672 KB |
testcase_04 | AC | 229 ms
92,680 KB |
testcase_05 | AC | 334 ms
128,192 KB |
testcase_06 | AC | 334 ms
128,212 KB |
testcase_07 | AC | 329 ms
127,780 KB |
testcase_08 | AC | 333 ms
128,000 KB |
testcase_09 | AC | 333 ms
127,980 KB |
testcase_10 | AC | 328 ms
128,044 KB |
testcase_11 | AC | 327 ms
127,524 KB |
testcase_12 | AC | 344 ms
131,224 KB |
testcase_13 | AC | 339 ms
127,836 KB |
testcase_14 | AC | 321 ms
128,020 KB |
testcase_15 | AC | 315 ms
128,184 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 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()) x = i_list() y = i_list() cost = INF for i in range(n): cost = min(cost, x[i] + y[i]) print(cost) print(0) for i in range(n): if x[i] > cost + y[i]: print(cost + y[i]) else: print(x[i]) print(cost) if __name__ == '__main__': main()