結果
問題 | No.1289 RNG and OR |
ユーザー | vwxyz |
提出日時 | 2021-09-15 14:40:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 810 ms / 2,000 ms |
コード長 | 3,070 bytes |
コンパイル時間 | 484 ms |
コンパイル使用メモリ | 87,128 KB |
実行使用メモリ | 134,144 KB |
最終ジャッジ日時 | 2023-09-11 00:15:56 |
合計ジャッジ時間 | 10,761 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 308 ms
92,696 KB |
testcase_01 | AC | 302 ms
93,000 KB |
testcase_02 | AC | 292 ms
93,128 KB |
testcase_03 | AC | 304 ms
92,944 KB |
testcase_04 | AC | 289 ms
92,868 KB |
testcase_05 | AC | 289 ms
92,916 KB |
testcase_06 | AC | 293 ms
93,112 KB |
testcase_07 | AC | 293 ms
92,908 KB |
testcase_08 | AC | 294 ms
93,548 KB |
testcase_09 | AC | 302 ms
95,980 KB |
testcase_10 | AC | 315 ms
95,884 KB |
testcase_11 | AC | 323 ms
97,072 KB |
testcase_12 | AC | 338 ms
96,976 KB |
testcase_13 | AC | 346 ms
97,336 KB |
testcase_14 | AC | 335 ms
97,172 KB |
testcase_15 | AC | 344 ms
97,580 KB |
testcase_16 | AC | 354 ms
98,140 KB |
testcase_17 | AC | 377 ms
101,148 KB |
testcase_18 | AC | 440 ms
106,844 KB |
testcase_19 | AC | 540 ms
116,540 KB |
testcase_20 | AC | 810 ms
134,144 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 degrees, 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()) mod=998244353 MD=MOD(mod) A=list(map(int,readline().split())) for bit in range(N): for i in range(1<<N): if not i>>bit&1: A[i^1<<bit]+=A[i] inve=MD.Pow(A[-1],-1) for i in range(1<<N): A[i]*=inve A[i]%=mod ans=0 for i in range(1<<N): cnt=0 for bit in range(N): if not i>>bit&1: cnt+=1 if A[i]==1: ans+=1 else: if cnt%2==1: ans+=A[i]*MD.Pow(1-A[i],-1) else: ans-=A[i]*MD.Pow(1-A[i],-1) ans%=mod print(ans)