#878463 (PyPy3) No.2304 Distinct Elements

提出ソース

結果

問題	No.2304 Distinct Elements
ユーザー	vwxyz
提出日時	2023-06-06 19:32:14
言語	PyPy3 (7.3.15)
結果	AC
実行時間	223 ms / 3,000 ms
コード長	6,837 bytes
コンパイル時間	169 ms
コンパイル使用メモリ	82,304 KB
実行使用メモリ	107,648 KB
最終ジャッジ日時	2024-06-09 06:17:22
合計ジャッジ時間	10,280 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	35 ms 54,016 KB
testcase_01	AC	35 ms 54,144 KB
testcase_02	AC	36 ms 54,144 KB
testcase_03	AC	34 ms 53,632 KB
testcase_04	AC	223 ms 106,244 KB
testcase_05	AC	217 ms 106,992 KB
testcase_06	AC	210 ms 106,424 KB
testcase_07	AC	216 ms 106,624 KB
testcase_08	AC	217 ms 106,496 KB
testcase_09	AC	164 ms 102,824 KB
testcase_10	AC	163 ms 103,076 KB
testcase_11	AC	166 ms 102,380 KB
testcase_12	AC	162 ms 102,120 KB
testcase_13	AC	167 ms 103,280 KB
testcase_14	AC	46 ms 61,568 KB
testcase_15	AC	45 ms 62,080 KB
testcase_16	AC	42 ms 61,696 KB
testcase_17	AC	39 ms 59,648 KB
testcase_18	AC	41 ms 60,416 KB
testcase_19	AC	38 ms 54,272 KB
testcase_20	AC	35 ms 54,016 KB
testcase_21	AC	34 ms 54,272 KB
testcase_22	AC	35 ms 53,888 KB
testcase_23	AC	33 ms 53,760 KB
testcase_24	AC	36 ms 55,024 KB
testcase_25	AC	36 ms 54,400 KB
testcase_26	AC	38 ms 54,656 KB
testcase_27	AC	36 ms 55,040 KB
testcase_28	AC	35 ms 54,144 KB
testcase_29	AC	149 ms 99,944 KB
testcase_30	AC	81 ms 76,464 KB
testcase_31	AC	134 ms 94,844 KB
testcase_32	AC	136 ms 101,248 KB
testcase_33	AC	62 ms 76,160 KB
testcase_34	AC	133 ms 100,872 KB
testcase_35	AC	145 ms 100,092 KB
testcase_36	AC	60 ms 76,032 KB
testcase_37	AC	108 ms 83,712 KB
testcase_38	AC	196 ms 107,008 KB
testcase_39	AC	198 ms 106,624 KB
testcase_40	AC	172 ms 96,000 KB
testcase_41	AC	137 ms 84,864 KB
testcase_42	AC	165 ms 104,860 KB
testcase_43	AC	186 ms 103,760 KB
testcase_44	AC	129 ms 98,816 KB
testcase_45	AC	147 ms 94,292 KB
testcase_46	AC	124 ms 88,888 KB
testcase_47	AC	45 ms 61,824 KB
testcase_48	AC	42 ms 62,336 KB
testcase_49	AC	212 ms 107,648 KB
testcase_50	AC	219 ms 107,008 KB
testcase_51	AC	210 ms 106,980 KB
testcase_52	AC	211 ms 105,472 KB
testcase_53	AC	138 ms 106,004 KB
testcase_54	AC	204 ms 104,860 KB
testcase_55	AC	217 ms 104,576 KB
testcase_56	AC	196 ms 104,932 KB
testcase_57	AC	191 ms 106,880 KB
testcase_58	AC	184 ms 106,172 KB
testcase_59	AC	211 ms 104,832 KB
testcase_60	AC	38 ms 54,144 KB
testcase_61	AC	35 ms 53,760 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import sys
readline=sys.stdin.readline
import heapq
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

