結果
問題 | No.2244 Integer Complete |
ユーザー | shobonvip |
提出日時 | 2023-03-08 05:15:09 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 120 ms / 2,000 ms |
コード長 | 1,222 bytes |
コンパイル時間 | 163 ms |
コンパイル使用メモリ | 81,692 KB |
実行使用メモリ | 79,320 KB |
最終ジャッジ日時 | 2023-10-18 05:50:19 |
合計ジャッジ時間 | 5,567 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,772 KB |
testcase_01 | AC | 40 ms
53,472 KB |
testcase_02 | AC | 39 ms
53,772 KB |
testcase_03 | AC | 40 ms
53,772 KB |
testcase_04 | AC | 40 ms
53,772 KB |
testcase_05 | AC | 39 ms
53,772 KB |
testcase_06 | AC | 40 ms
53,772 KB |
testcase_07 | AC | 41 ms
53,772 KB |
testcase_08 | AC | 39 ms
53,772 KB |
testcase_09 | AC | 40 ms
53,772 KB |
testcase_10 | AC | 39 ms
53,772 KB |
testcase_11 | AC | 39 ms
53,772 KB |
testcase_12 | AC | 40 ms
53,772 KB |
testcase_13 | AC | 40 ms
53,472 KB |
testcase_14 | AC | 40 ms
53,472 KB |
testcase_15 | AC | 41 ms
53,772 KB |
testcase_16 | AC | 40 ms
53,772 KB |
testcase_17 | AC | 60 ms
75,980 KB |
testcase_18 | AC | 60 ms
75,980 KB |
testcase_19 | AC | 70 ms
78,412 KB |
testcase_20 | AC | 118 ms
76,464 KB |
testcase_21 | AC | 117 ms
77,664 KB |
testcase_22 | AC | 89 ms
72,884 KB |
testcase_23 | AC | 57 ms
68,688 KB |
testcase_24 | AC | 113 ms
73,148 KB |
testcase_25 | AC | 99 ms
73,148 KB |
testcase_26 | AC | 60 ms
72,192 KB |
testcase_27 | AC | 120 ms
79,320 KB |
testcase_28 | AC | 77 ms
78,508 KB |
testcase_29 | AC | 120 ms
79,320 KB |
testcase_30 | AC | 111 ms
78,896 KB |
testcase_31 | AC | 57 ms
70,736 KB |
testcase_32 | AC | 57 ms
68,688 KB |
testcase_33 | AC | 55 ms
64,592 KB |
testcase_34 | AC | 68 ms
70,832 KB |
testcase_35 | AC | 62 ms
72,172 KB |
testcase_36 | AC | 64 ms
71,280 KB |
testcase_37 | AC | 79 ms
73,424 KB |
testcase_38 | AC | 64 ms
72,200 KB |
testcase_39 | AC | 60 ms
72,168 KB |
testcase_40 | AC | 58 ms
70,736 KB |
testcase_41 | AC | 61 ms
72,896 KB |
testcase_42 | AC | 60 ms
72,884 KB |
testcase_43 | AC | 68 ms
74,948 KB |
testcase_44 | AC | 60 ms
72,168 KB |
testcase_45 | AC | 60 ms
72,168 KB |
testcase_46 | AC | 76 ms
74,320 KB |
testcase_47 | AC | 70 ms
74,312 KB |
testcase_48 | AC | 59 ms
72,156 KB |
testcase_49 | AC | 58 ms
72,136 KB |
testcase_50 | AC | 59 ms
72,156 KB |
testcase_51 | AC | 63 ms
75,324 KB |
testcase_52 | AC | 66 ms
77,356 KB |
testcase_53 | AC | 59 ms
73,980 KB |
testcase_54 | AC | 58 ms
73,980 KB |
testcase_55 | AC | 58 ms
66,640 KB |
testcase_56 | AC | 56 ms
66,640 KB |
testcase_57 | AC | 50 ms
62,512 KB |
testcase_58 | AC | 60 ms
71,280 KB |
testcase_59 | AC | 61 ms
71,828 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 x = bisect.bisect_right(a2, i) - 1 y = bisect.bisect_right(b2, j) - 1 if x < 0 or y < 0: continue #print(k, i, j, a[x], b[y]) if not a[x] ** 2 <= i < (a[x] + 1) ** 2: continue if not b[y] ** 2 <= j < (b[y] + 1) ** 2: continue mode = 1 break if not mode: break k += 1 print(k)