結果

問題 No.5010 Better Mo's Algorithm is Needed!! (Unweighted)
ユーザー titiatitia
提出日時 2022-12-17 03:59:46
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 4,966 ms / 5,000 ms
コード長 2,091 bytes
コンパイル時間 860 ms
実行使用メモリ 269,696 KB
スコア 16,501,831,353
最終ジャッジ日時 2022-12-17 04:10:29
合計ジャッジ時間 632,030 ms
ジャッジサーバーID
(参考情報)
judge16 / judge13
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4,966 ms
263,376 KB
testcase_01 AC 4,861 ms
262,200 KB
testcase_02 AC 4,855 ms
263,860 KB
testcase_03 AC 4,863 ms
266,556 KB
testcase_04 AC 4,863 ms
263,720 KB
testcase_05 AC 4,861 ms
264,064 KB
testcase_06 AC 4,858 ms
265,448 KB
testcase_07 AC 4,860 ms
263,612 KB
testcase_08 AC 4,864 ms
260,800 KB
testcase_09 AC 4,858 ms
262,328 KB
testcase_10 AC 4,858 ms
262,320 KB
testcase_11 AC 4,863 ms
263,792 KB
testcase_12 AC 4,856 ms
262,020 KB
testcase_13 AC 4,861 ms
262,348 KB
testcase_14 AC 4,858 ms
263,504 KB
testcase_15 AC 4,853 ms
265,344 KB
testcase_16 AC 4,856 ms
263,624 KB
testcase_17 AC 4,852 ms
262,844 KB
testcase_18 AC 4,857 ms
265,416 KB
testcase_19 AC 4,858 ms
263,996 KB
testcase_20 AC 4,859 ms
264,448 KB
testcase_21 AC 4,856 ms
266,272 KB
testcase_22 AC 4,858 ms
262,740 KB
testcase_23 AC 4,857 ms
264,880 KB
testcase_24 AC 4,852 ms
266,372 KB
testcase_25 AC 4,862 ms
264,620 KB
testcase_26 AC 4,854 ms
266,428 KB
testcase_27 AC 4,853 ms
267,116 KB
testcase_28 AC 4,852 ms
264,344 KB
testcase_29 AC 4,854 ms
266,904 KB
testcase_30 AC 4,856 ms
261,096 KB
testcase_31 AC 4,857 ms
262,828 KB
testcase_32 AC 4,853 ms
263,876 KB
testcase_33 AC 4,863 ms
266,808 KB
testcase_34 AC 4,860 ms
263,176 KB
testcase_35 AC 4,852 ms
265,812 KB
testcase_36 AC 4,858 ms
265,080 KB
testcase_37 AC 4,850 ms
263,336 KB
testcase_38 AC 4,861 ms
264,420 KB
testcase_39 AC 4,857 ms
265,764 KB
testcase_40 AC 4,858 ms
265,184 KB
testcase_41 AC 4,859 ms
264,148 KB
testcase_42 AC 4,857 ms
266,636 KB
testcase_43 AC 4,875 ms
265,188 KB
testcase_44 AC 4,851 ms
262,500 KB
testcase_45 AC 4,857 ms
267,064 KB
testcase_46 AC 4,854 ms
265,252 KB
testcase_47 AC 4,854 ms
265,004 KB
testcase_48 AC 4,851 ms
266,596 KB
testcase_49 AC 4,862 ms
264,996 KB
testcase_50 AC 4,856 ms
263,496 KB
testcase_51 AC 4,851 ms
266,840 KB
testcase_52 AC 4,861 ms
263,232 KB
testcase_53 AC 4,857 ms
264,712 KB
testcase_54 AC 4,853 ms
267,008 KB
testcase_55 AC 4,855 ms
265,568 KB
testcase_56 AC 4,852 ms
266,644 KB
testcase_57 AC 4,853 ms
266,364 KB
testcase_58 AC 4,852 ms
265,788 KB
testcase_59 AC 4,848 ms
266,292 KB
testcase_60 AC 4,859 ms
265,376 KB
testcase_61 AC 4,858 ms
264,780 KB
testcase_62 AC 4,857 ms
264,428 KB
testcase_63 AC 4,850 ms
266,256 KB
testcase_64 AC 4,863 ms
263,124 KB
testcase_65 AC 4,851 ms
265,332 KB
testcase_66 AC 4,850 ms
265,708 KB
testcase_67 AC 4,852 ms
264,648 KB
testcase_68 AC 4,847 ms
264,772 KB
testcase_69 AC 4,850 ms
266,764 KB
testcase_70 AC 4,848 ms
264,728 KB
testcase_71 AC 4,852 ms
265,316 KB
testcase_72 AC 4,855 ms
266,808 KB
testcase_73 AC 4,858 ms
264,500 KB
testcase_74 AC 4,924 ms
269,696 KB
testcase_75 AC 4,861 ms
268,328 KB
testcase_76 AC 4,854 ms
265,644 KB
testcase_77 AC 4,858 ms
265,512 KB
testcase_78 AC 4,859 ms
264,944 KB
testcase_79 AC 4,856 ms
263,596 KB
testcase_80 AC 4,849 ms
263,772 KB
testcase_81 AC 4,848 ms
267,352 KB
testcase_82 AC 4,850 ms
264,176 KB
testcase_83 AC 4,845 ms
265,948 KB
testcase_84 AC 4,853 ms
267,948 KB
testcase_85 AC 4,856 ms
263,352 KB
testcase_86 AC 4,854 ms
264,220 KB
testcase_87 AC 4,855 ms
265,396 KB
testcase_88 AC 4,848 ms
264,280 KB
testcase_89 AC 4,865 ms
265,744 KB
testcase_90 AC 4,850 ms
266,296 KB
testcase_91 AC 4,849 ms
265,160 KB
testcase_92 AC 4,853 ms
263,852 KB
testcase_93 AC 4,853 ms
265,712 KB
testcase_94 AC 4,852 ms
264,276 KB
testcase_95 AC 4,852 ms
265,224 KB
testcase_96 AC 4,862 ms
265,340 KB
testcase_97 AC 4,846 ms
265,116 KB
testcase_98 AC 4,847 ms
263,448 KB
testcase_99 AC 4,852 ms
264,872 KB
testcase_100 AC 4,851 ms
264,364 KB
testcase_101 AC 4,854 ms
262,772 KB
testcase_102 AC 4,858 ms
264,508 KB
testcase_103 AC 4,860 ms
262,756 KB
testcase_104 AC 4,850 ms
263,556 KB
testcase_105 AC 4,846 ms
267,120 KB
testcase_106 AC 4,851 ms
263,364 KB
testcase_107 AC 4,847 ms
263,732 KB
testcase_108 AC 4,843 ms
266,108 KB
testcase_109 AC 4,847 ms
264,048 KB
testcase_110 AC 4,846 ms
264,752 KB
testcase_111 AC 4,848 ms
266,116 KB
testcase_112 AC 4,849 ms
265,260 KB
testcase_113 AC 4,845 ms
266,020 KB
testcase_114 AC 4,843 ms
266,728 KB
testcase_115 AC 4,847 ms
263,424 KB
testcase_116 AC 4,863 ms
265,956 KB
testcase_117 AC 4,845 ms
267,328 KB
testcase_118 AC 4,849 ms
265,940 KB
testcase_119 AC 4,845 ms
266,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import sys
input = sys.stdin.readline
from operator import itemgetter
import time
from random import randint

