結果
問題 | No.243 出席番号(2) |
ユーザー | vwxyz |
提出日時 | 2021-09-02 19:31:44 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,952 bytes |
コンパイル時間 | 96 ms |
コンパイル使用メモリ | 13,056 KB |
実行使用メモリ | 24,704 KB |
最終ジャッジ日時 | 2024-11-30 08:18:28 |
合計ジャッジ時間 | 13,403 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
17,408 KB |
testcase_01 | AC | 39 ms
12,288 KB |
testcase_02 | AC | 38 ms
12,160 KB |
testcase_03 | AC | 66 ms
12,160 KB |
testcase_04 | AC | 42 ms
12,288 KB |
testcase_05 | AC | 41 ms
12,160 KB |
testcase_06 | AC | 41 ms
12,288 KB |
testcase_07 | WA | - |
testcase_08 | AC | 157 ms
12,544 KB |
testcase_09 | AC | 55 ms
12,288 KB |
testcase_10 | AC | 47 ms
12,416 KB |
testcase_11 | AC | 43 ms
12,544 KB |
testcase_12 | WA | - |
testcase_13 | AC | 293 ms
12,544 KB |
testcase_14 | AC | 63 ms
12,544 KB |
testcase_15 | AC | 48 ms
12,416 KB |
testcase_16 | AC | 41 ms
12,416 KB |
testcase_17 | WA | - |
testcase_18 | AC | 535 ms
12,672 KB |
testcase_19 | AC | 88 ms
12,544 KB |
testcase_20 | AC | 53 ms
12,416 KB |
testcase_21 | AC | 45 ms
12,672 KB |
testcase_22 | TLE | - |
testcase_23 | AC | 753 ms
12,928 KB |
testcase_24 | AC | 124 ms
12,800 KB |
testcase_25 | AC | 56 ms
12,800 KB |
testcase_26 | AC | 49 ms
12,672 KB |
testcase_27 | TLE | - |
testcase_28 | AC | 39 ms
12,288 KB |
testcase_29 | AC | 39 ms
12,032 KB |
testcase_30 | AC | 38 ms
12,160 KB |
testcase_31 | AC | 37 ms
12,032 KB |
testcase_32 | AC | 38 ms
24,704 KB |
ソースコード
import bisect import copy import decimal import fractions import functools import heapq import itertools import math import random import sys from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines 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): 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 N=int(readline()) A=[int(readline()) for i in range(N)] mod=10**9+7 C=Counter(A).values() dp=[0]*(len(C)+1) dp[0]=1 for c in C: prev=dp dp=[0]*(len(C)+1) dp[0]=1 for i in range(1,len(C)+1): dp[i]=prev[i]+prev[i-1]*c dp[i]%=mod MD=MOD(mod) MD.Build_Fact(N) ans=0 for i in range(len(C)+1): if i%2==0: ans+=dp[i]*MD.Fact(N-i) else: ans-=dp[i]*MD.Fact(N-i) ans%=mod print(ans)