結果
問題 | No.2500 Products in a Range |
ユーザー | mkawa2 |
提出日時 | 2023-10-13 22:09:32 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,728 bytes |
コンパイル時間 | 270 ms |
コンパイル使用メモリ | 86,900 KB |
実行使用メモリ | 76,760 KB |
最終ジャッジ日時 | 2023-10-13 22:09:40 |
合計ジャッジ時間 | 7,111 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
71,236 KB |
testcase_01 | AC | 73 ms
71,516 KB |
testcase_02 | AC | 71 ms
71,460 KB |
testcase_03 | AC | 69 ms
71,628 KB |
testcase_04 | AC | 70 ms
71,472 KB |
testcase_05 | AC | 71 ms
71,268 KB |
testcase_06 | AC | 72 ms
71,400 KB |
testcase_07 | AC | 79 ms
76,376 KB |
testcase_08 | AC | 80 ms
76,520 KB |
testcase_09 | AC | 71 ms
71,264 KB |
testcase_10 | AC | 81 ms
76,412 KB |
testcase_11 | AC | 80 ms
76,568 KB |
testcase_12 | AC | 81 ms
76,608 KB |
testcase_13 | AC | 71 ms
71,268 KB |
testcase_14 | AC | 81 ms
76,420 KB |
testcase_15 | AC | 72 ms
71,360 KB |
testcase_16 | AC | 78 ms
76,424 KB |
testcase_17 | AC | 78 ms
76,652 KB |
testcase_18 | AC | 80 ms
76,588 KB |
testcase_19 | AC | 79 ms
76,608 KB |
testcase_20 | AC | 82 ms
76,608 KB |
testcase_21 | AC | 76 ms
76,520 KB |
testcase_22 | AC | 81 ms
76,604 KB |
testcase_23 | AC | 80 ms
76,608 KB |
testcase_24 | AC | 81 ms
76,608 KB |
testcase_25 | AC | 80 ms
76,564 KB |
testcase_26 | AC | 80 ms
76,388 KB |
testcase_27 | AC | 80 ms
76,380 KB |
testcase_28 | AC | 103 ms
76,604 KB |
testcase_29 | AC | 81 ms
76,396 KB |
testcase_30 | AC | 78 ms
76,632 KB |
testcase_31 | WA | - |
testcase_32 | AC | 71 ms
71,220 KB |
testcase_33 | AC | 79 ms
76,460 KB |
testcase_34 | AC | 81 ms
76,560 KB |
testcase_35 | AC | 69 ms
71,432 KB |
testcase_36 | AC | 71 ms
71,292 KB |
testcase_37 | AC | 72 ms
71,452 KB |
testcase_38 | AC | 70 ms
71,288 KB |
testcase_39 | AC | 70 ms
71,536 KB |
testcase_40 | AC | 71 ms
71,360 KB |
testcase_41 | AC | 72 ms
71,368 KB |
testcase_42 | AC | 70 ms
71,508 KB |
testcase_43 | AC | 71 ms
71,568 KB |
testcase_44 | AC | 77 ms
76,120 KB |
testcase_45 | AC | 70 ms
71,324 KB |
testcase_46 | AC | 76 ms
76,208 KB |
testcase_47 | AC | 81 ms
76,552 KB |
testcase_48 | AC | 73 ms
75,792 KB |
testcase_49 | WA | - |
testcase_50 | AC | 79 ms
76,548 KB |
testcase_51 | AC | 77 ms
76,760 KB |
testcase_52 | AC | 77 ms
76,584 KB |
testcase_53 | AC | 76 ms
76,512 KB |
testcase_54 | AC | 70 ms
71,396 KB |
testcase_55 | AC | 78 ms
76,372 KB |
testcase_56 | AC | 76 ms
76,492 KB |
testcase_57 | AC | 76 ms
76,636 KB |
testcase_58 | AC | 76 ms
76,508 KB |
testcase_59 | AC | 79 ms
76,336 KB |
testcase_60 | AC | 72 ms
71,408 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = -1-(-1 << 31) inf = -1-(-1 << 63) # md = 10**9+7 md = 998244353 def f(pos): arr = [0]*z+pos if not arr: return 0 n = len(arr) i = 0 while i+1 < n and arr[i]*arr[i+1] < l: i += 1 j = n-1 while j-1 >= 0 and arr[j]*arr[j-1] > r: j -= 1 return max(j-i+1, 1) n, l, r = LI() aa = LI() pos = [] neg = [] z = 0 for a in aa: if a < 0: neg.append(a) elif a > 0: pos.append(a) else: z += 1 pos.sort() neg.sort(reverse=True) # pos[2,3,5,6] # neg[-1,-2,-4,-5,-7] if r < 0: for a in pos: for b in neg: if l <= a*b <= r: print(2) exit() ans = 1 elif l >= 0 or not neg or not pos: ans = max(f(pos), f(neg)) else: n, m = len(pos), len(neg) j = m-1 ans = max(f(pos), f(neg)) for i in range(n): if i and pos[i-1]*pos[i] > r: break while j-1 >= 0 and neg[j]*neg[j-1] > r or j >= 0 and neg[j]*pos[i] < l: j -= 1 if j < 0: break ans = max(ans,i+1+j+1+z) print(ans)