結果
問題 | No.131 マンハッタン距離 |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 12:46:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 254 ms / 5,000 ms |
コード長 | 1,615 bytes |
コンパイル時間 | 1,824 ms |
コンパイル使用メモリ | 86,500 KB |
実行使用メモリ | 92,400 KB |
最終ジャッジ日時 | 2023-08-20 16:03:41 |
合計ジャッジ時間 | 8,496 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 193 ms
92,260 KB |
testcase_01 | AC | 190 ms
91,912 KB |
testcase_02 | AC | 190 ms
92,192 KB |
testcase_03 | AC | 190 ms
92,268 KB |
testcase_04 | AC | 190 ms
92,168 KB |
testcase_05 | AC | 190 ms
92,200 KB |
testcase_06 | AC | 192 ms
92,040 KB |
testcase_07 | AC | 192 ms
92,172 KB |
testcase_08 | AC | 194 ms
92,140 KB |
testcase_09 | AC | 195 ms
92,028 KB |
testcase_10 | AC | 193 ms
92,120 KB |
testcase_11 | AC | 194 ms
92,400 KB |
testcase_12 | AC | 193 ms
92,296 KB |
testcase_13 | AC | 192 ms
92,180 KB |
testcase_14 | AC | 193 ms
92,072 KB |
testcase_15 | AC | 192 ms
91,968 KB |
testcase_16 | AC | 196 ms
92,184 KB |
testcase_17 | AC | 254 ms
92,188 KB |
testcase_18 | AC | 192 ms
92,168 KB |
testcase_19 | AC | 190 ms
92,228 KB |
testcase_20 | AC | 191 ms
92,396 KB |
testcase_21 | AC | 204 ms
92,180 KB |
testcase_22 | AC | 192 ms
92,116 KB |
testcase_23 | AC | 195 ms
92,140 KB |
testcase_24 | AC | 191 ms
92,176 KB |
testcase_25 | AC | 193 ms
92,180 KB |
testcase_26 | AC | 195 ms
92,192 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(): x, y, d = i_map() if d == 0: print(1) exit() if d > x + y: print(0) else: if d >= x: yy = d - x print(min(x+1, abs(y-yy)+1)) else: yy = 0 x = d print(min(x+1, abs(y-yy)+1)) if __name__ == '__main__': main()