結果
問題 | No.982 Add |
ユーザー | McGregorsh |
提出日時 | 2023-05-17 22:17:38 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 249 ms / 2,000 ms |
コード長 | 1,878 bytes |
コンパイル時間 | 337 ms |
コンパイル使用メモリ | 87,100 KB |
実行使用メモリ | 93,036 KB |
最終ジャッジ日時 | 2023-08-22 00:06:52 |
合計ジャッジ時間 | 8,478 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 243 ms
92,804 KB |
testcase_01 | AC | 240 ms
92,248 KB |
testcase_02 | AC | 249 ms
92,696 KB |
testcase_03 | AC | 245 ms
92,680 KB |
testcase_04 | AC | 246 ms
92,220 KB |
testcase_05 | AC | 245 ms
92,884 KB |
testcase_06 | AC | 245 ms
92,984 KB |
testcase_07 | AC | 243 ms
92,860 KB |
testcase_08 | AC | 243 ms
92,752 KB |
testcase_09 | AC | 241 ms
92,752 KB |
testcase_10 | AC | 243 ms
92,888 KB |
testcase_11 | AC | 243 ms
92,860 KB |
testcase_12 | AC | 243 ms
93,036 KB |
testcase_13 | AC | 246 ms
92,996 KB |
testcase_14 | AC | 245 ms
92,976 KB |
testcase_15 | AC | 245 ms
92,772 KB |
testcase_16 | AC | 243 ms
92,908 KB |
testcase_17 | AC | 244 ms
92,760 KB |
testcase_18 | AC | 239 ms
92,300 KB |
testcase_19 | AC | 237 ms
92,304 KB |
testcase_20 | AC | 232 ms
92,216 KB |
testcase_21 | AC | 238 ms
92,328 KB |
testcase_22 | AC | 235 ms
92,240 KB |
testcase_23 | AC | 237 ms
92,212 KB |
testcase_24 | AC | 243 ms
92,860 KB |
testcase_25 | AC | 249 ms
92,920 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 gcd(A, B) == 1: ans = [False] * 11000 que = deque() que.append(0) ans[0] = True while que: p = que.popleft() nxtp = p + A nxtpp = p + B if nxtp < 11000: if ans[nxtp] == False: ans[nxtp] = True que.append(nxtp) if nxtpp < 11000: if ans[nxtpp] == False: ans[nxtpp] = True que.append(nxtpp) print(11000 - sum(ans)) else: print(-1) if __name__ == '__main__': main()