結果
問題 | No.131 マンハッタン距離 |
ユーザー | McGregorsh |
提出日時 | 2023-05-15 12:11:18 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,600 bytes |
コンパイル時間 | 926 ms |
コンパイル使用メモリ | 86,884 KB |
実行使用メモリ | 92,580 KB |
最終ジャッジ日時 | 2023-08-20 15:40:45 |
合計ジャッジ時間 | 9,250 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 253 ms
92,108 KB |
testcase_01 | AC | 260 ms
92,164 KB |
testcase_02 | AC | 263 ms
92,292 KB |
testcase_03 | AC | 258 ms
92,372 KB |
testcase_04 | AC | 266 ms
92,272 KB |
testcase_05 | AC | 258 ms
92,204 KB |
testcase_06 | AC | 255 ms
92,108 KB |
testcase_07 | AC | 259 ms
92,180 KB |
testcase_08 | AC | 259 ms
92,228 KB |
testcase_09 | AC | 258 ms
92,360 KB |
testcase_10 | AC | 255 ms
92,244 KB |
testcase_11 | AC | 257 ms
92,316 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 258 ms
92,488 KB |
testcase_15 | AC | 255 ms
92,344 KB |
testcase_16 | AC | 254 ms
92,340 KB |
testcase_17 | WA | - |
testcase_18 | AC | 257 ms
92,184 KB |
testcase_19 | AC | 255 ms
92,404 KB |
testcase_20 | AC | 255 ms
92,264 KB |
testcase_21 | AC | 257 ms
92,104 KB |
testcase_22 | AC | 257 ms
92,156 KB |
testcase_23 | AC | 262 ms
92,352 KB |
testcase_24 | WA | - |
testcase_25 | AC | 255 ms
92,336 KB |
testcase_26 | AC | 253 ms
92,348 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 = d print(min(x+1, abs(y-yy)+1)) if __name__ == '__main__': main()