結果
問題 | No.1532 Different Products |
ユーザー | PCTprobability |
提出日時 | 2021-05-02 17:13:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,370 ms / 4,000 ms |
コード長 | 1,996 bytes |
コンパイル時間 | 334 ms |
コンパイル使用メモリ | 82,604 KB |
実行使用メモリ | 257,408 KB |
最終ジャッジ日時 | 2024-04-18 11:40:08 |
合計ジャッジ時間 | 50,697 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
56,576 KB |
testcase_01 | AC | 282 ms
144,256 KB |
testcase_02 | AC | 48 ms
62,336 KB |
testcase_03 | AC | 45 ms
56,576 KB |
testcase_04 | AC | 43 ms
56,192 KB |
testcase_05 | AC | 44 ms
56,292 KB |
testcase_06 | AC | 60 ms
67,676 KB |
testcase_07 | AC | 63 ms
69,504 KB |
testcase_08 | AC | 68 ms
71,552 KB |
testcase_09 | AC | 168 ms
106,880 KB |
testcase_10 | AC | 355 ms
171,776 KB |
testcase_11 | AC | 297 ms
151,680 KB |
testcase_12 | AC | 734 ms
255,616 KB |
testcase_13 | AC | 526 ms
231,552 KB |
testcase_14 | AC | 1,175 ms
255,360 KB |
testcase_15 | AC | 163 ms
106,752 KB |
testcase_16 | AC | 322 ms
154,880 KB |
testcase_17 | AC | 334 ms
166,016 KB |
testcase_18 | AC | 306 ms
155,136 KB |
testcase_19 | AC | 711 ms
255,488 KB |
testcase_20 | AC | 1,178 ms
254,720 KB |
testcase_21 | AC | 424 ms
194,048 KB |
testcase_22 | AC | 491 ms
220,800 KB |
testcase_23 | AC | 387 ms
183,296 KB |
testcase_24 | AC | 1,109 ms
255,488 KB |
testcase_25 | AC | 639 ms
256,640 KB |
testcase_26 | AC | 141 ms
96,256 KB |
testcase_27 | AC | 562 ms
238,976 KB |
testcase_28 | AC | 449 ms
201,856 KB |
testcase_29 | AC | 365 ms
171,776 KB |
testcase_30 | AC | 711 ms
255,872 KB |
testcase_31 | AC | 719 ms
256,000 KB |
testcase_32 | AC | 848 ms
256,640 KB |
testcase_33 | AC | 647 ms
255,872 KB |
testcase_34 | AC | 1,031 ms
255,360 KB |
testcase_35 | AC | 847 ms
257,408 KB |
testcase_36 | AC | 1,013 ms
255,872 KB |
testcase_37 | AC | 187 ms
77,824 KB |
testcase_38 | AC | 1,074 ms
255,616 KB |
testcase_39 | AC | 959 ms
256,256 KB |
testcase_40 | AC | 979 ms
255,104 KB |
testcase_41 | AC | 1,328 ms
256,000 KB |
testcase_42 | AC | 1,225 ms
254,848 KB |
testcase_43 | AC | 1,257 ms
255,104 KB |
testcase_44 | AC | 1,338 ms
254,592 KB |
testcase_45 | AC | 1,347 ms
254,848 KB |
testcase_46 | AC | 1,311 ms
255,232 KB |
testcase_47 | AC | 1,364 ms
255,232 KB |
testcase_48 | AC | 1,350 ms
255,744 KB |
testcase_49 | AC | 1,356 ms
254,848 KB |
testcase_50 | AC | 1,342 ms
254,720 KB |
testcase_51 | AC | 1,355 ms
254,720 KB |
testcase_52 | AC | 1,326 ms
255,104 KB |
testcase_53 | AC | 1,353 ms
254,976 KB |
testcase_54 | AC | 1,342 ms
254,976 KB |
testcase_55 | AC | 1,345 ms
254,976 KB |
testcase_56 | AC | 1,307 ms
255,104 KB |
testcase_57 | AC | 1,313 ms
254,592 KB |
testcase_58 | AC | 1,336 ms
255,232 KB |
testcase_59 | AC | 1,292 ms
255,872 KB |
testcase_60 | AC | 1,370 ms
255,488 KB |
testcase_61 | AC | 45 ms
56,320 KB |
testcase_62 | AC | 44 ms
56,064 KB |
testcase_63 | AC | 1,355 ms
254,592 KB |
ソースコード
""" Dirichlet Product """ def mul(N,K,L,data_as,data_ab,data_bs,data_bb): data_rs = [0 for i in range(K+1)] data_rb = [0 for i in range(L+1)] for i in range(1,K+1): for j in range(1,K//i+1): data_rs[i*j] += data_as[i] * data_bs[j] data_as_cum = [data_as[i] for i in range(K+1)] data_bs_cum = [data_bs[i] for i in range(K+1)] for i in range(1,K+1): data_as_cum[i] += data_as_cum[i-1] data_bs_cum[i] += data_bs_cum[i-1] def cumA(i): if 1<=i<=L: return data_ab[i] else: return data_as_cum[(N//i)] def cumB(i): if 1<=i<=L: return data_bb[i] else: return data_bs_cum[(N//i)] for i in range(1,L+1): M = int((N//i)**.5) for j in range(1,M+1): data_rb[i] += data_as[j] * cumB(i*j) for j in range(1,M+1): data_rb[i] += data_bs[j] * (cumA(i*j)-cumA(N//M)) return data_rs,data_rb def single_mul(N,K,L,a,A,val): res = [a[i] for i in range(K+1)] Res = [A[i] for i in range(L+1)] for i in range(1,K+1): if i*val<=K: res[i*val] += a[i] cum = [a[i] for i in range(K+1)] for i in range(1,K+1): cum[i] += cum[i-1] def cumA(i): if 1<=i<=L: return A[i] else: return cum[N//i] for i in range(1,L+1): Res[i] += cumA(i*val) return res,Res import sys,random,bisect from collections import deque,defaultdict from heapq import heapify,heappop,heappush from itertools import permutations from math import gcd,log input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) _N,_K = mi() N = _K K = min(N,int(N**.5)+1) L = K res = [0 for i in range(K+1)] res[1] = 1 Res = [0 for i in range(L+1)] for i in range(1,L+1): Res[i] = 1 for i in range(1,_N+1): res,Res = single_mul(N,K,L,res,Res,i) if K==1 : print(1) else: print((Res[1]-1))