class Slope_Trick:
    def __init__(self,L=False,R=False,median=False,label=False,f=None,f_inve=None,e=None):
        self.queueL=[]
        self.queueR=[]
        self.L=L
        self.R=R
        self.median=median
        if self.median:
            self.median_value=None
        self.label=label
        self.shiftL=0
        self.shiftR=0
        self.min_f=0
        if self.label:
            self.f=f
            self.f_inve=f_inve
            self.e=e
            self.labelL=self.e
            self.labelR=self.e

    def heappush(self,x):
        heappush(self.queueR,x-self.shiftR)
        if self.label:
            self.labelR=self.f(self.labelR,x)

    def heappop(self):
        x=heappop(self.queueR)+self.shiftR
        if self.label:
            self.labelR=self.f_inve(self.labelR,x)
        return x

    def heappushpop(self,x):
        y=heappushpop(self.queueR,x-self.shiftR)+self.shiftR
        if self.label:
            self.labelR=self.f(self.labelR,x)
            self.labelR=self.f_inve(self.labelR,y)
        return y

    def _heappush_max(self,x):
        _heappush_max(self.queueL,x-self.shiftL)
        if self.label:
            self.labelL=self.f(self.labelL,x)

    def _heappop_max(self):
        x=_heappop_max(self.queueL)+self.shiftL
        if self.label:
            self.labelL=self.f_inve(self.labelL,x)
        return x

    def _heappushpop_max(self,x):
        y=_heappushpop_max(self.queueL,x-self.shiftL)+self.shiftL
        if self.label:
            self.labelL=self.f(self.labelL,x)
            self.labelL=self.f_inve(self.labelL,y)
        return y

    def push_Left(self,x):
        if self.queueR:
            self.min_f+=max(x-(self.queueR[0]+self.shiftR),0)
        self._heappush_max(self.heappushpop(x))

    def push_Right(self,x):
        if self.queueL:
            self.min_f+=max((self.queueL[0]+self.shiftL)-x,0)
        self.heappush(self._heappushpop_max(x))

    def pop_Left(self):
        if self.queueL:
            retu=self._heappop_max()
            if self.queueR:
                self.min_f+=max(retu-(self.queueR[0]+self.shiftR),0)
        else:
            retu=None
        return retu

    def pop_Right(self):
        if self.queueR:
            retu=self.heappop()
            if self.queueL:
                self.min_f+=max((self.queueL[0]+self.shiftL)-retu,0)
        else:
            retu=None
        return retu

    def push(self,x):
        if self.L:
            if len(self.queueL)<self.L:
                self.push_Left(x)
            else:
                self.push_Right(x)
        if self.R:
            if len(self.queueR)<self.R:
                self.push_Right(x)
            else:
                self.push_Left(x)
        if self.median:
            if self.median_value==None:
                if self.queueL and x<self.queueL[0]:
                    self.median_value=self._heappushpop_max(x)
                elif self.queueR and self.queueR[0]<x:
                    self.median_value=self.heappushpop(x)
                else:
                    self.median_value=x
            else:
                if self.median_value<=x:
                    self._heappush_max(self.median_value)
                    self.heappush(x)
                else:
                    self._heappush_max(x)
                    self.heappush(self.median_value)
                self.median_value=None

    def pop(self):
        if self.L:
            if len(self.queueL)==self.L:
                retu=self._heappop_max()
                if self.queueR:
                    self._heappush_max(self.heappop())
            else:
                retu=None
        if self.R:
            if len(self.queueR)==self.R:
                retu=self.heappop()
                if self.queueL:
                    self.heappush(self._heappop_max())
            else:
                retu=None
        if self.median:
            if self.median_value==None:
                retu=(self.pop_Left(),self.pop_Right())
            else:
                retu=(self.median_value,None)
                self.median_value=None
        return retu

    def top(self):
        if self.L:
            if len(self.queueL)==self.L:
                retu=self.queueL[0]
            else:
                retu=None
        if self.R:
            if len(self.queueR)==self.R:
                retu=self.queueR[0]
            else:
                retu=None
        if self.median:
            if self.median_value==None:
                if self.queueL:
                    retu=(self.queueL[0],self.queueR[0])
                else:
                    retu=(None,None)
            else:
                retu=(self.median_value,None)
        return retu

    def top_Left(self):
        if self.queueL:
           return self.queueL[0]+self.shiftL
        else:
            return None

    def top_Right(self):
        if self.queueR:
           return self.queueR[0]+self.shiftR
        else:
            return None

    def Shift_Left(self,a):
        self.shiftL+=a

    def Shift_Right(self,a):
        self.shiftR+=a

    def Label_Left(self):
        return self.labelL

    def Label_Right(self):
        return self.labelR

    def Cumultive_min(self):
        self.queueR=[]

    def Cumultive_max(self):
        self.queueL=[]

    def __len__(self):
        retu=len(self.queueL)+len(self.queueR)
        if self.median and self.median_value!=None:
            retu+=1
        return retu

    def __call__(self,x):
        return sum(max((l+self.shiftL)-x,0) for l in self.queueL)+sum(max(x-(r+self.shiftR),0) for r in self.queueR)+self.min_f

    def __str__(self):
        if self.median:
            if self.median_value==None:
                return "["+", ".join(map(str,sorted([x+self.shiftL for x in self.queueL])))+"]+["+", ".join(map(str,sorted([x+self.shiftR for x in self.queueR])))+"]"
            else:
                return "["+", ".join(map(str,sorted([x+self.shiftL for x in self.queueL])))+"]+"+str(self.median_value)+"+["+", ".join(map(str,sorted([x+self.shiftR for x in self.queueR])))+"]"
        else:
            return "["+", ".join(map(str,sorted([x+self.shiftL for x in self.queueL])))+"]+["+", ".join(map(str,sorted([x+self.shiftR for x in self.queueR])))+"]"

N=int(readline())
A=sorted(list(map(int,readline().split())))
ST=Slope_Trick()
for a in A:
    ST.Cumultive_min()
    ST.Shift_Left(1)
    ST.push_Right(a)
    ST.push_Left(a)
ans=ST.min_f
print(ans)

yukicoder

結果

テストケース

ソースコード