結果
問題 | No.1860 Magnets |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 21:25:13 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 262 ms / 2,000 ms |
コード長 | 1,497 bytes |
コンパイル時間 | 1,710 ms |
コンパイル使用メモリ | 86,084 KB |
実行使用メモリ | 91,968 KB |
最終ジャッジ日時 | 2023-08-18 00:07:12 |
合計ジャッジ時間 | 10,319 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 252 ms
91,848 KB |
testcase_01 | AC | 245 ms
91,752 KB |
testcase_02 | AC | 251 ms
91,764 KB |
testcase_03 | AC | 241 ms
91,756 KB |
testcase_04 | AC | 255 ms
91,708 KB |
testcase_05 | AC | 242 ms
91,732 KB |
testcase_06 | AC | 253 ms
91,728 KB |
testcase_07 | AC | 238 ms
91,824 KB |
testcase_08 | AC | 255 ms
91,424 KB |
testcase_09 | AC | 241 ms
91,936 KB |
testcase_10 | AC | 254 ms
91,832 KB |
testcase_11 | AC | 239 ms
91,776 KB |
testcase_12 | AC | 255 ms
91,660 KB |
testcase_13 | AC | 243 ms
91,700 KB |
testcase_14 | AC | 255 ms
91,588 KB |
testcase_15 | AC | 240 ms
91,732 KB |
testcase_16 | AC | 256 ms
91,864 KB |
testcase_17 | AC | 240 ms
91,600 KB |
testcase_18 | AC | 262 ms
91,768 KB |
testcase_19 | AC | 244 ms
91,724 KB |
testcase_20 | AC | 239 ms
91,744 KB |
testcase_21 | AC | 240 ms
91,756 KB |
testcase_22 | AC | 240 ms
91,708 KB |
testcase_23 | AC | 244 ms
91,968 KB |
testcase_24 | AC | 236 ms
91,748 KB |
testcase_25 | AC | 237 ms
91,808 KB |
testcase_26 | AC | 236 ms
91,716 KB |
testcase_27 | AC | 236 ms
91,764 KB |
testcase_28 | AC | 242 ms
91,700 KB |
testcase_29 | AC | 240 ms
91,748 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(): A, B = i_map() if A + B == 0: print(0) exit() if A == B: print(A + B) else: print(max(A, B) * 2 - 1) if __name__ == '__main__': main()