結果

問題 No.2008 Super Worker
ユーザー 👑 Kazun
提出日時 2022-04-27 01:24:20
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,348 ms / 2,000 ms
コード長 5,141 bytes
コンパイル時間 251 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 133,284 KB
最終ジャッジ日時 2024-06-28 07:34:12
合計ジャッジ時間 17,729 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from math import gcd
class Fraction():
reduction=0
__slots__=("a","b")
##
def __init__(self, Numerator=0, Denominator=1, reduction=True, expanded=False):
""".
Numerator:
Denominator: (!=0)
"""
assert Denominator or expanded,"0"
if Denominator<0:
Numerator*=-1
Denominator*=-1
self.a=Numerator
self.b=Denominator
if reduction:
g=gcd(Numerator, Denominator)
self.a=Numerator//g
self.b=Denominator//g
#
def __str__(self):
if self.b==1:
return str(self.a)
else:
return "{}/{}".format(self.a,self.b)
__repr__=__str__
#
def __add__(self,other):
if other.__class__==Fraction:
x=self.a*other.b+self.b*other.a
y=self.b*other.b
elif other.__class__==int:
x=self.a+self.b*other
y=self.b
else:
assert 0,""
return Fraction(x,y)
def __radd__(self,other):
return self+other
def __sub__(self,other):
if other.__class__==Fraction:
x=self.a*other.b-self.b*other.a
y=self.b*other.b
elif other.__class__==int:
x=self.a-self.b*other
y=self.b
else:
assert 0,""
return Fraction(x,y)
def __rsub__(self,other):
return -self+other
def __mul__(self,other):
if other.__class__==Fraction:
x=self.a*other.a
y=self.b*other.b
elif other.__class__==int:
x=self.a*other
y=self.b
else:
assert 0,""
return Fraction(x,y)
def __rmul__(self,other):
return self*other
def __floordiv__(self,other):
if other==Fraction():
raise ZeroDivisionError
H=self/other
return H.a//H.b
def __rfloordiv__(self,other):
if self==Fraction():
raise ZeroDivisionError
H=other/self
return H.a//H.b
def __truediv__(self,other):
assert other,"0"
if other.__class__==Fraction:
x=self.a*other.b
y=self.b*other.a
elif other.__class__==int:
x=self.a
y=self.b*other
else:
assert 0,""
return Fraction(x,y)
def __rtruediv__(self,other):
assert self,"0"
if other.__class__==Fraction:
x=other.a*self.b
y=other.b*self.a
elif other.__class__==int:
x=other*self.b
y=self.a
else:
assert 0,""
return Fraction(x,y)
def __pow__(self,m):
alpha,beta=self.a,self.b
if m<0:
alpha,beta=beta,alpha
m=-m
return Fraction(pow(alpha,m),pow(beta,m))
#
def __floor__(self):
return self.a//self.b
def __ceil__(self):
return (self.a+self.b-1)//self.b
#
def __bool__(self):
return bool(self.a)
#
def __eq__(self,other):
if other.__class__==Fraction:
return self.a*other.b==self.b*other.a
elif other.__class__==int:
return self.a==self.b*other
else:
assert 0,""
def __nq__(self,other):
return not(self==other)
def __lt__(self,other):
return self<=other and self!=other
def __le__(self,other):
if other.__class__==Fraction:
return self.a*other.b<=self.b*other.a
elif other.__class__==int:
return self.a<=self.b*other
else:
assert 0,""
def __gt__(self,other):
return other<=self and other!=self
def __ge__(self,other):
return other<=self
#
def __float__(self):
return self.a/self.b
def sign(self):
s=self.a*self.b
if s>0:return 1
elif s==0:return 0
else:return -1
#
def __pos__(self):
return self
def __neg__(self):
return Fraction(-self.a,self.b)
def __abs__(self):
if self.a>0:
return self
else:
return -self
#
def is_unit(self):
return self.a==1
def __hash__(self):
return hash(10**9*self.a+self.b)
#==================================================
from operator import itemgetter
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
W=[(i,Fraction(b-1,a,False)) for i,(a,b) in enumerate(zip(A,B))]
W.sort(key=itemgetter(1),reverse=True)
Ans=0; Mod=10**9+7
Level=1;
for i,_ in W:
Ans+=A[i]*Level; Ans%=Mod
Level*=B[i]; Level%=Mod
print(Ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0