time0=time.time()

def score(x,y):
    if x==-1:
        a,b,_=LR[y-1]
        return SUM[b]-SUM[a-1]
    else:
        a,b,_=LR[y-1]
        c,d,_=LR[x-1]

        a2,b2=min(a,c),max(a,c)
        c2,d2=min(b,d),max(b,d)

        return SUM[b2-1]-SUM[a2-1]+SUM[d2]-SUM[c2]
    
def score_reverse(x,y):
    sc=0

    if x==0:
        a=ANS[x]
        b=ANS[y]
        c=ANS[y+1]

        sc-=score(-1,a)+score(a,b)+score(b,c)
        sc+=score(-1,b)+score(b,a)+score(a,c)

        return sc

    if y==len(ANS)-1:
        a=ANS[x-1]
        b=ANS[x]
        c=ANS[y]

        sc-=score(a,b)+score(b,c)
        sc+=score(a,c)+score(c,b)

        return sc

    a=ANS[x-1]
    b=ANS[x]
    c=ANS[y]
    d=ANS[y+1]

    sc-=score(a,b)+score(b,c)+score(c,d)
    sc+=score(a,c)+score(c,b)+score(b,d)

    return sc

def last_score(ANS):
    sc=0
    for i in range(len(ANS)):
        if i==0:
            sc+=score(-1,ANS[0])
        else:
            sc+=score(ANS[i-1],ANS[i])

    return sc

N,Q,WT,ST=map(int,input().split())
W=list(map(int,input().split()))
LR=[list(map(int,input().split()))+[i+1] for i in range(Q)]
LR2=sorted(LR,key=itemgetter(0))

SUM=[0]

for w in W:
    SUM.append(SUM[-1]+w)

def initial_ans(interval):
    LIST=[[] for i in range(1000)]

    for x,y,ind in LR2:
        LIST[x//interval].append((y,ind))

    ANS=[]

    count=0
    for i in range(1000):
        if LIST[i]==[]:
            continue
        if count%2==0:
            LIST[i].sort(key=itemgetter(0))
        else:
            LIST[i].sort(key=itemgetter(0),reverse=True)
            
        for _,ind in LIST[i]:
            ANS.append(ind)

        count+=1

    return ANS

MIN=1<<60
MININD=0
LANS=[]
for i in range(520,570,5):
    ANS=initial_ans(i)
    x=last_score(ANS)
    if x<MIN:
        MIN=x
        LANS=ANS
        MININD=i

ANS=LANS

while time.time()-time0<4.7:
    k=randint(0,len(ANS)-2)

    if score_reverse(k,k+1)<0:
        ANS[k],ANS[k+1]=ANS[k+1],ANS[k]

print(*ANS)
0