結果
問題 | No.2244 Integer Complete |
ユーザー | shobonvip |
提出日時 | 2023-03-08 05:25:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 159 ms / 2,000 ms |
コード長 | 1,196 bytes |
コンパイル時間 | 162 ms |
コンパイル使用メモリ | 81,684 KB |
実行使用メモリ | 81,764 KB |
最終ジャッジ日時 | 2023-10-18 05:50:13 |
合計ジャッジ時間 | 6,284 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
53,772 KB |
testcase_01 | AC | 39 ms
53,472 KB |
testcase_02 | AC | 40 ms
53,772 KB |
testcase_03 | AC | 39 ms
53,772 KB |
testcase_04 | AC | 40 ms
53,772 KB |
testcase_05 | AC | 40 ms
53,772 KB |
testcase_06 | AC | 39 ms
53,772 KB |
testcase_07 | AC | 40 ms
53,772 KB |
testcase_08 | AC | 39 ms
53,772 KB |
testcase_09 | AC | 39 ms
53,772 KB |
testcase_10 | AC | 40 ms
53,772 KB |
testcase_11 | AC | 40 ms
53,772 KB |
testcase_12 | AC | 39 ms
53,772 KB |
testcase_13 | AC | 39 ms
53,472 KB |
testcase_14 | AC | 39 ms
53,472 KB |
testcase_15 | AC | 39 ms
53,772 KB |
testcase_16 | AC | 39 ms
53,772 KB |
testcase_17 | AC | 59 ms
75,980 KB |
testcase_18 | AC | 59 ms
75,980 KB |
testcase_19 | AC | 81 ms
80,172 KB |
testcase_20 | AC | 143 ms
77,536 KB |
testcase_21 | AC | 151 ms
80,476 KB |
testcase_22 | AC | 114 ms
76,620 KB |
testcase_23 | AC | 63 ms
70,784 KB |
testcase_24 | AC | 138 ms
76,584 KB |
testcase_25 | AC | 125 ms
76,804 KB |
testcase_26 | AC | 71 ms
75,764 KB |
testcase_27 | AC | 159 ms
81,608 KB |
testcase_28 | AC | 99 ms
81,744 KB |
testcase_29 | AC | 159 ms
81,604 KB |
testcase_30 | AC | 143 ms
81,764 KB |
testcase_31 | AC | 63 ms
72,832 KB |
testcase_32 | AC | 63 ms
72,828 KB |
testcase_33 | AC | 65 ms
69,292 KB |
testcase_34 | AC | 89 ms
76,620 KB |
testcase_35 | AC | 72 ms
75,660 KB |
testcase_36 | AC | 84 ms
76,744 KB |
testcase_37 | AC | 92 ms
75,636 KB |
testcase_38 | AC | 84 ms
77,692 KB |
testcase_39 | AC | 67 ms
74,780 KB |
testcase_40 | AC | 65 ms
73,240 KB |
testcase_41 | AC | 69 ms
75,324 KB |
testcase_42 | AC | 77 ms
78,392 KB |
testcase_43 | AC | 91 ms
78,392 KB |
testcase_44 | AC | 77 ms
77,428 KB |
testcase_45 | AC | 82 ms
77,428 KB |
testcase_46 | AC | 104 ms
77,428 KB |
testcase_47 | AC | 93 ms
77,428 KB |
testcase_48 | AC | 67 ms
74,260 KB |
testcase_49 | AC | 63 ms
74,236 KB |
testcase_50 | AC | 66 ms
74,260 KB |
testcase_51 | AC | 71 ms
78,128 KB |
testcase_52 | AC | 85 ms
80,472 KB |
testcase_53 | AC | 65 ms
76,080 KB |
testcase_54 | AC | 64 ms
76,080 KB |
testcase_55 | AC | 70 ms
73,404 KB |
testcase_56 | AC | 68 ms
73,400 KB |
testcase_57 | AC | 58 ms
66,660 KB |
testcase_58 | AC | 80 ms
76,744 KB |
testcase_59 | AC | 81 ms
77,336 KB |
ソースコード
import bisect def makediv(n): lower_divisors , upper_divisors = [], [] i = 1 while i*i <= n: if n % i == 0: lower_divisors.append(i) if i != n // i: upper_divisors.append(n//i) i += 1 return lower_divisors + upper_divisors[::-1] n, m = map(int,input().split()) a = list(map(int,input().split())) b = list(map(int,input().split())) assert 1 <= n <= 30000 assert 1 <= m <= 30000 for i in range(n): assert 1 <= a[i] <= 30000 for i in range(m): assert 1 <= b[i] <= 30000 for i in range(n-1): assert a[i] < a[i+1] for i in range(m-1): assert b[i] < b[i+1] a2 = [a[i] * a[i] for i in range(n)] b2 = [b[i] * b[i] for i in range(m)] if a[0] != 1 or b[0] != 1: print(1) exit() c = [0] * 40000 for i in range(n): c[a[i]] = 1 for i in range(m): c[b[i]] = 1 v = 0 for i in range(1, 40000): if c[i] == 0: v = i ** 2 break k = v while True: mode = 0 for i in makediv(k): j = k // i ar = 0 for x in range(n): if a[x] ** 2 <= i < (a[x] + 1) ** 2: ar = 1 break if ar == 0: continue ar = 0 for y in range(m): if b[y] ** 2 <= j < (b[y] + 1) ** 2: ar = 1 break if ar == 1: mode = 1 break if not mode: break k += 1 print(k)