結果

問題 No.694 square1001 and Permutation 3
ユーザー kohei2019
提出日時 2022-03-13 09:57:17
言語 PyPy3
(7.3.15)
結果
MLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,062 bytes
コンパイル時間 159 ms
コンパイル使用メモリ 82,736 KB
実行使用メモリ 273,864 KB
最終ジャッジ日時 2024-09-17 19:42:07
合計ジャッジ時間 12,016 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 10 MLE * 3
権限があれば一括ダウンロードができます

ソースコード

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

import math
class SegTree:
DEFAULT = {
'min': 1 << 60,
'max': -(1 << 60),
'sum': 0,
'prd': 1,
'gcd': 0,
'lmc': 1,
'^': 0,
'&': (1 << 60) - 1,
'|': 0,
}
FUNC = {
'min': min,
'max': max,
'sum': (lambda x, y: x + y),
'prd': (lambda x, y: x * y),
'gcd': math.gcd,
'lmc': (lambda x, y: (x * y) // math.gcd(x, y)),
'^': (lambda x, y: x ^ y),
'&': (lambda x, y: x & y),
'|': (lambda x, y: x | y),
}
def __init__(self, ls, mode='min', func=None, default=None):
"""
ls, mode (min,max,sum,prd(product),gcd,lmc,^,&,|)
func,default
"""
N = len(ls)
if default == None:
self.default = self.DEFAULT[mode]
else:
self.default = default
if func == None:
self.func = self.FUNC[mode]
else:
self.func = func
self.N = N
self.K = (N - 1).bit_length()
self.N2 = 1 << self.K
self.dat = [self.default] * (2**(self.K + 1))
for i in range(self.N): #
self.dat[self.N2 + i] = ls[i]
self.build()
def build(self):
for j in range(self.N2 - 1, -1, -1):
self.dat[j] = self.func(self.dat[j << 1], self.dat[j << 1 | 1]) #
def leafvalue(self, x): # x
return self.dat[x + self.N2]
def update(self, x, y): # index(x)y
i = x + self.N2
self.dat[i] = y
while i > 0: #
i >>= 1
self.dat[i] = self.func(self.dat[i << 1], self.dat[i << 1 | 1])
return
def query(self, L, R): # [L,R)
L += self.N2
R += self.N2
vL = self.default
vR = self.default
while L < R:
if L & 1:
vL = self.func(vL, self.dat[L])
L += 1
if R & 1:
R -= 1
vR = self.func(self.dat[R], vR)
L >>= 1
R >>= 1
return self.func(vL, vR)
def __iter__(self):
for i in range(self.N):
yield self[i]
def __getitem__(self, x): return self.leafvalue(x)
def __setitem__(self, x, val): return self.update(x, val)
import collections
N = int(input())
ls = [int(input()) for i in range(N)]
ls2 = ls[:]
ind = 0
dc = dict()
ls2.sort()
for i in range(N):
if ls2[i] in dc:
continue
dc[ls2[i]] = ind
ind +=1
cnter = collections.Counter(ls)
l = [0]*(len(dc))
for key,val in dc.items():
l[val] += cnter[key]
SG = SegTree(l,mode='sum')
ans = 0
for i in range(N):
m = SG.query(0, dc[ls[i]])
ans += m
SG[dc[ls[i]]] -= 1
print(ans)
l = l + [0]
SG = SegTree(l,mode='sum')
for i in range(N-1):
f = SG.query(0, dc[ls[i]])
r = SG.query(dc[ls[i]]+1,len(dc)+1)
ans += r
ans -= f
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0