結果
問題 | No.886 Direct |
ユーザー | vwxyz |
提出日時 | 2021-09-30 09:50:51 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 4,785 bytes |
コンパイル時間 | 236 ms |
コンパイル使用メモリ | 13,312 KB |
実行使用メモリ | 203,104 KB |
最終ジャッジ日時 | 2024-07-17 13:08:21 |
合計ジャッジ時間 | 7,760 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
18,588 KB |
testcase_01 | AC | 33 ms
11,520 KB |
testcase_02 | AC | 33 ms
11,520 KB |
testcase_03 | AC | 116 ms
13,312 KB |
testcase_04 | AC | 33 ms
11,392 KB |
testcase_05 | AC | 32 ms
11,520 KB |
testcase_06 | AC | 33 ms
11,392 KB |
testcase_07 | AC | 34 ms
11,520 KB |
testcase_08 | AC | 33 ms
11,520 KB |
testcase_09 | AC | 34 ms
11,392 KB |
testcase_10 | AC | 33 ms
11,520 KB |
testcase_11 | AC | 34 ms
11,392 KB |
testcase_12 | AC | 34 ms
11,392 KB |
testcase_13 | AC | 32 ms
11,520 KB |
testcase_14 | AC | 33 ms
11,392 KB |
testcase_15 | AC | 35 ms
11,392 KB |
testcase_16 | AC | 34 ms
11,392 KB |
testcase_17 | AC | 137 ms
13,824 KB |
testcase_18 | AC | 188 ms
14,592 KB |
testcase_19 | AC | 152 ms
13,824 KB |
testcase_20 | AC | 95 ms
12,672 KB |
testcase_21 | AC | 210 ms
15,488 KB |
testcase_22 | AC | 185 ms
14,592 KB |
testcase_23 | TLE | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
ソースコード
import math from collections import defaultdict class Prime: def __init__(self,N): assert N<=10**8 self.smallest_prime_factor=[None]*(N+1) for i in range(2,N+1,2): self.smallest_prime_factor[i]=2 n=int(N**.5)+1 for p in range(3,n,2): if self.smallest_prime_factor[p]==None: self.smallest_prime_factor[p]=p for i in range(p**2,N+1,2*p): if self.smallest_prime_factor[i]==None: self.smallest_prime_factor[i]=p for p in range(n,N+1): if self.smallest_prime_factor[p]==None: self.smallest_prime_factor[p]=p self.primes=[p for p in range(N+1) if p==self.smallest_prime_factor[p]] def Factorize(self,N): assert N>=1 factorize=defaultdict(int) if N<=len(self.smallest_prime_factor)-1: while N!=1: factorize[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] else: for p in self.primes: while N%p==0: N//=p factorize[p]+=1 if N<p*p: if N!=1: factorize[N]+=1 break if N<=len(self.smallest_prime_factor)-1: while N!=1: factorize[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] break else: if N!=1: factorize[N]+=1 return factorize def Divisors(self,N): assert N>0 divisors=[1] for p,e in self.Factorize(N).items(): A=[1] for _ in range(e): A.append(A[-1]*p) divisors=[i*j for i in divisors for j in A] return divisors def Is_Prime(self,N): return N==self.smallest_prime_factor[N] def Totient(self,N): for p in self.Factorize(N).keys(): N*=p-1 N//=p return N def Mebius(self,N): fact=self.Factorize(N) for e in fact.values(): if e>=2: return 0 else: if len(fact)%2==0: return 1 else: return -1 def Extended_Euclid(n,m): stack=[] while m: stack.append((n,m)) n,m=m,n%m if n>=0: x,y=1,0 else: x,y=-1,0 for i in range(len(stack)-1,-1,-1): n,m=stack[i] x,y=y,x-(n//m)*y return x,y class MOD: def __init__(self,p,e=1): self.p=p self.e=e self.mod=self.p**self.e def Pow(self,a,n): a%=self.mod if n>=0: return pow(a,n,self.mod) else: assert math.gcd(a,self.mod)==1 x=Extended_Euclid(a,self.mod)[0] return pow(x,-n,self.mod) def Build_Fact(self,N): assert N>=0 self.factorial=[1] self.cnt=[0]*(N+1) for i in range(1,N+1): ii=i self.cnt[i]=self.cnt[i-1] while ii%self.p==0: ii//=self.p self.cnt[i]+=1 self.factorial.append((self.factorial[-1]*ii)%self.mod) self.factorial_inve=[None]*(N+1) self.factorial_inve[-1]=self.Pow(self.factorial[-1],-1) for i in range(N-1,-1,-1): ii=i+1 while ii%self.p==0: ii//=self.p self.factorial_inve[i]=(self.factorial_inve[i+1]*ii)%self.mod def Fact(self,N): if N<0: return 0 return self.factorial[N]*pow(self.p,self.cnt[N],self.mod)%self.mod def Fact_Inve(self,N): if self.cnt[N]: return None return self.factorial_inve[N] def Comb(self,N,K,divisible_count=False): if K<0 or K>N: return 0 retu=self.factorial[N]*self.factorial_inve[K]*self.factorial_inve[N-K]%self.mod cnt=self.cnt[N]-self.cnt[N-K]-self.cnt[K] if divisible_count: return retu,cnt else: retu*=pow(self.p,cnt,self.mod) retu%=self.mod return retu H,W=map(int,input().split()) cnt=[0]*(max(H,W)+1) mod=10**9+7 MD=MOD(mod) MD.Build_Fact(max(H,W)+1) P=Prime(max(H,W)+1) for g in range(1,max(H,W)+1): n_H,c_H=divmod(H,g) n_W,c_W=divmod(W,g) cnt[g]=((MD.Comb(n_H,2)*(g-c_H)+MD.Comb(n_H+1,2)*c_H)*(MD.Comb(n_W,2)*(g-c_W)+MD.Comb(n_W+1,2)*c_W)*2%mod) cnt[g]+=H*(MD.Comb(n_W,2)*(g-c_W)+MD.Comb(n_W+1,2)*c_W)+W*(MD.Comb(n_H,2)*(g-c_H)+MD.Comb(n_H+1,2)*c_H) for p in P.primes: for g in range(p,max(H,W)+1,p): cnt[g//p]-=cnt[g] cnt[g//p]%=mod ans=cnt[1] print(ans)