結果
問題 | No.1261 数字集め |
ユーザー | chineristAC |
提出日時 | 2020-10-16 23:04:30 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,190 bytes |
コンパイル時間 | 313 ms |
コンパイル使用メモリ | 86,996 KB |
実行使用メモリ | 451,028 KB |
最終ジャッジ日時 | 2023-09-28 09:57:10 |
合計ジャッジ時間 | 271,213 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 1,139 ms
209,972 KB |
testcase_02 | AC | 2,880 ms
333,128 KB |
testcase_03 | AC | 2,903 ms
334,736 KB |
testcase_04 | AC | 1,378 ms
262,108 KB |
testcase_05 | AC | 4,278 ms
449,900 KB |
testcase_06 | AC | 1,900 ms
293,628 KB |
testcase_07 | AC | 2,868 ms
327,584 KB |
testcase_08 | AC | 1,214 ms
240,104 KB |
testcase_09 | AC | 1,975 ms
310,340 KB |
testcase_10 | AC | 138 ms
83,584 KB |
testcase_11 | AC | 3,996 ms
420,892 KB |
testcase_12 | AC | 3,335 ms
371,192 KB |
testcase_13 | AC | 2,817 ms
330,644 KB |
testcase_14 | AC | 230 ms
95,608 KB |
testcase_15 | AC | 1,114 ms
220,000 KB |
testcase_16 | AC | 2,637 ms
327,196 KB |
testcase_17 | AC | 2,067 ms
317,912 KB |
testcase_18 | AC | 1,022 ms
222,840 KB |
testcase_19 | AC | 2,728 ms
335,460 KB |
testcase_20 | AC | 272 ms
99,504 KB |
testcase_21 | AC | 5,056 ms
441,584 KB |
testcase_22 | AC | 4,733 ms
442,104 KB |
testcase_23 | AC | 5,801 ms
443,140 KB |
testcase_24 | AC | 4,540 ms
442,996 KB |
testcase_25 | AC | 4,472 ms
442,372 KB |
testcase_26 | AC | 4,477 ms
442,308 KB |
testcase_27 | AC | 4,160 ms
442,384 KB |
testcase_28 | AC | 4,093 ms
442,420 KB |
testcase_29 | AC | 4,052 ms
442,968 KB |
testcase_30 | AC | 4,241 ms
442,764 KB |
testcase_31 | AC | 4,196 ms
442,252 KB |
testcase_32 | AC | 4,204 ms
442,580 KB |
testcase_33 | AC | 4,208 ms
442,192 KB |
testcase_34 | AC | 4,146 ms
441,892 KB |
testcase_35 | AC | 4,136 ms
442,292 KB |
testcase_36 | AC | 4,145 ms
443,348 KB |
testcase_37 | AC | 4,057 ms
441,084 KB |
testcase_38 | AC | 4,215 ms
441,648 KB |
testcase_39 | AC | 4,095 ms
441,840 KB |
testcase_40 | AC | 4,146 ms
441,188 KB |
testcase_41 | AC | 4,198 ms
441,540 KB |
testcase_42 | AC | 4,246 ms
441,528 KB |
testcase_43 | AC | 4,195 ms
442,096 KB |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | WA | - |
testcase_64 | WA | - |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | WA | - |
testcase_68 | WA | - |
testcase_69 | WA | - |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | WA | - |
testcase_76 | WA | - |
testcase_77 | WA | - |
testcase_78 | WA | - |
testcase_79 | WA | - |
testcase_80 | WA | - |
testcase_81 | WA | - |
testcase_82 | WA | - |
testcase_83 | WA | - |
testcase_84 | WA | - |
testcase_85 | WA | - |
testcase_86 | WA | - |
testcase_87 | WA | - |
testcase_88 | WA | - |
testcase_89 | WA | - |
testcase_90 | WA | - |
testcase_91 | WA | - |
testcase_92 | WA | - |
testcase_93 | WA | - |
ソースコード
import sys input = sys.stdin.readline N,M = map(int,input().split()) A = [0,0] + list(map(int,input().split())) lazy = [[] for i in range(N+1)] for i in range(2,N+1): for j in range(2,N//i+1): lazy[i*j].append(i) def calc(x,y,z=N): inv = (A[x]-A[y])*(A[y]-A[z])*(A[z]-A[x]) tmp = (A[z]-A[x]) * (pow(A[z]-1,M-1,mod) - pow(A[y]-1,M-1,mod)) tmp %= mod tmp += (A[y]-A[z]) * (pow(A[z]-1,M-1,mod) - pow(A[x]-1,M-1,mod)) tmp %= mod tmp = (tmp * pow(inv,mod-2,mod)) % mod return tmp div = [i for i in range(1,N+1) if N%i==0] res = 0 mod = 10**9+7 for d in div: if d!=1 and d!=N: for dd in lazy[d]: res += calc(dd,d) res %= mod lazy[d] = [] print(res) N_ok = [False for i in range(N+1)] for d in div: N_ok[d] = True lazy = [[] for i in range(N+1)] for _ in range(int(input())): x,y = map(int,input().split()) if y!=N: if N_ok[y]: res += calc(x,y) res %= mod else: lazy[y].append(x) else: y = x N_ok[y] = True for x in lazy[y]: res += calc(x,y) res %= mod lazy[y] = [] print(res)