結果
問題 | No.208 王将 |
ユーザー | McGregorsh |
提出日時 | 2022-06-19 14:42:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 120 ms / 1,000 ms |
コード長 | 1,441 bytes |
コンパイル時間 | 323 ms |
コンパイル使用メモリ | 82,572 KB |
実行使用メモリ | 84,096 KB |
最終ジャッジ日時 | 2024-04-19 20:18:37 |
合計ジャッジ時間 | 4,058 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 111 ms
83,328 KB |
testcase_01 | AC | 115 ms
83,704 KB |
testcase_02 | AC | 118 ms
83,712 KB |
testcase_03 | AC | 112 ms
83,588 KB |
testcase_04 | AC | 112 ms
83,328 KB |
testcase_05 | AC | 112 ms
83,792 KB |
testcase_06 | AC | 114 ms
83,968 KB |
testcase_07 | AC | 114 ms
83,712 KB |
testcase_08 | AC | 115 ms
83,584 KB |
testcase_09 | AC | 113 ms
83,672 KB |
testcase_10 | AC | 112 ms
83,636 KB |
testcase_11 | AC | 112 ms
83,712 KB |
testcase_12 | AC | 111 ms
83,748 KB |
testcase_13 | AC | 113 ms
83,700 KB |
testcase_14 | AC | 111 ms
83,612 KB |
testcase_15 | AC | 111 ms
83,688 KB |
testcase_16 | AC | 113 ms
83,652 KB |
testcase_17 | AC | 110 ms
84,096 KB |
testcase_18 | AC | 115 ms
83,840 KB |
testcase_19 | AC | 113 ms
83,816 KB |
testcase_20 | AC | 112 ms
83,672 KB |
testcase_21 | AC | 112 ms
83,712 KB |
testcase_22 | AC | 112 ms
83,608 KB |
testcase_23 | AC | 120 ms
83,456 KB |
testcase_24 | AC | 120 ms
83,584 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): x, y = i_map() x1, y1 = i_map() min_num = min(x, y) max_num = max(x, y) if x1 < x and y1 < y: if x1 == y1 and x == y: print(min_num + (max_num - min_num)+1) exit() print(min_num + (max_num - min_num)) if __name__ == '__main__': main()