結果
問題 |
No.1929 Exponential Sequence
|
ユーザー |
![]() |
提出日時 | 2022-05-21 12:08:25 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,846 ms / 2,000 ms |
コード長 | 1,827 bytes |
コンパイル時間 | 396 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 135,868 KB |
最終ジャッジ日時 | 2024-09-20 11:27:03 |
合計ジャッジ時間 | 12,033 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 24 |
ソースコード
from bisect import bisect_left def acum(List):#累積和 rev = [0 for _ in range(len(List))] for i in range(len(List)): if i == 0: rev[i] = List[i] else: rev[i] = rev[i-1] + List[i] return rev from itertools import product n,S = map(int,input().split()) A = list(map(int,input().split())) if n >= 2: front = [] back = [] for a in A[:n//2]: front .append(a) for a in A[n//2:]: back.append(a) Plist = [] for Ks in product([i for i in range(1,31)],repeat = len(front)): P = 0 for l in range(len(front)): P += pow(front[l],Ks[l]) if P > S: break if P <= S: Plist.append(P) Qlist = [] for Ks in product([i for i in range(1,31)],repeat=len(back)): Q = 0 for l in range(len(back)): Q += pow(back[l],Ks[l]) if Q > S: break if Q <= S: Qlist.append(Q) Plist.sort() Qlist.sort() cntP = [0] * len(set(Plist)) cntQ = [0] * len(set(Qlist)) index = 0 qlist = sorted(list(set(Qlist))) plist = sorted(list(set(Plist))) for p in Plist: if plist[index] == p: cntP[index] += 1 else: index += 1 cntP[index] += 1 index = 0 for q in Qlist: if qlist[index] == q: cntQ[index] += 1 else: index += 1 cntQ[index] += 1 cum = acum(cntQ) ans = 0 for i,p in enumerate(plist): index = bisect_left(qlist,S-p+1) -1 if index == -1: continue ans += cntP[i] * cum[index] print(ans) else: for k in range(1,33): if pow(A[0],k) <= S: pass else: break print(k-1)